Home
last modified time | relevance | path

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

/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DDenseSet.h64 using key_type = ValueT;
65 using value_type = ValueT;
96 bool erase(const ValueT &V) { in erase()
113 using value_type = ValueT;
121 ValueT &operator*() { return I->getFirst(); }
139 using value_type = ValueT;
249 template <typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT>>
251 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
255 detail::DenseSetImpl<ValueT,
270 ValueT, SmallDenseMap<ValueT, detail::DenseSetEmpty, InlineBuckets,
[all …]
H A DSparseSet.h56 template<typename ValueT>
121 template<typename ValueT,
130 using DenseT = SmallVector<ValueT, 8>;
139 using value_type = ValueT;
140 using reference = ValueT &;
141 using const_reference = const ValueT &;
142 using pointer = ValueT *;
143 using const_pointer = const ValueT *;
263 ValueT &operator[](const KeyT &Key) {
264 return *insert(ValueT(Key)).first;
[all …]
H A DDenseMap.h40 template <typename KeyT, typename ValueT>
72 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
73 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
93 using mapped_type = ValueT;
158 P->getSecond().~ValueT(); in clear()
215 return ValueT(); in lookup()
303 TheBucket->getSecond().~ValueT(); in erase()
337 ValueT &operator[](KeyT &&Key) {
364 P->getSecond().~ValueT(); in destroyAll()
410 B->getSecond().~ValueT(); in moveFromOldBuckets()
[all …]
H A DSequence.h29 template <typename ValueT>
31 : public iterator_facade_base<value_sequence_iterator<ValueT>,
33 const ValueT> {
36 ValueT Value;
47 template <typename U, typename Enabler = decltype(ValueT(std::declval<U>()))>
75 template <typename ValueT>
76 iterator_range<detail::value_sequence_iterator<ValueT>> seq(ValueT Begin, in seq()
77 ValueT End) { in seq()
78 return make_range(detail::value_sequence_iterator<ValueT>(Begin), in seq()
79 detail::value_sequence_iterator<ValueT>(End)); in seq()
H A DMapVector.h35 template<typename KeyT, typename ValueT,
37 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
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<ValueT>::value, in lookup()
115 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
130 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { in insert()
232 template <typename KeyT, typename ValueT, unsigned N>
234 : MapVector<KeyT, ValueT, SmallDenseMap<KeyT, unsigned, N>,
[all …]
H A DSparseMultiSet.h83 template<typename ValueT,
100 ValueT Data;
127 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
135 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex()
186 using value_type = ValueT;
187 using reference = ValueT &;
188 using const_reference = const ValueT &;
189 using pointer = ValueT *;
190 using const_pointer = const ValueT *;
222 ValueT> {
[all …]
H A DAllocatorList.h88 template <class ValueT, class IteratorBase>
90 : public iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>,
92 std::bidirectional_iterator_tag, ValueT> {
98 iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>, IteratorBase,
99 std::bidirectional_iterator_tag, ValueT>;
102 using value_type = ValueT;
103 using pointer = ValueT *;
104 using reference = ValueT &;
H A DSTLExtras.h812 template <typename ValueT, typename... IterTs>
814 : public iterator_facade_base<concat_iterator<ValueT, IterTs...>,
815 std::forward_iterator_tag, ValueT> {
860 template <size_t Index> ValueT *getHelper() const {
873 template <size_t... Ns> ValueT &get(index_sequence<Ns...>) const {
875 ValueT *(concat_iterator::*GetHelperFns[])() const = {
880 if (ValueT *P = (this->*GetHelperFn)())
916 template <typename ValueT, typename... RangeTs> class concat_range {
919 concat_iterator<ValueT,
946 template <typename ValueT, typename... RangeTs>
[all …]
H A DHashing.h445 template <typename ValueT>
446 typename std::enable_if<is_hashable_data<ValueT>::value, hash_code>::type
447 hash_combine_range_impl(ValueT *first, ValueT *last) {
/freebsd-12.1/contrib/llvm/include/llvm/IR/
H A DValueMap.h101 using mapped_type = ValueT;
102 using value_type = std::pair<KeyT, ValueT>;
171 ValueT lookup(const KeyT &Val) const { in lookup()
173 return I != Map.end() ? I->second : ValueT(); in lookup()
213 ValueT &operator[](const KeyT &Key) {
248 friend class ValueMap<KeyT, ValueT, Config>;
295 ValueT Target(std::move(I->second));
350 ValueT& second;
354 operator std::pair<KeyT, ValueT>() const {
404 const ValueT& second;
[all …]
/freebsd-12.1/contrib/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h35 template <typename ValueT, typename TraitsT> class HashTable;
37 template <typename ValueT, typename TraitsT>
41 std::pair<uint32_t, ValueT>> {
42 friend HashTable<ValueT, TraitsT>;
72 const std::pair<uint32_t, ValueT> &operator*() const {
91 const HashTable<ValueT, TraitsT> *Map;
104 template <typename ValueT, typename TraitsT = PdbHashTraits<ValueT>>
106 using iterator = HashTableIterator<ValueT, TraitsT>;
152 const ValueT *Value;
183 Size += (sizeof(uint32_t) + sizeof(ValueT)) * size();
[all …]
/freebsd-12.1/contrib/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h23 template <class KeyT, class ValueT> class BlotMapVector {
29 using VectorTy = std::vector<std::pair<KeyT, ValueT>>;
56 ValueT &operator[](const KeyT &Arg) {
62 Vector.push_back(std::make_pair(Arg, ValueT()));
68 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { in insert()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DCostAllocator.h29 template <typename ValueT> class ValuePool {
31 using PoolRef = std::shared_ptr<const ValueT>;
42 const ValueT &getValue() const { return Value; } in getValue()
46 ValueT Value;
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DYAMLParser.h323 template <class BaseT, class ValueT>
325 : public std::iterator<std::input_iterator_tag, ValueT> {
330 ValueT *operator->() const {
335 ValueT &operator*() const {
341 operator ValueT *() const {
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/ASTMatchers/
H A DASTMatchers.h4289 template <typename ValueT>
4290 internal::PolymorphicMatcherWithParam1<internal::ValueEqualsMatcher, ValueT>
4291 equals(const ValueT &Value) { in equals()
4294 ValueT>(Value); in equals()
H A DASTMatchersInternal.h1499 template <typename T, typename ValueT>
1508 explicit ValueEqualsMatcher(const ValueT &ExpectedValue)
1516 const ValueT ExpectedValue;
/freebsd-12.1/contrib/llvm/tools/clang/lib/Sema/
H A DSemaExprObjC.cpp938 QualType ValueT = Method->parameters()[0]->getType(); in BuildObjCDictionaryLiteral() local
939 const PointerType *PtrValue = ValueT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
946 << 0 << ValueT in BuildObjCDictionaryLiteral()
1006 QualType ValueT = ValuesT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1022 = CheckObjCCollectionLiteralElement(*this, Element.Value, ValueT); in BuildObjCDictionaryLiteral()
/freebsd-12.1/contrib/llvm/tools/clang/include/clang/Sema/
H A DSema.h65 template <typename ValueT> struct DenseMapInfo;
66 template <typename ValueT, typename ValueInfoT> class DenseSet;