Home
last modified time | relevance | path

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

12

/openbsd/src/gnu/llvm/llvm/include/llvm/ADT/
DDenseSet.h53 template <typename ValueT, typename MapTy, typename ValueInfoT>
55 static_assert(sizeof(typename MapTy::value_type) == sizeof(ValueT),
63 using key_type = ValueT;
64 using value_type = ValueT;
75 DenseSetImpl(std::initializer_list<ValueT> Elems) in DenseSetImpl()
97 size_type count(const_arg_type_t<ValueT> V) const { in count()
101 bool erase(const ValueT &V) { in erase()
118 using value_type = ValueT;
126 ValueT &operator*() { return I->getFirst(); }
127 const ValueT &operator*() const { return I->getFirst(); }
[all …]
DSparseSet.h56 template<typename ValueT>
58 static unsigned getValIndex(const ValueT &Val) { in getValIndex()
67 template<typename KeyT, typename ValueT, typename KeyFunctorT>
69 unsigned operator()(const ValueT &Val) const { in operator()
70 return SparseSetValTraits<ValueT>::getValIndex(Val); in operator()
121 template<typename ValueT,
129 using DenseT = SmallVector<ValueT, 8>;
135 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
138 using value_type = ValueT;
139 using reference = ValueT &;
[all …]
DDenseMap.h41 template <typename KeyT, typename ValueT>
42 struct DenseMapPair : public std::pair<KeyT, ValueT> {
43 using std::pair<KeyT, ValueT>::pair;
45 KeyT &getFirst() { return std::pair<KeyT, ValueT>::first; } in getFirst()
46 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
47 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
48 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
53 template <typename KeyT, typename ValueT,
55 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
59 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
[all …]
DMapVector.h34 template<typename KeyT, typename ValueT,
36 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
84 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
85 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
86 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
87 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
99 ValueT &operator[](const KeyT &Key) {
104 Vector.push_back(std::make_pair(Key, ValueT()));
111 ValueT lookup(const KeyT &Key) const { in lookup()
112 static_assert(std::is_copy_constructible_v<ValueT>, in lookup()
[all …]
DTypeSwitch.h66 template <typename ValueT, typename CastT>
68 decltype(std::declval<ValueT &>().template dyn_cast<CastT>());
72 template <typename CastT, typename ValueT>
74 ValueT &&value, in decltype()
75 std::enable_if_t<is_detected<has_dyn_cast_t, ValueT, CastT>::value> * = in decltype()
82 template <typename CastT, typename ValueT>
84 ValueT &&value, in decltype()
85 std::enable_if_t<!is_detected<has_dyn_cast_t, ValueT, CastT>::value> * = in decltype()
DSparseMultiSet.h83 template<typename ValueT,
99 ValueT Data;
103 SMSNode(ValueT D, unsigned P, unsigned N) : Data(D), Prev(P), Next(N) {} in SMSNode()
126 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
134 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex()
159 unsigned addValue(const ValueT& V, unsigned Prev, unsigned Next) { in addValue()
185 using value_type = ValueT;
186 using reference = ValueT &;
187 using const_reference = const ValueT &;
188 using pointer = ValueT *;
[all …]
DAllocatorList.h86 template <class ValueT, class IteratorBase>
88 : public iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>,
90 std::bidirectional_iterator_tag, ValueT> {
96 iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>, IteratorBase,
97 std::bidirectional_iterator_tag, ValueT>;
100 using value_type = ValueT;
101 using pointer = ValueT *;
102 using reference = ValueT &;
DIntervalTree.h199 template <typename PointT, typename ValueT> class IntervalData {
202 using ValueType = ValueT;
247 template <typename PointT, typename ValueT,
248 typename DataT = IntervalData<PointT, ValueT>>
252 static_assert(ValueTypeIsValid<ValueT>::value,
257 using ValueType = ValueT;
DHashing.h452 template <typename ValueT>
453 std::enable_if_t<is_hashable_data<ValueT>::value, hash_code>
454 hash_combine_range_impl(ValueT *first, ValueT *last) {
DSTLExtras.h1053 template <typename ValueT, typename... IterTs>
1055 : public iterator_facade_base<concat_iterator<ValueT, IterTs...>,
1056 std::forward_iterator_tag, ValueT> {
1101 template <size_t Index> ValueT *getHelper() const {
1114 template <size_t... Ns> ValueT &get(std::index_sequence<Ns...>) const {
1116 ValueT *(concat_iterator::*GetHelperFns[])() const = {
1121 if (ValueT *P = (this->*GetHelperFn)())
1143 ValueT &operator*() const {
1159 template <typename ValueT, typename... RangeTs> class concat_range {
1162 concat_iterator<ValueT,
[all …]
/openbsd/src/gnu/llvm/llvm/include/llvm/IR/
DValueMap.h45 template<typename KeyT, typename ValueT, typename Config>
83 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
85 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
87 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
88 using MapT = DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH>>;
98 using mapped_type = ValueT;
99 using value_type = std::pair<KeyT, ValueT>;
164 ValueT lookup(const KeyT &Val) const { in lookup()
166 return I != Map.end() ? I->second : ValueT(); in lookup()
172 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
/openbsd/src/gnu/llvm/compiler-rt/lib/sanitizer_common/
Dsanitizer_dense_map.h26 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
32 using mapped_type = ValueT;
51 if (__sanitizer::is_trivially_destructible<ValueT>::value) { in clear()
60 P->getSecond().~ValueT(); in clear()
113 ValueT lookup(const KeyT &Key) const { in lookup()
117 return ValueT(); in lookup()
191 TheBucket->getSecond().~ValueT(); in erase()
201 TheBucket->getSecond().~ValueT(); in erase()
215 ValueT &operator[](const KeyT &Key) { return FindAndConstruct(Key).second; }
225 ValueT &operator[](KeyT &&Key) {
[all …]
Dsanitizer_dense_map_info.h36 template <typename KeyT, typename ValueT>
39 ValueT second = {};
41 constexpr DenseMapPair(const KeyT &f, const ValueT &s) in DenseMapPair()
56 ValueT &getSecond() { return second; } in getSecond()
57 const ValueT &getSecond() const { return second; } in getSecond()
/openbsd/src/gnu/llvm/llvm/include/llvm/DebugInfo/PDB/Native/
DHashTable.h31 template <typename ValueT> class HashTable;
33 template <typename ValueT>
35 : public iterator_facade_base<HashTableIterator<ValueT>,
37 const std::pair<uint32_t, ValueT>> {
39 friend HashTable<ValueT>;
41 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator()
46 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator()
70 const std::pair<uint32_t, ValueT> &operator*() const {
93 const HashTable<ValueT> *Map;
98 template <typename ValueT>
[all …]
/openbsd/src/gnu/llvm/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h22 template <class KeyT, class ValueT> class BlotMapVector {
28 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
55 ValueT &operator[](const KeyT &Arg) {
61 Vector.push_back(std::make_pair(Arg, ValueT()));
67 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert()
/openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/
DMachineInstrBundle.h93 template <typename ValueT>
95 : public iterator_facade_base<MIBundleOperandIteratorBase<ValueT>,
96 std::forward_iterator_tag, ValueT> {
145 ValueT &operator*() const { return *OpI; }
146 ValueT *operator->() const { return &*OpI; }
/openbsd/src/gnu/llvm/llvm/include/llvm/CodeGen/PBQP/
DCostAllocator.h28 template <typename ValueT> class ValuePool {
30 using PoolRef = std::shared_ptr<const ValueT>;
41 const ValueT &getValue() const { return Value; } in getValue()
45 ValueT Value;
/openbsd/src/gnu/llvm/llvm/include/llvm/Support/
DYAMLParser.h328 template <class BaseT, class ValueT> class basic_collection_iterator {
331 using value_type = ValueT;
339 ValueT *operator->() const {
344 ValueT &operator*() const {
350 operator ValueT *() const {
/openbsd/src/gnu/llvm/compiler-rt/lib/sanitizer_common/tests/
Dsanitizer_dense_map_test.cpp22 template <typename KeyT, typename ValueT,
24 class TestDenseMap : public DenseMap<KeyT, ValueT, KeyInfoT> {
25 using BaseT = DenseMap<KeyT, ValueT, KeyInfoT>;
/openbsd/src/gnu/gcc/libstdc++-v3/docs/html/17_intro/
Dconcept_check.diff315 ValueT t;
/openbsd/src/gnu/lib/libstdc++/libstdc++/docs/html/17_intro/
Dconcept_check.diff315 ValueT t;
/openbsd/src/gnu/llvm/clang/include/clang/ASTMatchers/
DASTMatchers.h5583 template <typename ValueT>
5585 void(internal::AllNodeBaseTypes), ValueT>
5586 equals(const ValueT &Value) { in equals()
5588 void(internal::AllNodeBaseTypes), ValueT>( in equals()
DASTMatchersInternal.h1729 template <typename T, typename ValueT>
1738 explicit ValueEqualsMatcher(const ValueT &ExpectedValue)
1746 ValueT ExpectedValue;
/openbsd/src/gnu/llvm/clang/lib/Sema/
DSemaExprObjC.cpp1015 QualType ValueT = Method->parameters()[0]->getType(); in BuildObjCDictionaryLiteral() local
1016 const PointerType *PtrValue = ValueT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1023 << 0 << ValueT in BuildObjCDictionaryLiteral()
1080 QualType ValueT = ValuesT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1096 = CheckObjCCollectionLiteralElement(*this, Element.Value, ValueT); in BuildObjCDictionaryLiteral()
/openbsd/src/gnu/llvm/clang/include/clang/Sema/
DSema.h77 template <typename ValueT, typename ValueInfoT> class DenseSet;

12