Home
last modified time | relevance | path

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

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/IR/
H A DValueMap.h48 template<typename DenseMapT, typename KeyT>
71 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
84 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
98 using key_type = KeyT;
156 iterator find(const KeyT &Val) { in find()
165 ValueT lookup(const KeyT &Val) const { in lookup()
191 bool erase(const KeyT &Val) { in erase()
207 ValueT &operator[](const KeyT &Key) {
229 ValueMapCVH Wrap(KeyT key) const { in Wrap()
345 const KeyT first;
[all …]
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDenseMap.h42 using std::pair<KeyT, ValueT>::pair;
44 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
45 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
66 using key_type = KeyT;
79 if (shouldReverseIterate<KeyT>()) in begin()
302 bool erase(const KeyT &Val) { in erase()
369 P->getFirst().~KeyT(); in destroyAll()
416 B->getFirst().~KeyT(); in moveFromOldBuckets()
882 SmallDenseMap<KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT>, KeyT,
993 OldB->getFirst().~KeyT(); in swap()
[all …]
H A DIntervalMap.h454 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
568 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
632 insertFrom(unsigned &Pos, unsigned Size, KeyT a, KeyT b, ValT y) { in insertFrom()
959 KeyT start;
1066 KeyT stop() const { in stop()
1083 void insert(KeyT a, KeyT b, ValT y) { in insert()
1140 bool overlaps(KeyT a, KeyT b) { in overlaps()
1536 void treeInsert(KeyT a, KeyT b, ValT y);
1584 void insert(KeyT a, KeyT b, ValT y);
1787 iterator::insert(KeyT a, KeyT b, ValT y) { in insert()
[all …]
H A DMapVector.h34 template<typename KeyT, typename ValueT,
35 typename MapType = DenseMap<KeyT, unsigned>,
98 ValueT &operator[](const KeyT &Key) {
110 ValueT lookup(const KeyT &Key) const { in lookup()
142 size_type count(const KeyT &Key) const { in count()
147 iterator find(const KeyT &Key) { in find()
153 const_iterator find(const KeyT &Key) const { in find()
192 size_type erase(const KeyT &Key) { in erase()
231 template <typename KeyT, typename ValueT, unsigned N>
233 : MapVector<KeyT, ValueT, SmallDenseMap<KeyT, unsigned, N>,
[all …]
H A 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 {
240 size_type count(const KeyT &Key) const { return contains(Key) ? 1 : 0; }
265 ValueT &operator[](const KeyT &Key) {
[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.h60 template <typename KeyT, typename ValT,
61 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
237 template <typename KeyT, typename ValT,
238 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
262 ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X, in ImmutableMapRef() argument
263 typename ImmutableMap<KeyT, ValT>::Factory &F) in ImmutableMapRef() argument
293 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap()
294 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()
/freebsd-13.1/contrib/llvm-project/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()
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/DWARFLinker/
H A DDWARFLinkerCompileUnit.h21 template <typename KeyT, typename ValT>
23 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize,
24 IntervalMapHalfOpenInfo<KeyT>>;
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/
H A DCore.h222 template <typename KeyT>
224 fromMapKeys(const DenseMap<SymbolStringPtr, KeyT> &M,
/freebsd-13.1/contrib/llvm-project/clang/lib/Sema/
H A DSemaExprObjC.cpp1028 QualType KeyT = Method->parameters()[1]->getType(); in BuildObjCDictionaryLiteral() local
1029 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1059 << 1 << KeyT in BuildObjCDictionaryLiteral()
1084 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1092 KeyT); in BuildObjCDictionaryLiteral()
/freebsd-13.1/contrib/llvm-project/clang/lib/AST/
H A DExprConstant.cpp623 template<typename KeyT>
624 APValue &createTemporary(const KeyT *Key, QualType T,
1852 template<typename KeyT>
1853 APValue &CallStackFrame::createTemporary(const KeyT *Key, QualType T, in createTemporary()