| /external/llvm/include/llvm/ADT/ |
| SparseSet.h | 34 /// directly compares ValueT, only their indices, so it can map keys to
50 /// For best results, ValueT should not require a destructor.
52 template<typename ValueT>
54 static unsigned getValIndex(const ValueT &Val) {
60 /// generic implementation handles ValueT classes which either provide
63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
65 unsigned operator()(const ValueT &Val) const {
66 return SparseSetValTraits<ValueT>::getValIndex(Val);
113 /// @tparam ValueT The type of objects in the set.
117 template<typename ValueT,
[all...] |
| DenseSet.h | 25 template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> >
27 typedef DenseMap<ValueT, char, ValueInfoT> MapTy;
45 bool count(const ValueT &V) const {
49 bool erase(const ValueT &V) {
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;
[all...] |
| 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 {
127 return I != Map.end() ? I->second : ValueT();
133 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| 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(); }
68 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
69 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
70 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); }
77 ValueT &operator[](const KeyT &Key) {
82 Vector.push_back(std::make_pair(Key, ValueT()));
88 ValueT lookup(const KeyT &Key) const {
90 return Pos == Map.end()? ValueT() : Vector[Pos->second].second
[all...] |
| 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();
141 ValueT lookup(const KeyT &Val) const {
145 return ValueT();
151 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV)
[all...] |
| SparseMultiSet.h | 71 /// @tparam ValueT The type of objects in the set.
75 template<typename ValueT,
88 ValueT Data;
92 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { }
115 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
123 unsigned sparseIndex(const ValueT &Val) const {
153 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) {
179 typedef ValueT value_type;
180 typedef ValueT &reference;
181 typedef const ValueT &const_reference
[all...] |
| StringMap.h | 22 template<typename ValueT>
24 template<typename ValueT>
|
| 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) {
|
| /external/llvm/include/llvm/Support/ |
| YAMLParser.h | 261 /// BaseT must have a ValueT* member named CurrentEntry and a member function
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/ |
| TinyPtrVectorTest.cpp | 39 typedef typename remove_pointer<PtrT>::type ValueT;
44 ValueT TestValues[1024];
|
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchers.h | [all...] |
| ASTMatchersInternal.h | [all...] |
| /external/llvm/include/llvm/IR/ |
| Module.h | 32 template<typename KeyT, typename ValueT, typename KeyInfoT> class DenseMap;
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 50 template<class KeyT, class ValueT>
56 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy;
84 ValueT &operator[](const KeyT &Arg) {
90 Vector.push_back(std::make_pair(Arg, ValueT()));
97 insert(const std::pair<KeyT, ValueT> &InsertPair) {
[all...] |
| /external/clang/lib/Sema/ |
| SemaExprObjC.cpp | [all...] |
| /external/clang/include/clang/Sema/ |
| Sema.h | 53 template <typename ValueT> struct DenseMapInfo;
54 template <typename ValueT, typename ValueInfoT> class DenseSet;
[all...] |
