/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
H A D | ValueMap.h | 46 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 …]
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
H A D | DenseMap.h | 40 template <typename KeyT, typename ValueT> 41 struct DenseMapPair : public std::pair<KeyT, ValueT> { 42 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() 46 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond() 47 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond() 52 template <typename KeyT, typename ValueT, 53 typename KeyInfoT = DenseMapInfo<KeyT>, 54 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>, [all …]
|
H A D | IntervalMap.h | 440 template <typename KeyT, typename ValT> 449 static_cast<unsigned>(2*sizeof(KeyT)+sizeof(ValT)), 454 using LeafBase = NodeBase<std::pair<KeyT, KeyT>, ValT, LeafSize>; 463 static_cast<unsigned>(sizeof(KeyT) + sizeof(void*)) 567 template <typename KeyT, typename ValT, unsigned N, typename Traits> 568 class LeafNode : public NodeBase<std::pair<KeyT, KeyT>, ValT, N> { 570 const KeyT &start(unsigned i) const { return this->first[i].first; } in start() 571 const KeyT &stop(unsigned i) const { return this->first[i].second; } in stop() 574 KeyT &start(unsigned i) { return this->first[i].first; } in start() 575 KeyT &stop(unsigned i) { return this->first[i].second; } in stop() [all …]
|
H A D | MapVector.h | 34 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 …]
|
H A D | SparseSet.h | 66 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 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 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 | 60 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 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()
|
/netbsd-src/external/apache2/llvm/dist/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()
|
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DWARFLinker/ |
H A D | DWARFLinkerCompileUnit.h | 21 template <typename KeyT, typename ValT> 23 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize, 24 IntervalMapHalfOpenInfo<KeyT>>;
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/ |
H A D | SemaExprObjC.cpp | 1028 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()
|
/netbsd-src/external/apache2/llvm/dist/clang/lib/AST/ |
H A D | ExprConstant.cpp | 623 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()
|
/netbsd-src/external/apache2/llvm/dist/llvm/docs/ |
H A D | ProgrammersManual.rst | 2308 ``MapVector<KeyT,ValueT>`` provides a subset of the DenseMap interface. The
|