| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | DenseMap.h | 41 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 D | IntervalMap.h | 12 /// KeyT objects are mapped to ValT objects. Intervals of keys that map to the
38 // template <typename KeyT, typename ValT, unsigned N, typename Traits>
41 // typedef KeyT key_type;
51 // KeyT start() const;
52 // KeyT stop() const;
53 // ValT lookup(KeyT x, Value NotFound = Value()) const;
59 // const_iterator find(KeyT x) const;
60 // iterator find(KeyT x);
62 // void insert(KeyT a, KeyT
[all...] |
| H A D | MapVector.h | 33 template <typename KeyT, typename ValueT,
34 typename MapType = DenseMap<KeyT, unsigned>,
35 typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
45 using key_type = KeyT;
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, typenam
117 insert(const std::pair<KeyT,ValueT> & KV) insert() argument
129 insert(std::pair<KeyT,ValueT> && KV) insert() argument
[all...] |
| H A D | SparseSet.h | 67 template<typename KeyT, typename ValueT, typename KeyFunctorT>
74 /// SparseSetValFunctor<KeyT, KeyT> - Helper class for the common case of
76 template<typename KeyT, typename KeyFunctorT>
77 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
78 unsigned operator()(const KeyT &Key) const {
118 /// @tparam KeyFunctorT A functor that computes an unsigned index from KeyT.
128 using KeyT = typename KeyFunctorT::argument_type;
135 SparseSetValFunctor<KeyT, Value
[all...] |
| H A D | SparseMultiSet.h | 120 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 D | ImmutableMap.h | 61 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 D | DenseSet.h | 34 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()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | ValueMap.h | 45 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 …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/orc/ |
| H A D | interval_map.h | 29 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 D | interval_set.h | 27 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()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_dense_map.h | 26 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 D | sanitizer_dense_map_info.h | 36 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()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
| H A D | BlotMapVector.h | 22 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()
|
| /freebsd/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | ExprEngine.cpp | 734 using KeyT = std::pair<const Expr *, const LocationContext *>; in printIndicesOfElementsToConstructJson() typedef
743 KeyT LastKey; in printIndicesOfElementsToConstructJson()
745 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
758 const KeyT &Key = I.first; in printIndicesOfElementsToConstructJson()
798 using KeyT = std::pair<const CXXConstructExpr *, const LocationContext *>; in printPendingInitLoopJson() typedef
807 KeyT LastKey; in printPendingInitLoopJson()
809 const KeyT &Key = I.first; in printPendingInitLoopJson()
822 const KeyT &Key = I.first; in printPendingInitLoopJson()
857 using KeyT = const LocationContext *; in printPendingArrayDestructionsJson() typedef
863 KeyT LastKey = nullptr; in printPendingArrayDestructionsJson()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Sema/ |
| H A D | SemaExprObjC.cpp | 1036 QualType KeyT = Method->parameters()[1]->getType(); in BuildObjCDictionaryLiteral() local
1037 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1064 << 1 << KeyT in BuildObjCDictionaryLiteral()
1089 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1097 CheckObjCCollectionLiteralElement(SemaRef, Element.Key, KeyT); in BuildObjCDictionaryLiteral()
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | ExprConstant.cpp | 629 template<typename KeyT>
630 APValue &createTemporary(const KeyT *Key, QualType T,
1913 template<typename KeyT>
1914 APValue &CallStackFrame::createTemporary(const KeyT *Key, QualType T, in createTemporary()
|