reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
43 using iterator = const T *; 44 using const_iterator = const T *; 50 const T *Data = nullptr; 66 /*implicit*/ ArrayRef(const T &OneElt) 70 /*implicit*/ ArrayRef(const T *data, size_t length) 74 ArrayRef(const T *begin, const T *end) 74 ArrayRef(const T *begin, const T *end) 81 /*implicit*/ ArrayRef(const SmallVectorTemplateCommon<T, U> &Vec) 87 /*implicit*/ ArrayRef(const std::vector<T, A> &Vec) 92 /*implicit*/ constexpr ArrayRef(const std::array<T, N> &Arr) 97 /*implicit*/ constexpr ArrayRef(const T (&Arr)[N]) : Data(Arr), Length(N) {} 100 /*implicit*/ ArrayRef(const std::initializer_list<T> &Vec) 145 const T *data() const { return Data; } 151 const T &front() const { 157 const T &back() const { 163 template <typename Allocator> ArrayRef<T> copy(Allocator &A) { 178 ArrayRef<T> slice(size_t N, size_t M) const { 184 ArrayRef<T> slice(size_t N) const { return slice(N, size() - N); } 187 ArrayRef<T> drop_front(size_t N = 1) const { 193 ArrayRef<T> drop_back(size_t N = 1) const { 200 template <class PredicateT> ArrayRef<T> drop_while(PredicateT Pred) const { 206 template <class PredicateT> ArrayRef<T> drop_until(PredicateT Pred) const { 211 ArrayRef<T> take_front(size_t N = 1) const { 218 ArrayRef<T> take_back(size_t N = 1) const { 226 template <class PredicateT> ArrayRef<T> take_while(PredicateT Pred) const { 232 template <class PredicateT> ArrayRef<T> take_until(PredicateT Pred) const { 239 const T &operator[](size_t Index) const { 249 typename std::enable_if<std::is_same<U, T>::value, ArrayRef<T>>::type & 257 typename std::enable_if<std::is_same<U, T>::value, ArrayRef<T>>::type & 263 std::vector<T> vec() const { 270 operator std::vector<T>() const {include/llvm/ADT/DenseMap.h
65 using key_type = KeyT; 69 using iterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT>; 71 DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT, true>; 145 size_type count(const_arg_type_t<KeyT> Val) const { 156 const_iterator find(const_arg_type_t<KeyT> Val) const { 185 ValueT lookup(const_arg_type_t<KeyT> Val) const { 272 bool erase(const KeyT &Val) { 291 value_type& FindAndConstruct(const KeyT &Key) { 299 ValueT &operator[](const KeyT &Key) { 303 value_type& FindAndConstruct(KeyT &&Key) { 311 ValueT &operator[](KeyT &&Key) { 334 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); 349 const KeyT EmptyKey = getEmptyKey(); 351 ::new (&B->getFirst()) KeyT(EmptyKey); 369 const KeyT EmptyKey = getEmptyKey(); 370 const KeyT TombstoneKey = getTombstoneKey(); 392 const DenseMapBase<OtherBaseT, KeyT, ValueT, KeyInfoT, BucketT> &other) { 399 if (is_trivially_copyable<KeyT>::value && 406 KeyT(other.getBuckets()[i].getFirst()); 414 static unsigned getHashValue(const KeyT &Val) { 419 static unsigned getHashValue(const LookupKeyT &Val) { 423 static const KeyT getEmptyKey() { 429 static const KeyT getTombstoneKey() { 437 if (shouldReverseIterate<KeyT>()) { 515 BucketT *InsertIntoBucket(BucketT *TheBucket, KeyArg &&Key, 525 BucketT *InsertIntoBucketWithLookup(BucketT *TheBucket, KeyT &&Key, 535 BucketT *InsertIntoBucketImpl(const KeyT &Key, const LookupKeyT &Lookup, 535 BucketT *InsertIntoBucketImpl(const KeyT &Key, const LookupKeyT &Lookup, 566 const KeyT EmptyKey = getEmptyKey(); 578 bool LookupBucketFor(const LookupKeyT &Val, 590 const KeyT EmptyKey = getEmptyKey(); 591 const KeyT TombstoneKey = getTombstoneKey(); 629 bool LookupBucketFor(const LookupKeyT &Val, BucketT *&FoundBucket) { 684 class DenseMap : public DenseMapBase<DenseMap<KeyT, ValueT, KeyInfoT, BucketT>, 685 KeyT, ValueT, KeyInfoT, BucketT> { 690 using BaseT = DenseMapBase<DenseMap, KeyT, ValueT, KeyInfoT, BucketT>; 1163 using ConstIterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>; 1186 if (shouldReverseIterate<KeyT>()) { 1199 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) 1249 const KeyT Empty = KeyInfoT::getEmptyKey(); 1250 const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 1259 const KeyT Empty = KeyInfoT::getEmptyKey(); 1260 const KeyT Tombstone = KeyInfoT::getTombstoneKey();include/llvm/ADT/DenseSet.h
35 KeyT key; 38 KeyT &getFirst() { return key; } 39 const KeyT &getFirst() const { return key; } 55 static_assert(sizeof(typename MapTy::value_type) == sizeof(ValueT), 63 using key_type = ValueT; 64 using value_type = ValueT; 69 DenseSetImpl(std::initializer_list<ValueT> Elems) 91 size_type count(const_arg_type_t<ValueT> V) const { 95 bool erase(const ValueT &V) { 112 using value_type = ValueT; 120 ValueT &operator*() { return I->getFirst(); } 121 const ValueT &operator*() const { return I->getFirst(); } 122 ValueT *operator->() { return &I->getFirst(); } 123 const ValueT *operator->() const { return &I->getFirst(); } 165 iterator find(const_arg_type_t<ValueT> V) { return Iterator(TheMap.find(V)); } 166 const_iterator find(const_arg_type_t<ValueT> V) const { 187 std::pair<iterator, bool> insert(const ValueT &V) { 192 std::pair<iterator, bool> insert(ValueT &&V) { 200 std::pair<iterator, bool> insert_as(const ValueT &V, 205 std::pair<iterator, bool> insert_as(ValueT &&V, const LookupKeyT &LookupKey) { 250 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT, 250 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT, 251 detail::DenseSetPair<ValueT>>, 254 detail::DenseSetImpl<ValueT, 255 DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT, 256 detail::DenseSetPair<ValueT>>,include/llvm/ADT/SmallVector.h
75 AlignedCharArrayUnion<T> FirstEl; 114 using value_type = T; 115 using iterator = T *; 116 using const_iterator = const T *; 121 using reference = T &; 122 using const_reference = const T &; 123 using pointer = T *; 124 using const_pointer = const T *; 259 class SmallVectorTemplateBase<T, true> : public SmallVectorTemplateCommon<T> { 264 static void destroy_range(T *, T *) {} 264 static void destroy_range(T *, T *) {} 299 void grow(size_t MinSize = 0) { this->grow_pod(MinSize, sizeof(T)); } 302 void push_back(const T &Elt) { 315 class SmallVectorImpl : public SmallVectorTemplateBase<T> { 316 using SuperClass = SmallVectorTemplateBase<T>; 357 void resize(size_type N, const T &NV) { 374 LLVM_NODISCARD T pop_back_val() { 397 void append(size_type NumInputs, const T &Elt) { 405 void append(std::initializer_list<T> IL) { 412 void assign(size_type NumElts, const T &Elt) { 429 void assign(std::initializer_list<T> IL) { 467 iterator insert(iterator I, T &&Elt) { 497 iterator insert(iterator I, const T &Elt) { 526 iterator insert(iterator I, size_type NumToInsert, const T &Elt) { 637 void insert(iterator I, std::initializer_list<T> IL) { 641 template <typename... ArgTypes> reference emplace_back(ArgTypes &&... Args) { 644 ::new ((void *)this->end()) T(std::forward<ArgTypes>(Args)...); 644 ::new ((void *)this->end()) T(std::forward<ArgTypes>(Args)...); 820 AlignedCharArrayUnion<T> InlineElts[N]; 837 class SmallVector : public SmallVectorImpl<T>, SmallVectorStorage<T, N> { 837 class SmallVector : public SmallVectorImpl<T>, SmallVectorStorage<T, N> { 846 explicit SmallVector(size_t Size, const T &Value = T()) 865 SmallVector(std::initializer_list<T> IL) : SmallVectorImpl<T>(N) { 884 SmallVector(SmallVectorImpl<T> &&RHS) : SmallVectorImpl<T>(N) {include/llvm/Support/AlignOf.h
30 T t; 39 template <typename T> union SizerImpl<T> { char arr[sizeof(T)]; }; 50 llvm::detail::SizerImpl<T, Ts...>)];include/llvm/Support/type_traits.h
65 using type = const T &; 91 T t; 122 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{}); 122 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{}); 122 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{}); 130 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{}); 130 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{}); 130 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{}); 145 std::is_copy_constructible<detail::trivial_helper<T>>::value; 147 !std::is_copy_constructible<T>::value; 151 std::is_move_constructible<detail::trivial_helper<T>>::value; 153 !std::is_move_constructible<T>::value; 157 is_copy_assignable<detail::trivial_helper<T>>::value; 159 !is_copy_assignable<T>::value; 163 is_move_assignable<detail::trivial_helper<T>>::value; 165 !is_move_assignable<T>::value; 169 std::is_destructible<detail::trivial_helper<T>>::value;tools/clang/tools/libclang/Indexing.cpp
85 friend bool operator==(const PPRegion &lhs, const PPRegion &rhs) { 85 friend bool operator==(const PPRegion &lhs, const PPRegion &rhs) { 97 static inline PPRegion getEmptyKey() { 100 static inline PPRegion getTombstoneKey() { 104 static unsigned getHashValue(const PPRegion &S) { 114 static bool isEqual(const PPRegion &LHS, const PPRegion &RHS) { 114 static bool isEqual(const PPRegion &LHS, const PPRegion &RHS) { 127 llvm::DenseSet<PPRegion> ParsedRegions; 132 llvm::DenseSet<PPRegion> getParsedRegions() const { 137 void addParsedRegions(ArrayRef<PPRegion> Regions) { 154 llvm::DenseSet<PPRegion> ParsedRegionsSnapshot; 156 SmallVector<PPRegion, 32> NewParsedRegions; 159 PPRegion LastRegion; 177 PPRegion region = getRegion(Loc, FID, FE); 202 PPRegion getRegion(SourceLocation Loc, FileID FID, const FileEntry *FE) {usr/include/c++/7.4.0/bits/move.h
72 constexpr _Tp&& 73 forward(typename std::remove_reference<_Tp>::type& __t) noexcept 83 constexpr _Tp&& 84 forward(typename std::remove_reference<_Tp>::type&& __t) noexcept 98 move(_Tp&& __t) noexceptusr/include/c++/7.4.0/initializer_list
50 typedef _E value_type; 51 typedef const _E& reference; 52 typedef const _E& const_reference; 54 typedef const _E* iterator; 55 typedef const _E* const_iterator;usr/include/c++/7.4.0/type_traits
215 : public __is_void_helper<typename remove_cv<_Tp>::type>::type 326 : public __is_integral_helper<typename remove_cv<_Tp>::type>::type 354 : public __is_floating_point_helper<typename remove_cv<_Tp>::type>::type 381 : public __is_pointer_helper<typename remove_cv<_Tp>::type>::type 567 : public __is_null_pointer_helper<typename remove_cv<_Tp>::type>::type 581 : public __or_<is_lvalue_reference<_Tp>, 582 is_rvalue_reference<_Tp>>::type 588 : public __or_<is_integral<_Tp>, is_floating_point<_Tp>>::type 588 : public __or_<is_integral<_Tp>, is_floating_point<_Tp>>::type 601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>, 601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>, 602 is_void<_Tp>>>::type 611 : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>, 611 : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>, 611 : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>, 612 is_member_pointer<_Tp>, is_null_pointer<_Tp>>::type 612 is_member_pointer<_Tp>, is_null_pointer<_Tp>>::type 631 : public __is_member_pointer_helper<typename remove_cv<_Tp>::type>::type 638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type 638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type 777 : public __and_<is_array<_Tp>, __not_<extent<_Tp>>> 777 : public __and_<is_array<_Tp>, __not_<extent<_Tp>>> 798 typedef decltype(__test<_Tp>(0)) type; 811 remove_all_extents<_Tp>::type>::type 825 : public __is_destructible_safe<_Tp>::type 984 typedef decltype(__test<_Tp, _Arg>(0)) type; 989 : public __and_<is_destructible<_Tp>, 990 __is_direct_constructible_impl<_Tp, _Arg>> 1072 __is_direct_constructible_ref_cast<_Tp, _Arg>, 1073 __is_direct_constructible_new_safe<_Tp, _Arg> 1079 : public __is_direct_constructible_new<_Tp, _Arg>::type 1119 : public __is_direct_constructible<_Tp, _Arg> 1130 : public __is_constructible_impl<_Tp, _Args...>::type 1142 : public is_constructible<_Tp, const _Tp&> 1142 : public is_constructible<_Tp, const _Tp&> 1148 : public __is_copy_constructible_impl<_Tp> 1160 : public is_constructible<_Tp, _Tp&&> 1160 : public is_constructible<_Tp, _Tp&&> 1166 : public __is_move_constructible_impl<_Tp> 1554 { typedef _Tp type; }; 1563 { typedef _Tp type; }; 1574 remove_const<typename remove_volatile<_Tp>::type>::type type; 1629 { typedef _Tp type; }; 1633 { typedef _Tp type; }; 1659 { typedef _Tp&& type; }; 1955 { typedef _Tp type; };