/external/llvm/include/llvm/ADT/ |
H A D | 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...] |
H A D | DenseSet.h | 25 template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> > 27 typedef DenseMap<ValueT, char, ValueInfoT> MapTy; 30 typedef ValueT key_type; 31 typedef ValueT value_type; 49 size_type count(const ValueT &V) const { 53 bool erase(const ValueT &V) { 68 typedef ValueT value_type; 75 ValueT& operator*() { return I->first; } 76 ValueT* operato [all...] |
H A D | MapVector.h | 28 template<typename KeyT, typename ValueT, 30 typename VectorType = std::vector<std::pair<KeyT, ValueT> > > 65 std::pair<KeyT, ValueT> &front() { return Vector.front(); } 66 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } 67 std::pair<KeyT, ValueT> &back() { return Vector.back(); } 68 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } 75 ValueT &operator[](const KeyT &Key) { 80 Vector.push_back(std::make_pair(Key, ValueT())); 86 ValueT lookup(const KeyT &Key) const { 88 return Pos == Map.end()? ValueT() [all...] |
H A D | DenseMap.h | 34 template<typename KeyT, typename ValueT, 40 typename KeyT, typename ValueT, typename KeyInfoT> 43 typedef std::pair<KeyT, ValueT> BucketT; 48 typedef ValueT mapped_type; 51 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator; 52 typedef DenseMapIterator<KeyT, ValueT, 93 P->second.~ValueT(); 144 ValueT lookup(const KeyT &Val) const { 148 return ValueT(); 154 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> [all...] |
H A D | SparseMultiSet.h | 71 /// @tparam ValueT The type of objects in the set. 75 template<typename ValueT, 92 ValueT Data; 96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } 119 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf; 127 unsigned sparseIndex(const ValueT &Val) const { 157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { 183 typedef ValueT value_type; 184 typedef ValueT &reference; 185 typedef const ValueT [all...] |
H A D | StringMap.h | 23 template<typename ValueT> 25 template<typename ValueT>
|
H A D | Hashing.h | 452 template <typename ValueT> 453 typename std::enable_if<is_hashable_data<ValueT>::value, hash_code>::type 454 hash_combine_range_impl(ValueT *first, ValueT *last) {
|
/external/llvm/include/llvm/IR/ |
H A D | ValueMap.h | 37 template<typename KeyT, typename ValueT, typename Config> 76 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> > 78 friend class ValueMapCallbackVH<KeyT, ValueT, Config>; 79 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH; 80 typedef DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH> > MapT; 88 typedef ValueT mapped_type; 89 typedef std::pair<KeyT, ValueT> value_type; 128 ValueT lookup(const KeyT &Val) const { 130 return I != Map.end() ? I->second : ValueT(); 136 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> 285 typedef typename DenseMapT::mapped_type ValueT; typedef in class:llvm::ValueMapIterator 334 typedef typename DenseMapT::mapped_type ValueT; typedef in class:llvm::ValueMapConstIterator [all...] |
H A D | Module.h | 36 template<typename KeyT, typename ValueT, typename KeyInfoT> class DenseMap;
|
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
H A D | addressmap_unittest.cc | 62 typedef pair<int, size_t> ValueT; typedef 70 size_t SizeFunc(const ValueT& v) { return v.second; } 72 static void SetCheckCallback(const void* ptr, ValueT* val, 95 AddressMap<ValueT> map(malloc, free); 96 const ValueT* result; 119 ValueT removed;
|
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
H A D | addressmap_unittest.cc | 62 typedef pair<int, size_t> ValueT; typedef 70 size_t SizeFunc(const ValueT& v) { return v.second; } 72 static void SetCheckCallback(const void* ptr, ValueT* val, 95 AddressMap<ValueT> map(malloc, free); 96 const ValueT* result; 119 ValueT removed;
|
/external/llvm/include/llvm/Support/ |
H A D | YAMLParser.h | 273 /// BaseT must have a ValueT* member named CurrentEntry and a member function 275 template <class BaseT, class ValueT> 277 : public std::iterator<std::forward_iterator_tag, ValueT> { 282 ValueT *operator->() const { 287 ValueT &operator*() const { 293 operator ValueT *() const {
|
/external/llvm/unittests/ADT/ |
H A D | TinyPtrVectorTest.cpp | 39 typedef typename std::remove_pointer<PtrT>::type ValueT; typedef in class:__anon26463::TinyPtrVectorTest 44 ValueT TestValues[1024];
|
/external/clang/include/clang/ASTMatchers/ |
H A D | ASTMatchers.h | 2549 template <typename ValueT> 2550 internal::PolymorphicMatcherWithParam1<internal::ValueEqualsMatcher, ValueT> 2551 equals(const ValueT &Value) { 2554 ValueT>(Value);
|
H A D | ASTMatchersInternal.h | 1424 template <typename T, typename ValueT> 1433 explicit ValueEqualsMatcher(const ValueT &ExpectedValue) 1441 const ValueT ExpectedValue;
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 54 template<class KeyT, class ValueT> 60 typedef std::vector<std::pair<KeyT, ValueT> > VectorTy; 88 ValueT &operator[](const KeyT &Arg) { 94 Vector.push_back(std::make_pair(Arg, ValueT())); 101 insert(const std::pair<KeyT, ValueT> &InsertPair) {
|
/external/clang/lib/Sema/ |
H A D | SemaExprObjC.cpp | 819 QualType ValueT = Method->parameters()[0]->getType(); 820 const PointerType *PtrValue = ValueT->getAs<PointerType>(); 827 << 0 << ValueT 884 QualType ValueT = ValuesT->castAs<PointerType>()->getPointeeType(); local 900 = CheckObjCCollectionLiteralElement(*this, Elements[I].Value, ValueT);
|
/external/clang/include/clang/Sema/ |
H A D | Sema.h | 58 template <typename ValueT> struct DenseMapInfo; 59 template <typename ValueT, typename ValueInfoT> class DenseSet;
|