Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DValueMap.h49 template<typename DenseMapT, typename KeyT>
72 static void onRAUW(const ExtraDataT & /*Data*/, KeyT /*Old*/, KeyT /*New*/) {} in onRAUW()
85 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
100 using key_type = KeyT;
162 iterator find(const KeyT &Val) { in find()
171 ValueT lookup(const KeyT &Val) const { in lookup()
197 bool erase(const KeyT &Val) { in erase()
213 ValueT &operator[](const KeyT &Key) {
235 ValueMapCVH Wrap(KeyT key) const { in Wrap()
349 const KeyT first;
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DDenseMap.h70 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
71 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
92 using key_type = KeyT;
105 if (shouldReverseIterate<KeyT>()) in begin()
298 bool erase(const KeyT &Val) { in erase()
337 ValueT &operator[](KeyT &&Key) {
365 P->getFirst().~KeyT(); in destroyAll()
412 B->getFirst().~KeyT(); in moveFromOldBuckets()
873 SmallDenseMap<KeyT, ValueT, InlineBuckets, KeyInfoT, BucketT>, KeyT,
981 OldB->getFirst().~KeyT(); in swap()
[all …]
H A DIntervalMap.h450 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>;
564 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> {
628 insertFrom(unsigned &Pos, unsigned Size, KeyT a, KeyT b, ValT y) { in insertFrom()
955 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()
1531 void treeInsert(KeyT a, KeyT b, ValT y);
1579 void insert(KeyT a, KeyT b, ValT y);
1782 iterator::insert(KeyT a, KeyT b, ValT y) { in insert()
[all …]
H A DMapVector.h35 template<typename KeyT, typename ValueT,
36 typename MapType = DenseMap<KeyT, unsigned>,
99 ValueT &operator[](const KeyT &Key) {
111 ValueT lookup(const KeyT &Key) const { in lookup()
143 size_type count(const KeyT &Key) const { in count()
148 iterator find(const KeyT &Key) { in find()
154 const_iterator find(const KeyT &Key) const { in find()
193 size_type erase(const KeyT &Key) { in erase()
232 template <typename KeyT, typename ValueT, unsigned N>
234 : MapVector<KeyT, ValueT, SmallDenseMap<KeyT, unsigned, N>,
[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 {
129 using KeyT = typename KeyFunctorT::argument_type;
136 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
225 iterator find(const KeyT &Key) {
229 const_iterator find(const KeyT &Key) const {
236 size_type count(const KeyT &Key) const {
263 ValueT &operator[](const KeyT &Key) {
[all …]
H A DSparseMultiSet.h121 using KeyT = typename KeyFunctorT::argument_type; variable
127 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
376 iterator find(const KeyT &Key) { in find()
380 const_iterator find(const KeyT &Key) const { in find()
387 size_type count(const KeyT &Key) const { in count()
396 bool contains(const KeyT &Key) const { in contains()
401 iterator getHead(const KeyT &Key) { return find(Key); } in getHead()
402 iterator getTail(const KeyT &Key) { in getTail()
412 RangePair equal_range(const KeyT &K) { in equal_range()
483 void eraseAll(const KeyT &K) { in eraseAll()
H A DImmutableMap.h61 template <typename KeyT, typename ValT,
62 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
256 template <typename KeyT, typename ValT,
257 typename ValInfo = ImutKeyValueInfo<KeyT,ValT>>
285 explicit ImmutableMapRef(const ImmutableMap<KeyT, ValT> &X, in ImmutableMapRef() argument
286 typename ImmutableMap<KeyT, ValT>::Factory &F) in ImmutableMapRef() argument
343 ImmutableMap<KeyT, ValT> asImmutableMap() const { in asImmutableMap()
344 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root)); in asImmutableMap()
H A DDenseSet.h35 template <typename KeyT> class DenseSetPair : public DenseSetEmpty {
36 KeyT key;
39 KeyT &getFirst() { return key; } in getFirst()
40 const KeyT &getFirst() const { return key; } in getFirst()
/freebsd-12.1/contrib/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h23 template <class KeyT, class ValueT> class BlotMapVector {
25 using MapTy = DenseMap<KeyT, size_t>;
29 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
56 ValueT &operator[](const KeyT &Arg) {
68 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert() argument
80 iterator find(const KeyT &Key) { in find()
87 const_iterator find(const KeyT &Key) const { in find()
97 void blot(const KeyT &Key) { in blot()
101 Vector[It->second].first = KeyT(); in blot()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Sema/
H A DSemaExprObjC.cpp952 QualType KeyT = Method->parameters()[1]->getType(); in BuildObjCDictionaryLiteral() local
953 const PointerType *PtrKey = KeyT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
983 << 1 << KeyT in BuildObjCDictionaryLiteral()
1008 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1016 KeyT); in BuildObjCDictionaryLiteral()