Searched refs:KeyT (Results 1 - 9 of 9) sorted by relevance

/external/llvm/include/llvm/ADT/
H A DValueMap.h20 // parameters should inherit from ValueMapConfig<KeyT> to get default
38 template<typename KeyT, typename ValueT, typename Config>
41 template<typename DenseMapT, typename KeyT>
43 template<typename DenseMapT, typename KeyT>
49 template<typename KeyT>
62 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {}
64 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {}
75 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
[all...]
H A DSparseSet.h63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
70 /// SparseSetValFunctor<KeyT, KeyT> - Helper class for the common case of
72 template<typename KeyT, typename KeyFunctorT>
73 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
74 unsigned operator()(const KeyT &Key) const {
114 /// @tparam KeyFunctorT A functor that computes an unsigned index from KeyT.
121 typedef typename KeyFunctorT::argument_type KeyT; typedef in class:llvm::SparseSet
127 SparseSetValFunctor<KeyT, Value
[all...]
H A 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();
101 bool count(const KeyT &Val) const {
106 iterator find(const KeyT
[all...]
H A DIntervalMap.h12 // KeyT objects are mapped to ValT objects. Intervals of keys that map to the
38 // template <typename KeyT, typename ValT, unsigned N, typename Traits>
41 // typedef KeyT key_type;
51 // KeyT start() const;
52 // KeyT stop() const;
53 // ValT lookup(KeyT x, Value NotFound = Value()) const;
59 // const_iterator find(KeyT x) const;
60 // iterator find(KeyT x);
62 // void insert(KeyT a, KeyT
[all...]
H A DImmutableMap.h59 template <typename KeyT, typename ValT,
60 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
264 template <typename KeyT, typename ValT,
265 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
335 ImmutableMap<KeyT, ValT> asImmutableMap() const {
336 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root));
/external/llvm/unittests/VMCore/
H A DValueMapTest.cpp181 template<typename KeyT>
182 struct LockMutex : ValueMapConfig<KeyT> {
188 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) {
192 static void onDelete(const ExtraData &Data, KeyT Old) {
213 template<typename KeyT>
214 struct NoFollow : ValueMapConfig<KeyT> {
235 template<typename KeyT>
236 struct CountOps : ValueMapConfig<KeyT> {
242 static void onRAUW(const ExtraData &Data, KeyT Ol
[all...]
/external/llvm/include/llvm/
H A DModule.h33 template<typename KeyT, typename ValueT, typename KeyInfoT> class DenseMap;
/external/llvm/lib/Transforms/Scalar/
H A DObjCARC.cpp47 template<class KeyT, class ValueT>
50 typedef DenseMap<KeyT, size_t> MapTy;
54 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy;
81 ValueT &operator[](const KeyT &Arg) {
94 insert(const std::pair<KeyT, ValueT> &InsertPair) {
106 const_iterator find(const KeyT &Key) const {
116 void blot(const KeyT &Key) {
119 Vector[It->second].first = KeyT();
/external/clang/lib/Sema/
H A DSemaExprObjC.cpp818 QualType KeyT = Method->param_begin()[1]->getType(); local
819 const PointerType *PtrKey = KeyT->getAs<PointerType>();
846 << 1 << KeyT
871 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); local
879 KeyT);

Completed in 838 milliseconds