Home
last modified time | relevance | path

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

12

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ADT/
H A DDenseSet.h63 using key_type = ValueT;
64 using value_type = ValueT;
101 bool erase(const ValueT &V) { in erase()
118 using value_type = ValueT;
126 ValueT &operator*() { return I->getFirst(); }
148 using value_type = ValueT;
267 template <typename ValueT, typename ValueInfoT = DenseMapInfo<ValueT>>
269 ValueT, DenseMap<ValueT, detail::DenseSetEmpty, ValueInfoT,
273 detail::DenseSetImpl<ValueT,
288 ValueT, SmallDenseMap<ValueT, detail::DenseSetEmpty, InlineBuckets,
[all …]
H A DSparseSet.h56 template<typename ValueT>
121 template<typename ValueT,
129 using DenseT = SmallVector<ValueT, 8>;
138 using value_type = ValueT;
139 using reference = ValueT &;
140 using const_reference = const ValueT &;
141 using pointer = ValueT *;
142 using const_pointer = const ValueT *;
266 ValueT &operator[](const KeyT &Key) {
267 return *insert(ValueT(Key)).first;
[all …]
H A DDenseMap.h41 template <typename KeyT, typename ValueT>
43 using std::pair<KeyT, ValueT>::pair;
47 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
48 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
68 using mapped_type = ValueT;
131 P->getSecond().~ValueT(); in clear()
206 return ValueT(); in lookup()
368 ValueT &operator[](KeyT &&Key) {
395 P->getSecond().~ValueT(); in destroyAll()
441 B->getSecond().~ValueT(); in moveFromOldBuckets()
[all …]
H A DMapVector.h33 template <typename KeyT, typename ValueT,
35 typename VectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
98 ValueT &operator[](const KeyT &Key) {
103 Vector.push_back(std::make_pair(Key, ValueT()));
110 ValueT lookup(const KeyT &Key) const { in lookup()
111 static_assert(std::is_copy_constructible_v<ValueT>, in lookup()
114 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
144 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) { in insert()
251 template <typename KeyT, typename ValueT, unsigned N>
253 : MapVector<KeyT, ValueT, SmallDenseMap<KeyT, unsigned, N>,
[all …]
H A 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()
H A DSparseMultiSet.h83 template<typename ValueT,
99 ValueT Data;
126 SparseSetValFunctor<KeyT, ValueT, KeyFunctorT> ValIndexOf;
134 unsigned sparseIndex(const ValueT &Val) const { in sparseIndex()
185 using value_type = ValueT;
186 using reference = ValueT &;
187 using const_reference = const ValueT &;
188 using pointer = ValueT *;
189 using const_pointer = const ValueT *;
224 using value_type = ValueT;
[all …]
H A 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 &;
H A DIntervalTree.h198 template <typename PointT, typename ValueT> class IntervalData {
201 using ValueType = ValueT;
246 template <typename PointT, typename ValueT,
247 typename DataT = IntervalData<PointT, ValueT>>
251 static_assert(ValueTypeIsValid<ValueT>::value,
256 using ValueType = ValueT;
H A DHashing.h457 template <typename ValueT>
458 std::enable_if_t<is_hashable_data<ValueT>::value, hash_code>
459 hash_combine_range_impl(ValueT *first, ValueT *last) {
H A DSTLExtras.h1029 template <typename ValueT, typename... IterTs>
1031 : public iterator_facade_base<concat_iterator<ValueT, IterTs...>,
1032 std::forward_iterator_tag, ValueT> {
1077 template <size_t Index> ValueT *getHelper() const {
1092 ValueT *(concat_iterator::*GetHelperFns[])() const = {
1097 if (ValueT *P = (this->*GetHelperFn)())
1119 ValueT &operator*() const {
1135 template <typename ValueT, typename... RangeTs> class concat_range {
1138 concat_iterator<ValueT,
1184 template <typename ValueT, typename... RangeTs>
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/IR/
H A DValueMap.h98 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()
206 ValueT &operator[](const KeyT &Key) {
241 friend class ValueMap<KeyT, ValueT, Config>;
288 ValueT Target(std::move(I->second));
345 ValueT& second;
349 operator std::pair<KeyT, ValueT>() const {
401 const ValueT& second;
[all …]
/freebsd-14.2/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_dense_map.h32 using mapped_type = ValueT;
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()
225 ValueT &operator[](KeyT &&Key) {
262 P->getSecond().~ValueT(); in destroyAll()
304 ValueT(__sanitizer::move(B->getSecond())); in moveFromOldBuckets()
308 B->getSecond().~ValueT(); in moveFromOldBuckets()
[all …]
H A 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()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h31 template <typename ValueT> class HashTable;
33 template <typename ValueT>
35 : public iterator_facade_base<HashTableIterator<ValueT>,
39 friend HashTable<ValueT>;
70 const std::pair<uint32_t, ValueT> &operator*() const {
93 const HashTable<ValueT> *Map;
98 template <typename ValueT>
108 using const_iterator = HashTableIterator<ValueT>;
144 const ValueT *Value; in load()
250 bool set_as(const Key &K, ValueT V, TraitsT &Traits) { in set_as()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A 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()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A 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; }
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ProfileData/
H A DHashKeyMap.h51 typename KeyT, typename ValueT, typename... MapTArgs>
53 public MapT<decltype(hash_value(KeyT())), ValueT, MapTArgs...> {
55 using base_type = MapT<decltype(hash_value(KeyT())), ValueT, MapTArgs...>;
58 using mapped_type = ValueT;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A 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;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Testing/ADT/
H A DStringMapEntry.h49 using ValueT = typename std::remove_reference_t<StringMapEntryT>::ValueType;
57 testing::SafeMatcherCast<const ValueT &>(ValueMatcherArg)) {}
96 const testing::Matcher<const ValueT &> ValueMatcher;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/
H A DYAMLParser.h333 template <class BaseT, class ValueT> class basic_collection_iterator {
336 using value_type = ValueT;
344 ValueT *operator->() const {
349 ValueT &operator*() const {
355 operator ValueT *() const {
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/
H A DSimplePackedSerialization.h542 template <typename SPSValueT, typename ValueT>
544 StringMap<ValueT>> {
546 static size_t size(const StringMap<ValueT> &M) { in size()
553 static bool serialize(SPSOutputBuffer &OB, const StringMap<ValueT> &M) { in serialize()
564 static bool deserialize(SPSInputBuffer &IB, StringMap<ValueT> &M) { in deserialize()
573 ValueT V; in deserialize()
/freebsd-14.2/contrib/llvm-project/llvm/lib/TextAPI/
H A DTextStubV5.cpp779 template <typename ValueT, typename EntryT = ValueT>
780 Array serializeScalar(TBDKey Key, ValueT Value, ValueT Default = ValueT()) { in serializeScalar()
805 template <typename ValueT = std::string,
806 typename AggregateT = std::vector<std::pair<MachO::Target, ValueT>>>
809 std::map<ValueT, std::set<MachO::Target>> Entries; in serializeField()
/freebsd-14.2/contrib/llvm-project/clang/lib/AST/Interp/
H A DByteCodeStmtGen.cpp609 PrimType ValueT = this->classifyPrim(Value->getType()); in visitSwitchStmt() local
618 if (!this->emitEQ(ValueT, S)) in visitSwitchStmt()
/freebsd-14.2/contrib/llvm-project/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h1729 template <typename T, typename ValueT>
1738 explicit ValueEqualsMatcher(const ValueT &ExpectedValue)
1746 ValueT ExpectedValue;
H A DASTMatchers.h5821 template <typename ValueT>
5823 void(internal::AllNodeBaseTypes), ValueT>
5824 equals(const ValueT &Value) { in equals()
5826 void(internal::AllNodeBaseTypes), ValueT>( in equals()

12