Home
last modified time | relevance | path

Searched refs:ValueT (Results 1 – 25 of 57) sorted by relevance

123

/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/
DDenseSet.h53 template <typename ValueT, typename MapTy, typename ValueInfoT>
55 static_assert(sizeof(typename MapTy::value_type) == sizeof(ValueT),
63 using key_type = ValueT;
64 using value_type = ValueT;
69 DenseSetImpl(std::initializer_list<ValueT> Elems) in DenseSetImpl()
91 size_type count(const_arg_type_t<ValueT> V) const { in count()
95 bool erase(const ValueT &V) { in erase()
112 using value_type = ValueT;
120 ValueT &operator*() { return I->getFirst(); }
121 const ValueT &operator*() const { return I->getFirst(); }
[all …]
DSparseSet.h56 template<typename ValueT>
58 static unsigned getValIndex(const ValueT &Val) { in getValIndex()
67 template<typename KeyT, typename ValueT, typename KeyFunctorT>
69 unsigned operator()(const ValueT &Val) const { in operator()
70 return SparseSetValTraits<ValueT>::getValIndex(Val); in operator()
121 template<typename ValueT,
130 using DenseT = SmallVector<ValueT, 8>;
136 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
139 using value_type = ValueT;
140 using reference = ValueT &;
[all …]
DSequence.h29 template <typename ValueT>
31 : public iterator_facade_base<value_sequence_iterator<ValueT>,
33 const ValueT> {
36 ValueT Value;
47 template <typename U, typename Enabler = decltype(ValueT(std::declval<U>()))>
75 template <typename ValueT>
76 iterator_range<detail::value_sequence_iterator<ValueT>> seq(ValueT Begin, in seq()
77 ValueT End) { in seq()
78 return make_range(detail::value_sequence_iterator<ValueT>(Begin), in seq()
79 detail::value_sequence_iterator<ValueT>(End)); in seq()
DDenseMap.h39 template <typename KeyT, typename ValueT>
40 struct DenseMapPair : public std::pair<KeyT, ValueT> {
41 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
42 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
43 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
44 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
50 typename KeyT, typename ValueT, typename KeyInfoT = DenseMapInfo<KeyT>,
51 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
54 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
63 using mapped_type = ValueT;
[all …]
DMapVector.h35 template<typename KeyT, typename ValueT,
37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
84 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
85 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
86 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
87 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
99 ValueT &operator[](const KeyT &Key) {
104 Vector.push_back(std::make_pair(Key, ValueT()));
111 ValueT lookup(const KeyT &Key) const { in lookup()
112 static_assert(std::is_copy_constructible<ValueT>::value, in lookup()
[all …]
DSparseMultiSet.h83 template<typename ValueT,
100 ValueT Data;
104 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {} in SMSNode()
127 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
135 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex()
160 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue()
186 using value_type = ValueT;
187 using reference = ValueT &;
188 using const_reference = const ValueT &;
189 using pointer = ValueT *;
[all …]
DAllocatorList.h88 template <class ValueT, class IteratorBase>
90 : public iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>,
92 std::bidirectional_iterator_tag, ValueT> {
98 iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>, IteratorBase,
99 std::bidirectional_iterator_tag, ValueT>;
102 using value_type = ValueT;
103 using pointer = ValueT *;
104 using reference = ValueT &;
/external/llvm/include/llvm/ADT/
DDenseSet.h38 template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> >
40 typedef DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
41 detail::DenseSetPair<ValueT>> MapTy;
42 static_assert(sizeof(typename MapTy::value_type) == sizeof(ValueT),
47 typedef ValueT key_type;
48 typedef ValueT value_type;
66 size_type count(const ValueT &V) const { in count()
70 bool erase(const ValueT &V) { in erase()
86 typedef ValueT value_type;
93 ValueT &operator*() { return I->getFirst(); }
[all …]
DSparseSet.h52 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,
126 typedef SmallVector<ValueT, 8> DenseT;
132 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
140 typedef ValueT value_type;
141 typedef ValueT &reference;
[all …]
DDenseMap.h38 template <typename KeyT, typename ValueT>
39 struct DenseMapPair : public std::pair<KeyT, ValueT> {
40 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
41 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
42 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
43 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
48 typename KeyT, typename ValueT, typename KeyInfoT = DenseMapInfo<KeyT>,
49 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
52 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
58 typedef ValueT mapped_type;
[all …]
DSequence.h25 template <typename ValueT>
27 : public iterator_facade_base<value_sequence_iterator<ValueT>,
29 const ValueT> {
32 ValueT Value;
43 template <typename U, typename Enabler = decltype(ValueT(std::declval<U>()))>
70 template <typename ValueT>
71 iterator_range<detail::value_sequence_iterator<ValueT>> seq(ValueT Begin, in seq()
72 ValueT End) { in seq()
73 return make_range(detail::value_sequence_iterator<ValueT>(Begin), in seq()
74 detail::value_sequence_iterator<ValueT>(End)); in seq()
DMapVector.h29 template<typename KeyT, typename ValueT,
31 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
60 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
61 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
62 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
63 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
75 ValueT &operator[](const KeyT &Key) {
80 Vector.push_back(std::make_pair(Key, ValueT()));
86 ValueT lookup(const KeyT &Key) const { in lookup()
88 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
[all …]
DSparseMultiSet.h75 template<typename ValueT,
92 ValueT Data;
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } in SMSNode()
119 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
127 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex()
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue()
183 typedef ValueT value_type;
184 typedef ValueT &reference;
185 typedef const ValueT &const_reference;
186 typedef ValueT *pointer;
[all …]
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
DDenseMap.h38 template <typename KeyT, typename ValueT>
39 struct DenseMapPair : public std::pair<KeyT, ValueT> {
40 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
41 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
42 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
43 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
49 typename KeyT, typename ValueT, typename KeyInfoT = DenseMapInfo<KeyT>,
50 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
53 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
59 typedef ValueT mapped_type;
[all …]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DDenseMap.h31 template<typename KeyT, typename ValueT,
33 typename ValueInfoT = DenseMapInfo<ValueT>, bool IsConst = false>
36 template<typename KeyT, typename ValueT,
38 typename ValueInfoT = DenseMapInfo<ValueT> >
40 typedef std::pair<KeyT, ValueT> BucketT;
48 typedef ValueT mapped_type;
71 P->second.~ValueT(); in ~DenseMap()
81 typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
82 typedef DenseMapIterator<KeyT, ValueT,
121 P->second.~ValueT(); in clear()
[all …]
DValueMap.h38 template<typename KeyT, typename ValueT, typename Config, typename ValueInfoT>
75 template<typename KeyT, typename ValueT, typename Config = ValueMapConfig<KeyT>,
76 typename ValueInfoT = DenseMapInfo<ValueT> >
78 friend class ValueMapCallbackVH<KeyT, ValueT, Config, ValueInfoT>;
79 typedef ValueMapCallbackVH<KeyT, ValueT, Config, ValueInfoT> ValueMapCVH;
80 typedef DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH>,
89 typedef ValueT mapped_type;
90 typedef std::pair<KeyT, ValueT> value_type;
128 ValueT lookup(const KeyT &Val) const { in lookup()
135 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
DDenseSet.h25 template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> >
27 typedef DenseMap<ValueT, char, ValueInfoT> MapTy;
43 bool count(const ValueT &V) const { in count()
47 bool erase(const ValueT &V) { in erase()
67 typedef ValueT value_type;
74 ValueT& operator*() { return I->first; }
75 ValueT* operator->() { return &I->first; }
87 typedef ValueT value_type;
94 const ValueT& operator*() { return I->first; }
95 const ValueT* operator->() { return &I->first; }
[all …]
/external/llvm/include/llvm/IR/
DValueMap.h41 template<typename KeyT, typename ValueT, typename Config>
80 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
82 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
83 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH;
84 typedef DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH> > MapT;
97 typedef ValueT mapped_type;
98 typedef std::pair<KeyT, ValueT> value_type;
160 ValueT lookup(const KeyT &Val) const { in lookup()
162 return I != Map.end() ? I->second : ValueT(); in lookup()
168 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
DValueMap.h47 template<typename KeyT, typename ValueT, typename Config>
85 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
87 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
89 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
90 using MapT = DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH>>;
101 using mapped_type = ValueT;
102 using value_type = std::pair<KeyT, ValueT>;
171 ValueT lookup(const KeyT &Val) const { in lookup()
173 return I != Map.end() ? I->second : ValueT(); in lookup()
179 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/DebugInfo/PDB/Native/
DHashTable.h35 template <typename ValueT, typename TraitsT> class HashTable;
37 template <typename ValueT, typename TraitsT>
39 : public iterator_facade_base<HashTableIterator<ValueT, TraitsT>,
41 std::pair<uint32_t, ValueT>> {
42 friend HashTable<ValueT, TraitsT>;
44 HashTableIterator(const HashTable<ValueT, TraitsT> &Map, uint32_t Index, in HashTableIterator() argument
49 HashTableIterator(const HashTable<ValueT, TraitsT> &Map) : Map(&Map) { in HashTableIterator() argument
72 const std::pair<uint32_t, ValueT> &operator*() const {
91 const HashTable<ValueT, TraitsT> *Map;
104 template <typename ValueT, typename TraitsT = PdbHashTraits<ValueT>>
[all …]
/external/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.ctor/
Dpointer.pass.cpp42 typedef typename std::conditional<!IsArray, A, A[]>::type ValueT; in test_pointer() typedef
46 using U1 = std::unique_ptr<ValueT>; in test_pointer()
47 using U2 = std::unique_ptr<ValueT, Deleter<ValueT> >; in test_pointer()
59 A* p = newValue<ValueT>(expect_alive); in test_pointer()
61 std::unique_ptr<ValueT> s(p); in test_pointer()
66 A* p = newValue<ValueT>(expect_alive); in test_pointer()
68 std::unique_ptr<ValueT, NCDeleter<ValueT> > s(p); in test_pointer()
/external/libcxx/test/std/utilities/memory/util.smartptr/util.smartptr.hash/
Dhash_unique_ptr.pass.cpp30 template <class ValueT, class Del>
32 using UPtr = std::unique_ptr<ValueT, Del>; in test_enabled_with_deleter()
41 template <class ValueT, class Del>
43 using UPtr = std::unique_ptr<ValueT, Del>; in test_disabled_with_deleter()
/external/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h17 template <class KeyT, class ValueT> class BlotMapVector {
22 typedef std::vector<std::pair<KeyT, ValueT>> VectorTy;
49 ValueT &operator[](const KeyT &Arg) {
55 Vector.push_back(std::make_pair(Arg, ValueT()));
61 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h23 template <class KeyT, class ValueT> class BlotMapVector {
29 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
56 ValueT &operator[](const KeyT &Arg) {
62 Vector.push_back(std::make_pair(Arg, ValueT()));
68 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
DCostAllocator.h29 template <typename ValueT> class ValuePool {
31 using PoolRef = std::shared_ptr<const ValueT>;
42 const ValueT &getValue() const { return Value; } in getValue()
46 ValueT Value;

123