Home
last modified time | relevance | path

Searched refs:KeyT (Results 1 – 12 of 12) sorted by relevance

/external/llvm/include/llvm/ADT/
DValueMap.h37 template<typename KeyT, typename ValueT, typename Config>
40 template<typename DenseMapT, typename KeyT>
42 template<typename DenseMapT, typename KeyT>
48 template<typename KeyT>
61 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
63 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete()
74 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
76 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
77 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH;
85 typedef KeyT key_type;
[all …]
DIntervalMap.h429 template <typename KeyT, typename ValT>
438 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)),
443 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
452 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*))
558 template <typename KeyT, typename ValT, unsigned N, typename Traits>
559 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
561 const KeyT &start(unsigned i) const { return this->first[i].first; } in start()
562 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop()
565 KeyT &start(unsigned i) { return this->first[i].first; } in start()
566 KeyT &stop(unsigned i) { return this->first[i].second; } in stop()
[all …]
DDenseMap.h34 template<typename KeyT, typename ValueT,
35 typename KeyInfoT = DenseMapInfo<KeyT>,
40 typename KeyT, typename ValueT, typename KeyInfoT>
43 typedef std::pair<KeyT, ValueT> BucketT;
46 typedef KeyT key_type;
50 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
51 typedef DenseMapIterator<KeyT, ValueT,
86 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); in clear()
101 bool count(const KeyT &Val) const { in count()
106 iterator find(const KeyT &Val) { in find()
[all …]
DMapVector.h30 template<typename KeyT, typename ValueT,
31 typename MapType = llvm::DenseMap<KeyT, unsigned>,
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) {
78 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
88 ValueT lookup(const KeyT &Key) const { in lookup()
[all …]
DSparseSet.h63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
72 template<typename KeyT, typename KeyFunctorT>
73 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
74 unsigned operator()(const KeyT &Key) const {
121 typedef typename KeyFunctorT::argument_type KeyT;
127 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
222 iterator find(const KeyT &Key) {
226 const_iterator find(const KeyT &Key) const {
232 bool count(const KeyT &Key) const {
259 ValueT &operator[](const KeyT &Key) {
[all …]
DSparseMultiSet.h109 typedef typename KeyFunctorT::argument_type KeyT; typedef
115 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
379 iterator find(const KeyT &Key) { in find()
383 const_iterator find(const KeyT &Key) const { in find()
390 unsigned count(const KeyT &Key) const { in count()
399 bool contains(const KeyT &Key) const { in contains()
404 iterator getHead(const KeyT &Key) { return find(Key); } in getHead()
405 iterator getTail(const KeyT &Key) { in getTail()
415 RangePair equal_range(const KeyT &K) { in equal_range()
486 void eraseAll(const KeyT &K) { in eraseAll()
DImmutableMap.h59 template <typename KeyT, typename ValT,
60 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
214 typedef typename ImmutableMap<KeyT,ValT,ValInfo>::value_type value_type;
215 typedef typename ImmutableMap<KeyT,ValT,ValInfo>::value_type_ref reference;
269 template <typename KeyT, typename ValT,
270 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
297 explicit ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X, in ImmutableMapRef() argument
298 typename ImmutableMap<KeyT, ValT>::Factory &F) in ImmutableMapRef() argument
355 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap()
356 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root)); in asImmutableMap()
/external/llvm/unittests/IR/
DValueMapTest.cpp180 template<typename KeyT>
181 struct LockMutex : ValueMapConfig<KeyT> {
187 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
191 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
212 template<typename KeyT>
213 struct NoFollow : ValueMapConfig<KeyT> {
234 template<typename KeyT>
235 struct CountOps : ValueMapConfig<KeyT> {
241 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
244 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
[all …]
/external/llvm/lib/Transforms/ObjCARC/
DObjCARCOpts.cpp50 template<class KeyT, class ValueT>
53 typedef DenseMap<KeyT, size_t> MapTy;
56 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy;
84 ValueT &operator[](const KeyT &Arg) { in operator []()
97 insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
109 const_iterator find(const KeyT &Key) const { in find()
118 void blot(const KeyT &Key) { in blot()
121 Vector[It->second].first = KeyT(); in blot()
/external/llvm/include/llvm/IR/
DModule.h32 template<typename KeyT, typename ValueT, typename KeyInfoT> class DenseMap;
/external/clang/lib/Sema/
DSemaExprObjC.cpp818 QualType KeyT = Method->param_begin()[1]->getType(); in BuildObjCDictionaryLiteral() local
819 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
846 << 1 << KeyT in BuildObjCDictionaryLiteral()
871 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
879 KeyT); in BuildObjCDictionaryLiteral()
/external/llvm/docs/
DProgrammersManual.rst1335 ``MapVector<KeyT,ValueT>`` provides a subset of the DenseMap interface. The