Home
last modified time | relevance | path

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

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A 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 …]
H A DSparseSet.h55 template<typename ValueT>
57 static unsigned getValIndex(const ValueT &Val) { in getValIndex()
66 template<typename KeyT, typename ValueT, typename KeyFunctorT>
68 unsigned operator()(const ValueT &Val) const { in operator()
69 return SparseSetValTraits<ValueT>::getValIndex(Val); in operator()
120 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 …]
H A DDenseMap.h40 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; } in getFirst()
45 const KeyT &getFirst() const { return std::pair<KeyT, ValueT>::first; } in getFirst()
46 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; } in getSecond()
47 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; } in getSecond()
52 template <typename KeyT, typename ValueT,
54 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
58 template <typename DerivedT, typename KeyT, typename ValueT, typename KeyInfoT,
[all …]
H A DSequence.h28 template <typename ValueT>
30 : public iterator_facade_base<value_sequence_iterator<ValueT>,
32 const ValueT> {
35 ValueT Value;
50 template <typename U, typename Enabler = decltype(ValueT(std::declval<U>()))>
78 template <typename ValueT>
79 iterator_range<detail::value_sequence_iterator<ValueT>> seq(ValueT Begin, in seq()
80 ValueT End) { in seq()
81 return make_range(detail::value_sequence_iterator<ValueT>(Begin), in seq()
82 detail::value_sequence_iterator<ValueT>(End)); in seq()
H A DMapVector.h34 template<typename KeyT, typename ValueT,
36 typename VectorType = std::vector<std::pair<KeyT, ValueT>>>
83 std::pair<KeyT, ValueT> &front() { return Vector.front(); } in front()
84 const std::pair<KeyT, ValueT> &front() const { return Vector.front(); } in front()
85 std::pair<KeyT, ValueT> &back() { return Vector.back(); } in back()
86 const std::pair<KeyT, ValueT> &back() const { return Vector.back(); } in back()
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<ValueT>::value, in lookup()
[all …]
H A DSparseMultiSet.h82 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 …]
H A DTypeSwitch.h60 template <typename ValueT, typename CastT>
62 decltype(std::declval<ValueT &>().template dyn_cast<CastT>());
66 template <typename CastT, typename ValueT>
68 ValueT value,
70 is_detected<has_dyn_cast_t, ValueT, CastT>::value> * = nullptr) {
76 template <typename CastT, typename ValueT>
78 ValueT value,
80 !is_detected<has_dyn_cast_t, ValueT, CastT>::value> * = nullptr) {
H A DAllocatorList.h87 template <class ValueT, class IteratorBase>
89 : public iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>,
91 std::bidirectional_iterator_tag, ValueT> {
97 iterator_adaptor_base<IteratorImpl<ValueT, IteratorBase>, IteratorBase,
98 std::bidirectional_iterator_tag, ValueT>;
101 using value_type = ValueT;
102 using pointer = ValueT *;
103 using reference = ValueT &;
H A DHashing.h448 template <typename ValueT>
449 std::enable_if_t<is_hashable_data<ValueT>::value, hash_code>
450 hash_combine_range_impl(ValueT *first, ValueT *last) {
H A DSTLExtras.h874 template <typename ValueT, typename... IterTs>
876 : public iterator_facade_base<concat_iterator<ValueT, IterTs...>,
877 std::forward_iterator_tag, ValueT> {
922 template <size_t Index> ValueT *getHelper() const {
935 template <size_t... Ns> ValueT &get(std::index_sequence<Ns...>) const {
937 ValueT *(concat_iterator::*GetHelperFns[])() const = {
942 if (ValueT *P = (this->*GetHelperFn)())
964 ValueT &operator*() const {
980 template <typename ValueT, typename... RangeTs> class concat_range {
983 concat_iterator<ValueT,
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/IR/
H A DValueMap.h46 template<typename KeyT, typename ValueT, typename Config>
84 template<typename KeyT, typename ValueT, typename Config =ValueMapConfig<KeyT>>
86 friend class ValueMapCallbackVH<KeyT, ValueT, Config>;
88 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
89 using MapT = DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH>>;
99 using mapped_type = ValueT;
100 using value_type = std::pair<KeyT, ValueT>;
165 ValueT lookup(const KeyT &Val) const { in lookup()
167 return I != Map.end() ? I->second : ValueT(); in lookup()
173 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) { in insert()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h34 template <typename ValueT> class HashTable;
36 template <typename ValueT>
38 : public iterator_facade_base<HashTableIterator<ValueT>,
40 const std::pair<uint32_t, ValueT>> {
41 friend HashTable<ValueT>;
43 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator()
48 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator()
72 const std::pair<uint32_t, ValueT> &operator*() const {
79 using iterator_facade_base<HashTableIterator<ValueT>,
81 const std::pair<uint32_t, ValueT>>::operator++;
[all …]
/netbsd-src/external/apache2/llvm/dist/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()
/netbsd-src/external/apache2/llvm/dist/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; }
/netbsd-src/external/apache2/llvm/dist/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;
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/
H A 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 {
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ExecutionEngine/Orc/TargetProcess/
H A DOrcRPCTPCServer.h451 using ValueT = decltype(std::declval<WriteT>().Value); in handleWriteUInt() local
453 *jitTargetAddressToPointer<ValueT *>(W.Address) = W.Value; in handleWriteUInt()
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/ASTMatchers/
H A DASTMatchersInternal.h1757 template <typename T, typename ValueT>
1766 explicit ValueEqualsMatcher(const ValueT &ExpectedValue)
1774 ValueT ExpectedValue;
H A DASTMatchers.h5379 template <typename ValueT>
5381 void(internal::AllNodeBaseTypes), ValueT>
5382 equals(const ValueT &Value) { in equals()
5384 void(internal::AllNodeBaseTypes), ValueT>( in equals()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/
H A DSemaExprObjC.cpp1014 QualType ValueT = Method->parameters()[0]->getType(); in BuildObjCDictionaryLiteral() local
1015 const PointerType *PtrValue = ValueT->getAs<PointerType>(); in BuildObjCDictionaryLiteral()
1022 << 0 << ValueT in BuildObjCDictionaryLiteral()
1082 QualType ValueT = ValuesT->castAs<PointerType>()->getPointeeType(); in BuildObjCDictionaryLiteral() local
1098 = CheckObjCCollectionLiteralElement(*this, Element.Value, ValueT); in BuildObjCDictionaryLiteral()
/netbsd-src/external/apache2/llvm/dist/clang/include/clang/Sema/
H A DSema.h74 template <typename ValueT> struct DenseMapInfo;
75 template <typename ValueT, typename ValueInfoT> class DenseSet;
/netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/
H A DChangeLog2053 * include/bits/istream.tcc (istream::_M_extract(ValueT&)): Use
2057 * include/bits/ostream.tcc (ostream::_M_insert(ValueT)): Use
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DProgrammersManual.rst2308 ``MapVector<KeyT,ValueT>`` provides a subset of the DenseMap interface. The
/netbsd-src/external/gpl3/binutils/dist/gas/
H A DChangeLog-20181172 (md_section_align): Cast (-1) to ValueT.
/netbsd-src/external/gpl3/binutils.old/dist/gas/
H A DChangeLog-20181172 (md_section_align): Cast (-1) to ValueT.