Home
last modified time | relevance | path

Searched refs:ValueT (Results 1 – 17 of 17) sorted by relevance

/external/llvm/include/llvm/ADT/
DDenseSet.h38 template<typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT> >
40 typedef DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
41 detail::DenseSetPair<ValueT>> MapTy;
42 static_assert(sizeof(typename MapTy::value_type) == sizeof(ValueT),
47 typedef ValueT key_type;
48 typedef ValueT value_type;
66 size_type count(const ValueT &V) const { in count()
70 bool erase(const ValueT &V) { in erase()
86 typedef ValueT value_type;
93 ValueT &operator*() { return I->getFirst(); }
[all …]
DSparseSet.h52 template<typename ValueT>
54 static unsigned getValIndex(const ValueT &Val) { in getValIndex()
63 template<typename KeyT, typename ValueT, typename KeyFunctorT>
65 unsigned operator()(const ValueT &Val) const { in operator()
66 return SparseSetValTraits<ValueT>::getValIndex(Val); in operator()
117 template<typename ValueT,
126 typedef SmallVector<ValueT, 8> DenseT;
132 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
140 typedef ValueT value_type;
141 typedef ValueT &reference;
[all …]
DDenseMap.h38 template <typename KeyT, typename ValueT>
39 struct DenseMapPair : public std::pair<KeyT, ValueT> {
40 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
41 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
42 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
43 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
48 typename KeyT, typename ValueT, typename KeyInfoT = DenseMapInfo<KeyT>,
49 typename Bucket = detail::DenseMapPair<KeyT, ValueT>, bool IsConst = false>
52 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
58 typedef ValueT mapped_type;
[all …]
DMapVector.h29 template<typename KeyT, typename ValueT,
31 typename VectorType = std::vector<std::pair<KeyT, ValueT> > >
60 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
61 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
62 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
63 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
75 ValueT &operator[](const KeyT &Key) {
80 Vector.push_back(std::make_pair(Key, ValueT()));
86 ValueT lookup(const KeyT &Key) const { in lookup()
88 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
[all …]
DSparseMultiSet.h75 template<typename ValueT,
92 ValueT Data;
96 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) { } in SMSNode()
119 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
127 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex()
157 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue()
183 typedef ValueT value_type;
184 typedef ValueT &reference;
185 typedef const ValueT &const_reference;
186 typedef ValueT *pointer;
[all …]
DHashing.h447 template <typename ValueT>
448 typename std::enable_if<is_hashable_data<ValueT>::value, hash_code>::type
449 hash_combine_range_impl(ValueT *first, ValueT *last) {
DStringMap.h23 template<typename ValueT>
25 template<typename ValueT>
/external/llvm/include/llvm/IR/
DValueMap.h40 template<typename KeyT, typename ValueT, typename Config>
79 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT> >
81 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
82 typedef ValueMapCallbackVH<KeyT, ValueT, Config> ValueMapCVH;
83 typedef DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH> > MapT;
93 typedef ValueT mapped_type;
94 typedef std::pair<KeyT, ValueT> value_type;
141 ValueT lookup(const KeyT &Val) const { in lookup()
143 return I != Map.end() ? I->second : ValueT(); in lookup()
149 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
/external/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h17 template <class KeyT, class ValueT> class BlotMapVector {
22 typedef std::vector<std::pair<KeyT, ValueT>> VectorTy;
49 ValueT &operator[](const KeyT &Arg) {
55 Vector.push_back(std::make_pair(Arg, ValueT()));
61 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert()
/external/llvm/include/llvm/CodeGen/PBQP/
DCostAllocator.h28 template <typename ValueT>
31 typedef std::shared_ptr<const ValueT> PoolRef;
41 const ValueT& getValue() const { return Value; } in getValue()
44 ValueT Value;
/external/llvm/include/llvm/Support/
DYAMLParser.h306 template <class BaseT, class ValueT>
308 : public std::iterator<std::forward_iterator_tag, ValueT> {
313 ValueT *operator->() const {
318 ValueT &operator*() const {
324 operator ValueT *() const {
/external/llvm/unittests/ADT/
DTinyPtrVectorTest.cpp39 typedef typename std::remove_pointer<PtrT>::type ValueT; typedef in __anon186813230111::TinyPtrVectorTest
44 ValueT TestValues[1024];
/external/clang/include/clang/ASTMatchers/
DASTMatchers.h3178 template <typename ValueT>
3179 internal::PolymorphicMatcherWithParam1<internal::ValueEqualsMatcher, ValueT>
3180 equals(const ValueT &Value) { in equals()
3183 ValueT>(Value); in equals()
DASTMatchersInternal.h1318 template <typename T, typename ValueT>
1327 explicit ValueEqualsMatcher(const ValueT &ExpectedValue)
1335 const ValueT ExpectedValue;
/external/clang/lib/Sema/
DSemaExprObjC.cpp935 QualType ValueT = Method->parameters()[0]->getType(); in BuildObjCDictionaryLiteral() local
936 const PointerType *PtrValue = ValueT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
943 << 0 << ValueT in BuildObjCDictionaryLiteral()
1003 QualType ValueT = ValuesT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1019 = CheckObjCCollectionLiteralElement(*this, Elements[I].Value, ValueT); in BuildObjCDictionaryLiteral()
/external/clang/include/clang/Sema/
DSema.h58 template <typename ValueT> struct DenseMapInfo;
59 template <typename ValueT, typename ValueInfoT> class DenseSet;
/external/llvm/docs/
DProgrammersManual.rst1448 ``MapVector<KeyT,ValueT>`` provides a subset of the DenseMap interface. The