Home
last modified time | relevance | path

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

/third_party/skia/third_party/externals/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 …]
/third_party/skia/third_party/externals/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 …]
DSparseMultiSet.h120 using KeyT = typename KeyFunctorT::argument_type; variable
126 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
375 iterator find(const KeyT &Key) { in find()
379 const_iterator find(const KeyT &Key) const { in find()
386 size_type count(const KeyT &Key) const { in count()
395 bool contains(const KeyT &Key) const { in contains()
400 iterator getHead(const KeyT &Key) { return find(Key); } in getHead()
401 iterator getTail(const KeyT &Key) { in getTail()
411 RangePair equal_range(const KeyT &K) { in equal_range()
482 void eraseAll(const KeyT &K) { in eraseAll()
DImmutableMap.h60 template <typename KeyT, typename ValT,
61 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
255 template <typename KeyT, typename ValT,
256 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
284 explicit ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X, in ImmutableMapRef() argument
285 typename ImmutableMap<KeyT, ValT>::Factory &F) in ImmutableMapRef() argument
342 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap()
343 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root)); in asImmutableMap()
DDenseSet.h34 template <typename KeyT> class DenseSetPair : public DenseSetEmpty {
35 KeyT key;
38 KeyT &getFirst() { return key; } in getFirst()
39 const KeyT &getFirst() const { return key; } in getFirst()
/third_party/skia/third_party/externals/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 …]
/third_party/skia/third_party/externals/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 …]
Dmock_overload_set.h46 using KeyT = Ret(DistrT, std::tuple<Args...>);
50 -> decltype(MockHelpers::MockFor<KeyT>(gen).gmock_Call(matchers...)) {
53 return MockHelpers::MockFor<KeyT>(gen).gmock_Call(matchers...);
62 using KeyT = Ret(DistrT, std::tuple<Arg, Args...>);
67 -> decltype(MockHelpers::MockFor<KeyT>(gen).gmock_Call(matcher,
71 return MockHelpers::MockFor<KeyT>(gen).gmock_Call(matcher, matchers...);
Ddistribution_caller.h68 using KeyT = ResultT(DistrT, ArgTupleT);
72 if (!urbg->InvokeMock(::absl::base_internal::FastTypeId<KeyT>(), &arg_tuple,
/third_party/skia/third_party/externals/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()
/third_party/json/doc/mkdocs/docs/api/basic_json/
Dfind.md4 template<typename KeyT>
5 iterator find(KeyT&& key);
7 template<typename KeyT>
8 const_iterator find(KeyT&& key) const
16 `KeyT`
Dcount.md4 template<typename KeyT>
5 size_type count(KeyT&& key) const;
13 `KeyT`
Dcontains.md4 template<typename KeyT>
5 bool contains(KeyT && key) const;
13 `KeyT`
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DWARFLinker/
DDWARFLinkerCompileUnit.h21 template <typename KeyT, typename ValT>
23 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize,
24 IntervalMapHalfOpenInfo<KeyT>>;
/third_party/skia/third_party/externals/dawn/src/tests/unittests/
DITypArrayTests.cpp22 using Key = TypedInteger<struct KeyT, uint32_t>;
DITypSpanTests.cpp24 using Key = TypedInteger<struct KeyT, size_t>;
DITypBitsetTests.cpp24 using Key = TypedInteger<struct KeyT, size_t>;
DITypVectorTests.cpp22 using Key = TypedInteger<struct KeyT, uint32_t>;
/third_party/json/include/nlohmann/
Djson.hpp4515 template<typename KeyT>
4516 iterator find(KeyT&& key) in find()
4522 result.m_it.object_iterator = m_value.object->find(std::forward<KeyT>(key)); in find()
4532 template<typename KeyT>
4533 const_iterator find(KeyT&& key) const in find()
4539 result.m_it.object_iterator = m_value.object->find(std::forward<KeyT>(key)); in find()
4566 template<typename KeyT>
4567 size_type count(KeyT&& key) const in count()
4570 return is_object() ? m_value.object->count(std::forward<KeyT>(key)) : 0; in count()
4598 template < typename KeyT, typename std::enable_if <
[all …]
/third_party/skia/third_party/vulkanmemoryallocator/include/
Dvk_mem_alloc.h4563 template <typename CmpLess, typename IterT, typename KeyT>
4564 static IterT VmaBinaryFindFirstNotLess(IterT beg, IterT end, const KeyT &key, const CmpLess& cmp) in VmaBinaryFindFirstNotLess()
4582 template<typename CmpLess, typename IterT, typename KeyT>
4583 IterT VmaBinaryFindSorted(const IterT& beg, const IterT& end, const KeyT& value, const CmpLess& cmp) in VmaBinaryFindSorted()
4585 IterT it = VmaBinaryFindFirstNotLess<CmpLess, IterT, KeyT>( in VmaBinaryFindSorted()
5800 #define VMA_MAP_TYPE(KeyT, ValueT) \
5801 …std::unordered_map< KeyT, ValueT, std::hash<KeyT>, std::equal_to<KeyT>, VmaStlAllocator< std::pair…
5818 template<typename KeyT, typename ValueT>
5822 typedef VmaPair<KeyT, ValueT> PairType;
5831 iterator find(const KeyT& key);
[all …]
/third_party/skia/third_party/externals/d3d12allocator/src/
DD3D12MemAlloc.cpp434 template <typename CmpLess, typename IterT, typename KeyT>
435 static IterT BinaryFindFirstNotLess(IterT beg, IterT end, const KeyT &key, const CmpLess& cmp) in BinaryFindFirstNotLess()
462 template<typename CmpLess, typename IterT, typename KeyT>
463 IterT BinaryFindSorted(const IterT& beg, const IterT& end, const KeyT& value, const CmpLess& cmp) in BinaryFindSorted()
465 IterT it = BinaryFindFirstNotLess<CmpLess, IterT, KeyT>(beg, end, value, cmp); in BinaryFindSorted()
/third_party/json/single_include/nlohmann/
Djson.hpp21916 template<typename KeyT>
21917 iterator find(KeyT&& key) in find()
21923 result.m_it.object_iterator = m_value.object->find(std::forward<KeyT>(key)); in find()
21933 template<typename KeyT>
21934 const_iterator find(KeyT&& key) const in find()
21940 result.m_it.object_iterator = m_value.object->find(std::forward<KeyT>(key)); in find()
21967 template<typename KeyT>
21968 size_type count(KeyT&& key) const in count()
21971 return is_object() ? m_value.object->count(std::forward<KeyT>(key)) : 0; in count()
21999 template < typename KeyT, typename std::enable_if <
[all …]