| /external/llvm/include/llvm/ADT/ |
| D | SparseSet.h | 52 template<typename ValueT>
54 static unsigned getValIndex(const ValueT &Val) { in getValIndex()
63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
65 unsigned operator()(const ValueT &Val) const { in operator()
66 return SparseSetValTraits<ValueT>::getValIndex(Val); in operator()
117 template<typename ValueT,
122 typedef SmallVector<ValueT, 8> DenseT;
127 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
135 typedef ValueT value_type;
136 typedef ValueT &reference;
[all …]
|
| D | DenseSet.h | 25 template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> >
27 typedef DenseMap<ValueT, char, ValueInfoT> MapTy;
45 bool count(const ValueT &V) const { in count()
49 bool erase(const ValueT &V) { in erase()
69 typedef ValueT value_type;
76 ValueT& operator*() { return I->first; }
77 ValueT* operator->() { return &I->first; }
89 typedef ValueT value_type;
96 const ValueT& operator*() { return I->first; }
97 const ValueT* operator->() { return &I->first; }
[all …]
|
| D | ValueMap.h | 37 template<typename KeyT, typename ValueT, typename Config>
74 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
76 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
77 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH;
78 typedef DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH> > MapT;
86 typedef ValueT mapped_type;
87 typedef std::pair<KeyT, ValueT> value_type;
125 ValueT lookup(const KeyT &Val) const { in lookup()
127 return I != Map.end() ? I->second : ValueT(); in lookup()
133 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
|
| D | DenseMap.h | 34 template<typename KeyT, typename ValueT,
40 typename KeyT, typename ValueT, typename KeyInfoT>
43 typedef std::pair<KeyT, ValueT> BucketT;
47 typedef ValueT mapped_type;
50 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
51 typedef DenseMapIterator<KeyT, ValueT,
90 P->second.~ValueT(); in clear()
141 ValueT lookup(const KeyT &Val) const { in lookup()
145 return ValueT(); in lookup()
151 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
|
| D | MapVector.h | 30 template<typename KeyT, typename ValueT,
32 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
67 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
68 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
69 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
70 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
77 ValueT &operator[](const KeyT &Key) {
82 Vector.push_back(std::make_pair(Key, ValueT()));
88 ValueT lookup(const KeyT &Key) const { in lookup()
90 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
[all …]
|
| D | SparseMultiSet.h | 75 template<typename ValueT,
88 ValueT Data;
92 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } in SMSNode()
115 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
123 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex()
153 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue()
179 typedef ValueT value_type;
180 typedef ValueT &reference;
181 typedef const ValueT &const_reference;
182 typedef ValueT *pointer;
[all …]
|
| D | Hashing.h | 453 template <typename ValueT>
454 typename enable_if<is_hashable_data<ValueT>, hash_code>::type
455 hash_combine_range_impl(ValueT *first, ValueT *last) {
|
| D | StringMap.h | 22 template<typename ValueT>
24 template<typename ValueT>
|
| /external/llvm/include/llvm/Support/ |
| D | YAMLParser.h | 263 template <class BaseT, class ValueT>
265 : public std::iterator<std::forward_iterator_tag, ValueT> {
270 ValueT *operator ->() const {
275 ValueT &operator *() const {
281 operator ValueT*() const {
|
| /external/llvm/unittests/ADT/ |
| D | TinyPtrVectorTest.cpp | 39 typedef typename remove_pointer<PtrT>::type ValueT; typedef in __anon6ff54fc90111::TinyPtrVectorTest
44 ValueT TestValues[1024];
|
| /external/clang/include/clang/ASTMatchers/ |
| D | ASTMatchers.h | 2343 template <typename ValueT>
2344 internal::PolymorphicMatcherWithParam1<internal::ValueEqualsMatcher, ValueT>
2345 equals(const ValueT &Value) { in equals()
2348 ValueT>(Value); in equals()
|
| D | ASTMatchersInternal.h | 1084 template <typename T, typename ValueT>
1093 explicit ValueEqualsMatcher(const ValueT &ExpectedValue) in ValueEqualsMatcher()
1101 const ValueT ExpectedValue;
|
| /external/llvm/include/llvm/IR/ |
| D | Module.h | 32 template<typename KeyT, typename ValueT, typename KeyInfoT> class DenseMap;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | ObjCARCOpts.cpp | 50 template<class KeyT, class ValueT>
56 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy;
84 ValueT &operator[](const KeyT &Arg) { in operator []()
90 Vector.push_back(std::make_pair(Arg, ValueT())); in operator []()
97 insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert()
|
| /external/clang/lib/Sema/ |
| D | SemaExprObjC.cpp | 804 QualType ValueT = Method->param_begin()[0]->getType(); in BuildObjCDictionaryLiteral() local
805 const PointerType *PtrValue = ValueT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
812 << 0 << ValueT in BuildObjCDictionaryLiteral()
869 QualType ValueT = ValuesT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
885 = CheckObjCCollectionLiteralElement(*this, Elements[I].Value, ValueT); in BuildObjCDictionaryLiteral()
|
| /external/clang/include/clang/Sema/ |
| D | Sema.h | 53 template <typename ValueT> struct DenseMapInfo;
54 template <typename ValueT, typename ValueInfoT> class DenseSet;
|
| /external/llvm/docs/ |
| D | ProgrammersManual.rst | 1335 ``MapVector<KeyT,ValueT>`` provides a subset of the DenseMap interface. The
|