Home
last modified time | relevance | path

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

1234

/external/llvm-project/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;
75 DenseSetImpl(std::initializer_list<ValueT> Elems) in DenseSetImpl()
97 size_type count(const_arg_type_t<ValueT> V) const { in count()
101 bool erase(const ValueT &V) { in erase()
118 using value_type = ValueT;
126 ValueT &operator*() { return I->getFirst(); }
127 const ValueT &operator*() const { return I->getFirst(); }
[all …]
DSparseSet.h55 template<typename ValueT>
57 static unsigned getValIndex(const ValueT &Val) { in getValIndex()
66 template<typename KeyT, typename ValueT, typename KeyFunctorT>
68 unsigned operator()(const ValueT &Val) const { in operator()
69 return SparseSetValTraits<ValueT>::getValIndex(Val); in operator()
120 template<typename ValueT,
129 using DenseT = SmallVector<ValueT, 8>;
135 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
138 using value_type = ValueT;
139 using reference = ValueT &;
[all …]
DSequence.h28 template <typename ValueT>
30 : public iterator_facade_base<value_sequence_iterator<ValueT>,
32 const ValueT> {
35 ValueT Value;
46 template <typename U, typename Enabler = decltype(ValueT(std::declval<U>()))>
74 template <typename ValueT>
75 iterator_range<detail::value_sequence_iterator<ValueT>> seq(ValueT Begin, in seq()
76 ValueT End) { in seq()
77 return make_range(detail::value_sequence_iterator<ValueT>(Begin), in seq()
78 detail::value_sequence_iterator<ValueT>(End)); in seq()
DDenseMap.h39 template <typename KeyT, typename ValueT>
40 struct DenseMapPair : public std::pair<KeyT, ValueT> {
41 using std::pair<KeyT, ValueT>::pair;
43 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
44 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
45 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
46 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
51 template <typename KeyT, typename ValueT,
53 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
57 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
[all …]
DMapVector.h34 template<typename KeyT, typename ValueT,
36 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
83 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
84 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
85 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
86 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
98 ValueT &operator[](const KeyT &Key) {
103 Vector.push_back(std::make_pair(Key, ValueT()));
110 ValueT lookup(const KeyT &Key) const { in lookup()
111 static_assert(std::is_copy_constructible<ValueT>::value, in lookup()
[all …]
/external/swiftshader/third_party/llvm-10.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.h55 template<typename ValueT>
57 static unsigned getValIndex(const ValueT &Val) { in getValIndex()
66 template<typename KeyT, typename ValueT, typename KeyFunctorT>
68 unsigned operator()(const ValueT &Val) const { in operator()
69 return SparseSetValTraits<ValueT>::getValIndex(Val); in operator()
120 template<typename ValueT,
129 using DenseT = SmallVector<ValueT, 8>;
135 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
138 using value_type = ValueT;
139 using reference = ValueT &;
[all …]
DSequence.h28 template <typename ValueT>
30 : public iterator_facade_base<value_sequence_iterator<ValueT>,
32 const ValueT> {
35 ValueT Value;
46 template <typename U, typename Enabler = decltype(ValueT(std::declval<U>()))>
74 template <typename ValueT>
75 iterator_range<detail::value_sequence_iterator<ValueT>> seq(ValueT Begin, in seq()
76 ValueT End) { in seq()
77 return make_range(detail::value_sequence_iterator<ValueT>(Begin), in seq()
78 detail::value_sequence_iterator<ValueT>(End)); in seq()
DDenseMap.h39 template <typename KeyT, typename ValueT>
40 struct DenseMapPair : public std::pair<KeyT, ValueT> {
41 using std::pair<KeyT, ValueT>::pair;
43 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
44 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
45 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
46 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
51 template <typename KeyT, typename ValueT,
53 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
57 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
[all …]
DMapVector.h34 template<typename KeyT, typename ValueT,
36 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
83 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
84 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
85 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
86 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
98 ValueT &operator[](const KeyT &Key) {
103 Vector.push_back(std::make_pair(Key, ValueT()));
110 ValueT lookup(const KeyT &Key) const { in lookup()
111 static_assert(std::is_copy_constructible<ValueT>::value, in lookup()
[all …]
/external/llvm-project/mlir/include/mlir/Support/
DThreadLocalCache.h27 template <typename ValueT>
33 struct CacheType : public llvm::SmallDenseMap<ThreadLocalCache<ValueT> *,
34 std::weak_ptr<ValueT>> {
38 if (std::shared_ptr<ValueT> value = it.second.lock()) in ~CacheType()
61 ValueT &get() { in get()
64 std::weak_ptr<ValueT> &threadInstance = staticCache[this]; in get()
65 if (std::shared_ptr<ValueT> value = threadInstance.lock()) in get()
70 instances.push_back(std::make_shared<ValueT>()); in get()
71 std::shared_ptr<ValueT> &instance = instances.back(); in get()
80 ValueT &operator*() { return get(); }
[all …]
DLLVM.h38 template <typename KeyT, typename ValueT> struct DenseMapPair;
40 template <typename KeyT, typename ValueT, typename KeyInfoT, typename BucketT>
44 template <typename ValueT, typename ValueInfoT>
100 template <typename KeyT, typename ValueT,
102 typename BucketT = llvm::detail::DenseMapPair<KeyT, ValueT>>
103 using DenseMap = llvm::DenseMap<KeyT, ValueT, KeyInfoT, BucketT>;
104 template <typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT>>
105 using DenseSet = llvm::DenseSet<ValueT, ValueInfoT>;
/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 …]
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()
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 …]
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 …]
/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/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/llvm-project/llvm/include/llvm/IR/
DValueMap.h46 template<typename KeyT, typename ValueT, typename Config>
84 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
86 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
88 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
89 using MapT = DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH>>;
99 using mapped_type = ValueT;
100 using value_type = std::pair<KeyT, ValueT>;
165 ValueT lookup(const KeyT &Val) const { in lookup()
167 return I != Map.end() ? I->second : ValueT(); in lookup()
173 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DValueMap.h46 template<typename KeyT, typename ValueT, typename Config>
84 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
86 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
88 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
89 using MapT = DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH>>;
99 using mapped_type = ValueT;
100 using value_type = std::pair<KeyT, ValueT>;
165 ValueT lookup(const KeyT &Val) const { in lookup()
167 return I != Map.end() ? I->second : ValueT(); in lookup()
173 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
/external/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
DHashTable.h34 template <typename ValueT> class HashTable;
36 template <typename ValueT>
38 : public iterator_facade_base<HashTableIterator<ValueT>,
40 const std::pair<uint32_t, ValueT>> {
41 friend HashTable<ValueT>;
43 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator()
48 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator()
72 const std::pair<uint32_t, ValueT> &operator*() const {
79 using iterator_facade_base<HashTableIterator<ValueT>,
81 const std::pair<uint32_t, ValueT>>::operator++;
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/PDB/Native/
DHashTable.h34 template <typename ValueT> class HashTable;
36 template <typename ValueT>
38 : public iterator_facade_base<HashTableIterator<ValueT>,
40 const std::pair<uint32_t, ValueT>> {
41 friend HashTable<ValueT>;
43 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator()
48 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator()
72 const std::pair<uint32_t, ValueT> &operator*() const {
79 using iterator_facade_base<HashTableIterator<ValueT>,
81 const std::pair<uint32_t, ValueT>>::operator++;
[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/llvm-project/libcxx/test/std/utilities/smartptr/unique.ptr/unique.ptr.class/unique.ptr.ctor/
Dpointer.pass.cpp41 typedef typename std::conditional<!IsArray, A, A[]>::type ValueT; in test_pointer() typedef
45 using U1 = std::unique_ptr<ValueT>; in test_pointer()
46 using U2 = std::unique_ptr<ValueT, Deleter<ValueT> >; in test_pointer()
58 A* p = newValue<ValueT>(expect_alive); in test_pointer()
60 std::unique_ptr<ValueT> s(p); in test_pointer()
65 A* p = newValue<ValueT>(expect_alive); in test_pointer()
67 std::unique_ptr<ValueT, NCDeleter<ValueT> > s(p); in test_pointer()

1234