Home
last modified time | relevance | path

Searched refs:KeyT (Results 1 – 25 of 60) sorted by relevance

123

/external/llvm/include/llvm/IR/
DValueMap.h41 template<typename KeyT, typename ValueT, typename Config>
44 template<typename DenseMapT, typename KeyT>
46 template<typename DenseMapT, typename KeyT>
52 template<typename KeyT, typename MutexT = sys::Mutex>
67 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
69 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete()
80 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
82 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
83 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH;
96 typedef KeyT key_type;
[all …]
/external/llvm-project/llvm/include/llvm/IR/
DValueMap.h46 template<typename KeyT, typename ValueT, typename Config>
48 template<typename DenseMapT, typename KeyT>
50 template<typename DenseMapT, typename KeyT>
56 template<typename KeyT, typename MutexT = sys::Mutex>
71 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
73 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete()
84 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
86 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
88 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
98 using key_type = KeyT;
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/
DValueMap.h46 template<typename KeyT, typename ValueT, typename Config>
48 template<typename DenseMapT, typename KeyT>
50 template<typename DenseMapT, typename KeyT>
56 template<typename KeyT, typename MutexT = sys::Mutex>
71 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
73 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete()
84 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
86 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
88 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
98 using key_type = KeyT;
[all …]
/external/llvm-project/llvm/include/llvm/ADT/
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,
52 typename KeyInfoT = DenseMapInfo<KeyT>,
53 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
[all …]
DIntervalMap.h435 template <typename KeyT, typename ValT>
444 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)),
449 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
458 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*))
562 template <typename KeyT, typename ValT, unsigned N, typename Traits>
563 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
565 const KeyT &start(unsigned i) const { return this->first[i].first; } in start()
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop()
569 KeyT &start(unsigned i) { return this->first[i].first; } in start()
570 KeyT &stop(unsigned i) { return this->first[i].second; } in stop()
[all …]
DMapVector.h34 template<typename KeyT, typename ValueT,
35 typename MapType = DenseMap<KeyT, unsigned>,
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) {
99 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(Key, 0);
110 ValueT lookup(const KeyT &Key) const { in lookup()
[all …]
DSparseSet.h66 template<typename KeyT, typename ValueT, typename KeyFunctorT>
75 template<typename KeyT, typename KeyFunctorT>
76 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
77 unsigned operator()(const KeyT &Key) const {
128 using KeyT = typename KeyFunctorT::argument_type;
135 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
224 iterator find(const KeyT &Key) {
228 const_iterator find(const KeyT &Key) const {
235 bool contains(const KeyT &Key) const { return find(Key) == end() ? 0 : 1; }
240 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; }
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
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,
52 typename KeyInfoT = DenseMapInfo<KeyT>,
53 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
[all …]
DIntervalMap.h435 template <typename KeyT, typename ValT>
444 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)),
449 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
458 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*))
562 template <typename KeyT, typename ValT, unsigned N, typename Traits>
563 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
565 const KeyT &start(unsigned i) const { return this->first[i].first; } in start()
566 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop()
569 KeyT &start(unsigned i) { return this->first[i].first; } in start()
570 KeyT &stop(unsigned i) { return this->first[i].second; } in stop()
[all …]
DMapVector.h34 template<typename KeyT, typename ValueT,
35 typename MapType = DenseMap<KeyT, unsigned>,
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) {
99 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(Key, 0);
110 ValueT lookup(const KeyT &Key) const { in lookup()
[all …]
DSparseSet.h66 template<typename KeyT, typename ValueT, typename KeyFunctorT>
75 template<typename KeyT, typename KeyFunctorT>
76 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
77 unsigned operator()(const KeyT &Key) const {
128 using KeyT = typename KeyFunctorT::argument_type;
135 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
224 iterator find(const KeyT &Key) {
228 const_iterator find(const KeyT &Key) const {
235 size_type count(const KeyT &Key) const {
262 ValueT &operator[](const KeyT &Key) {
[all …]
/external/llvm/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()
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,
57 typedef KeyT key_type;
[all …]
DIntervalMap.h430 template <typename KeyT, typename ValT>
439 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)),
444 typedef NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize> LeafBase;
453 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*))
559 template <typename KeyT, typename ValT, unsigned N, typename Traits>
560 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
562 const KeyT &start(unsigned i) const { return this->first[i].first; } in start()
563 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop()
566 KeyT &start(unsigned i) { return this->first[i].first; } in start()
567 KeyT &stop(unsigned i) { return this->first[i].second; } in stop()
[all …]
DMapVector.h29 template<typename KeyT, typename ValueT,
30 typename MapType = llvm::DenseMap<KeyT, unsigned>,
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) {
76 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
86 ValueT lookup(const KeyT &Key) const { in lookup()
[all …]
DSparseSet.h63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
72 template<typename KeyT, typename KeyFunctorT>
73 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
74 unsigned operator()(const KeyT &Key) const {
125 typedef typename KeyFunctorT::argument_type KeyT;
132 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
224 iterator find(const KeyT &Key) {
228 const_iterator find(const KeyT &Key) const {
235 size_type count(const KeyT &Key) const {
262 ValueT &operator[](const KeyT &Key) {
[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,
58 typedef KeyT key_type;
[all …]
/external/openscreen/third_party/abseil/src/absl/random/internal/
Dmock_helpers.h46 template <typename KeyT>
62 template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
69 template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
75 if (urbg->InvokeMock(::absl::base_internal::FastTypeId<KeyT>(), &arg_tuple,
93 template <typename KeyT, typename URBG, typename... Args>
95 -> absl::optional<typename KeySignature<KeyT>::result_type> {
99 return InvokeMockImpl<KeyT, typename KeySignature<KeyT>::result_type,
100 typename KeySignature<KeyT>::arg_tuple_type, URBG>(
111 template <typename KeyT, typename MockURBG>
114 .template RegisterMock<typename KeySignature<KeyT>::result_type,
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/random/internal/
Dmock_helpers.h46 template <typename KeyT>
62 template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
69 template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
75 if (urbg->InvokeMock(::absl::base_internal::FastTypeId<KeyT>(), &arg_tuple,
93 template <typename KeyT, typename URBG, typename... Args>
95 -> absl::optional<typename KeySignature<KeyT>::result_type> {
99 return InvokeMockImpl<KeyT, typename KeySignature<KeyT>::result_type,
100 typename KeySignature<KeyT>::arg_tuple_type, URBG>(
111 template <typename KeyT, typename MockURBG>
114 .template RegisterMock<typename KeySignature<KeyT>::result_type,
[all …]
/external/libtextclassifier/abseil-cpp/absl/random/internal/
Dmock_helpers.h46 template <typename KeyT>
62 template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
69 template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
75 if (urbg->InvokeMock(::absl::base_internal::FastTypeId<KeyT>(), &arg_tuple,
93 template <typename KeyT, typename URBG, typename... Args>
95 -> absl::optional<typename KeySignature<KeyT>::result_type> {
99 return InvokeMockImpl<KeyT, typename KeySignature<KeyT>::result_type,
100 typename KeySignature<KeyT>::arg_tuple_type, URBG>(
111 template <typename KeyT, typename MockURBG>
114 .template RegisterMock<typename KeySignature<KeyT>::result_type,
[all …]
/external/angle/third_party/abseil-cpp/absl/random/internal/
Dmock_helpers.h46 template <typename KeyT>
62 template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
69 template <typename KeyT, typename ReturnT, typename ArgTupleT, typename URBG,
75 if (urbg->InvokeMock(::absl::base_internal::FastTypeId<KeyT>(), &arg_tuple,
100 template <typename KeyT, typename URBG, typename... Args>
102 -> absl::optional<typename KeySignature<KeyT>::result_type> {
106 return InvokeMockImpl<KeyT, typename KeySignature<KeyT>::result_type,
107 typename KeySignature<KeyT>::arg_tuple_type, URBG>(
118 template <typename KeyT, typename MockURBG>
121 typename KeySignature<KeyT>::result_type,
[all …]
/external/llvm-project/llvm/unittests/IR/
DValueMapTest.cpp179 template<typename KeyT, typename MutexT>
180 struct LockMutex : ValueMapConfig<KeyT, MutexT> {
186 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
190 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
212 template<typename KeyT>
213 struct NoFollow : ValueMapConfig<KeyT> {
234 template<typename KeyT>
235 struct CountOps : ValueMapConfig<KeyT> {
241 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
244 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
[all …]
/external/llvm/unittests/IR/
DValueMapTest.cpp180 template<typename KeyT, typename MutexT>
181 struct LockMutex : ValueMapConfig<KeyT, MutexT> {
187 static void onRAUW(const ExtraData &Data, KeyT Old, KeyT New) { in onRAUW()
191 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
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 Old, KeyT New) { in onRAUW()
245 static void onDelete(const ExtraData &Data, KeyT Old) { in onDelete()
[all …]
/external/llvm-project/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h22 template <class KeyT, class ValueT> class BlotMapVector {
24 using MapTy = DenseMap<KeyT, size_t>;
28 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
55 ValueT &operator[](const KeyT &Arg) {
67 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
79 iterator find(const KeyT &Key) { in find()
86 const_iterator find(const KeyT &Key) const { in find()
96 void blot(const KeyT &Key) { in blot()
100 Vector[It->second].first = KeyT(); in blot()
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h22 template <class KeyT, class ValueT> class BlotMapVector {
24 using MapTy = DenseMap<KeyT, size_t>;
28 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
55 ValueT &operator[](const KeyT &Arg) {
67 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
79 iterator find(const KeyT &Key) { in find()
86 const_iterator find(const KeyT &Key) const { in find()
96 void blot(const KeyT &Key) { in blot()
100 Vector[It->second].first = KeyT(); in blot()
/external/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h17 template <class KeyT, class ValueT> class BlotMapVector {
19 typedef DenseMap<KeyT, size_t> MapTy;
22 typedef std::vector<std::pair<KeyT, ValueT>> VectorTy;
49 ValueT &operator[](const KeyT &Arg) {
61 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
73 iterator find(const KeyT &Key) { in find()
80 const_iterator find(const KeyT &Key) const { in find()
90 void blot(const KeyT &Key) { in blot()
94 Vector[It->second].first = KeyT(); in blot()

123