HomeSort by: relevance | last modified time | path
    Searched refs:KeyT (Results 1 - 14 of 14) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/IR/
ValueMap.h 19 // parameters should inherit from ValueMapConfig<KeyT> to get default
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*/) {}
73 static void onDelete(const ExtraDataT &/*Data*/, KeyT /*Old*/) {}
84 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
SparseSet.h 66 template<typename KeyT, typename ValueT, typename KeyFunctorT>
73 /// SparseSetValFunctor<KeyT, KeyT> - Helper class for the common case of
75 template<typename KeyT, typename KeyFunctorT>
76 struct SparseSetValFunctor<KeyT, KeyT, KeyFunctorT> {
77 unsigned operator()(const KeyT &Key) const {
117 /// @tparam KeyFunctorT A functor that computes an unsigned index from KeyT.
128 using KeyT = typename KeyFunctorT::argument_type;
135 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf
    [all...]
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; }
45 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; }
46 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; }
47 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; }
52 template <typename KeyT, typename ValueT
    [all...]
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(); }
84 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); }
85 std::pair<KeyT, ValueT> &back() { return Vector.back(); }
86 const std::pair<KeyT, ValueT> &back() const { return Vector.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
    [all...]
IntervalMap.h 11 // KeyT objects are mapped to ValT objects. Intervals of keys that map to the
37 // template <typename KeyT, typename ValT, unsigned N, typename Traits>
40 // typedef KeyT key_type;
50 // KeyT start() const;
51 // KeyT stop() const;
52 // ValT lookup(KeyT x, Value NotFound = Value()) const;
58 // const_iterator find(KeyT x) const;
59 // iterator find(KeyT x);
61 // void insert(KeyT a, KeyT b, ValT y)
    [all...]
SparseMultiSet.h 79 /// @tparam KeyFunctorT A functor that computes an unsigned index from KeyT.
120 using KeyT = typename KeyFunctorT::argument_type;
126 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
375 iterator find(const KeyT &Key) {
379 const_iterator find(const KeyT &Key) const {
386 size_type count(const KeyT &Key) const {
395 bool contains(const KeyT &Key) const {
400 iterator getHead(const KeyT &Key) { return find(Key); }
401 iterator getTail(const KeyT &Key) {
411 RangePair equal_range(const KeyT &K)
    [all...]
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,
263 typename ImmutableMap<KeyT, ValT>::Factory &F)
293 ImmutableMap<KeyT, ValT> asImmutableMap() const {
294 return ImmutableMap<KeyT, ValT>(Factory->getCanonicalTree(Root.get()));
DenseSet.h 34 template <typename KeyT> class DenseSetPair : public DenseSetEmpty {
35 KeyT key;
38 KeyT &getFirst() { return key; }
39 const KeyT &getFirst() const { return key; }
192 /// getHashValue(LookupKeyT) and isEqual(LookupKeyT, KeyT) for each key type
  /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/
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();
73 size_type count(const KeyT &Key) const {
78 value_type *find(const KeyT &Key) {
84 const value_type *find(const KeyT &Key) const {
94 /// getHashValue(LookupKeyT) and isEqual(LookupKeyT, KeyT) for each key
113 ValueT lookup(const KeyT &Key) const {
139 detail::DenseMapPair<value_type *, bool> try_emplace(KeyT &&Key,
155 detail::DenseMapPair<value_type *, bool> try_emplace(const KeyT &Key
    [all...]
sanitizer_dense_map_info.h 36 template <typename KeyT, typename ValueT>
38 KeyT first = {};
41 constexpr DenseMapPair(const KeyT &f, const ValueT &s)
54 KeyT &getFirst() { return first; }
55 const KeyT &getFirst() const { return first; }
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
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) {
79 iterator find(const KeyT &Key) {
86 const_iterator find(const KeyT &Key) const {
96 void blot(const KeyT &Key) {
100 Vector[It->second].first = KeyT();
  /src/external/apache2/llvm/dist/llvm/include/llvm/DWARFLinker/
DWARFLinkerCompileUnit.h 21 template <typename KeyT, typename ValT>
23 IntervalMap<KeyT, ValT, IntervalMapImpl::NodeSizer<KeyT, ValT>::LeafSize,
24 IntervalMapHalfOpenInfo<KeyT>>;
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaExprObjC.cpp 1028 QualType KeyT = Method->parameters()[1]->getType();
1029 const PointerType *PtrKey = KeyT->getAs<PointerType>();
1059 << 1 << KeyT
1084 QualType KeyT = KeysT->castAs<PointerType>()->getPointeeType();
1092 KeyT);
  /src/external/apache2/llvm/dist/clang/lib/AST/
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,

Completed in 107 milliseconds