Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/llvm/include/llvm/IR/
H A DValueMap.h45 template<typename KeyT, typename ValueT, typename Config>
47 template<typename DenseMapT, typename KeyT>
49 template<typename DenseMapT, typename KeyT>
55 template<typename KeyT, typename MutexT = sys::Mutex>
70 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
72 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {} in onDelete()
83 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
85 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
87 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
97 using key_type = KeyT;
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DDenseMap.h41 template <typename KeyT, typename ValueT>
42 struct DenseMapPair : public std::pair<KeyT, ValueT> {
43 using std::pair<KeyT, ValueT>::pair;
45 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
46 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
47 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
48 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
53 template <typename KeyT, typename ValueT,
54 typename KeyInfoT = DenseMapInfo<KeyT>,
55 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
[all …]
H A DIntervalMap.h438 template <typename KeyT, typename ValT>
447 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)),
452 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
461 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*))
565 template <typename KeyT, typename ValT, unsigned N, typename Traits>
566 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
568 const KeyT &start(unsigned i) const { return this->first[i].first; } in start()
569 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop()
572 KeyT &start(unsigned i) { return this->first[i].first; } in start()
573 KeyT &stop(unsigned i) { return this->first[i].second; } in stop()
[all …]
H A DMapVector.h34 template<typename KeyT, typename ValueT,
35 typename MapType = DenseMap<KeyT, unsigned>,
36 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
46 using key_type = KeyT;
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) {
100 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(Key, 0);
[all …]
H A DSparseSet.h67 template<typename KeyT, typename ValueT, typename KeyFunctorT>
76 template<typename KeyT, typename KeyFunctorT>
77 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
78 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 …]
H A 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()
H A DImmutableMap.h61 template <typename KeyT, typename ValT,
62 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
201 template <typename KeyT, typename ValT,
202 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
226 ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X, in ImmutableMapRef() argument
227 typename ImmutableMap<KeyT, ValT>::Factory &F) in ImmutableMapRef() argument
257 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap()
258 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root.get())); in asImmutableMap()
H A 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()
/openbsd-src/gnu/llvm/compiler-rt/lib/orc/
H A Dinterval_map.h29 template <typename KeyT, typename ValT> class IntervalMapBase {
31 using KeyPairT = std::pair<KeyT, KeyT>;
38 bool operator()(const KeyPairT &LHS, const KeyT &RHS) const { in operator()
41 bool operator()(const KeyT &LHS, const KeyPairT &RHS) const { in operator()
63 iterator find(KeyT K) { in find()
77 const_iterator find(KeyT K) const { in find()
78 return const_cast<IntervalMapBase<KeyT, ValT> *>(this)->find(K); in find()
81 ValT lookup(KeyT K, ValT NotFound = ValT()) const {
90 void erase(KeyT KS, KeyT KE) { in erase()
125 template <typename KeyT, typename ValT, IntervalCoalescing Coalescing>
[all …]
H A Dinterval_set.h27 template <typename KeyT, IntervalCoalescing Coalescing>
30 using ImplMap = IntervalMap<KeyT, std::monostate, Coalescing>;
33 using value_type = std::pair<KeyT, KeyT>;
69 const_iterator find(KeyT K) const { in find()
73 void insert(KeyT KS, KeyT KE) { in insert()
77 void erase(KeyT KS, KeyT KE) { in erase()
/openbsd-src/gnu/llvm/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_dense_map.h26 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
31 using key_type = KeyT;
50 const KeyT EmptyKey = getEmptyKey(), TombstoneKey = getTombstoneKey(); in clear()
73 size_type count(const KeyT &Key) const { in count()
78 value_type *find(const KeyT &Key) { in find()
84 const value_type *find(const KeyT &Key) const { in find()
113 ValueT lookup(const KeyT &Key) const { in lookup()
139 detail::DenseMapPair<value_type *, bool> try_emplace(KeyT &&Key, in try_emplace()
155 detail::DenseMapPair<value_type *, bool> try_emplace(const KeyT &Key, in try_emplace()
186 bool erase(const KeyT &Val) { in erase()
[all …]
H A Dsanitizer_dense_map_info.h36 template <typename KeyT, typename ValueT>
38 KeyT first = {};
41 constexpr DenseMapPair(const KeyT &f, const ValueT &s) in DenseMapPair()
54 KeyT &getFirst() { return first; } in getFirst()
55 const KeyT &getFirst() const { return first; } in getFirst()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/ObjCARC/
H A 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()
/openbsd-src/gnu/llvm/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_dense_map_test.cpp22 template <typename KeyT, typename ValueT,
23 typename KeyInfoT = DenseMapInfo<KeyT>>
24 class TestDenseMap : public DenseMap<KeyT, ValueT, KeyInfoT> {
25 using BaseT = DenseMap<KeyT, ValueT, KeyInfoT>;
/openbsd-src/gnu/llvm/clang/lib/StaticAnalyzer/Core/
H A DExprEngine.cpp729 using KeyT = std::pair<const Expr *, const LocationContext *>; in printIndicesOfElementsToConstructJson() typedef
738 KeyT LastKey; in printIndicesOfElementsToConstructJson()
740 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
753 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
793 using KeyT = std::pair<const CXXConstructExpr *, const LocationContext *>; in printPendingInitLoopJson() typedef
802 KeyT LastKey; in printPendingInitLoopJson()
804 const KeyT &Key = I.first; in printPendingInitLoopJson()
817 const KeyT &Key = I.first; in printPendingInitLoopJson()
852 using KeyT = const LocationContext *; in printPendingArrayDestructionsJson() typedef
858 KeyT LastKey = nullptr; in printPendingArrayDestructionsJson()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/ExecutionEngine/Orc/
H A DCore.h227 template <typename KeyT>
229 fromMapKeys(const DenseMap<SymbolStringPtr, KeyT> &M,
/openbsd-src/gnu/llvm/clang/lib/Sema/
H A DSemaExprObjC.cpp1029 QualType KeyT = Method->parameters()[1]->getType(); in BuildObjCDictionaryLiteral() local
1030 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1057 << 1 << KeyT in BuildObjCDictionaryLiteral()
1082 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1090 KeyT); in BuildObjCDictionaryLiteral()
/openbsd-src/gnu/llvm/clang/lib/AST/
H A DExprConstant.cpp618 template<typename KeyT>
619 APValue &createTemporary(const KeyT *Key, QualType T,
1853 template<typename KeyT>
1854 APValue &CallStackFrame::createTemporary(const KeyT *Key, QualType T, in createTemporary()
/openbsd-src/gnu/llvm/llvm/docs/
H A DProgrammersManual.rst2349 ``MapVector<KeyT,ValueT>`` provides a subset of the DenseMap interface. The