Searched refs:value_type (Results 1 - 25 of 343) sorted by relevance

1234567891011>>

/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/
H A DEndianStream.h27 template <typename value_type>
28 inline void write_array(raw_ostream &os, ArrayRef<value_type> values,
31 value_type value = byte_swap<value_type>(orig, endian);
32 os.write((const char *)&value, sizeof(value_type));
36 template <typename value_type>
37 inline void write(raw_ostream &os, value_type value, endianness endian) {
38 value = byte_swap<value_type>(value, endian);
39 os.write((const char *)&value, sizeof(value_type));
53 template <typename value_type>
[all...]
H A DEndian.h43 template <typename value_type>
44 [[nodiscard]] inline value_type byte_swap(value_type value, endianness endian) {
51 template <typename value_type, endianness endian>
52 [[nodiscard]] inline value_type byte_swap(value_type value) {
57 template <typename value_type, std::size_t alignment = unaligned>
58 [[nodiscard]] inline value_type read(const void *memory, endianness endian) {
59 value_type ret;
63 memory, (detail::PickAlignment<value_type, alignmen
[all...]
H A DCapacity.h25 return x.capacity() * sizeof(typename T::value_type);
H A DLineIterator.h43 using value_type = StringRef;
45 using pointer = value_type *;
46 using reference = value_type &;
/freebsd-current/contrib/kyua/utils/config/
H A Dnodes.hpp123 typedef ValueType value_type; typedef in class:utils::config::typed_leaf_node
132 const value_type& value(void) const;
135 value_type& value(void);
138 void set(const value_type&);
142 optional< value_type > _value;
145 virtual void validate(const value_type&) const;
183 virtual void validate(const value_type&) const;
205 typedef std::set< ValueType > value_type; typedef in class:utils::config::base_set_node
219 const value_type& value(void) const;
226 value_type
[all...]
H A Dtree.hpp104 const typename LeafType::value_type& lookup(const std::string&) const;
106 typename LeafType::value_type& lookup_rw(const std::string&);
109 void set(const std::string&, const typename LeafType::value_type&);
/freebsd-current/contrib/llvm-project/libcxx/include/__string/
H A Dextern_template_lists.h33 _Func(_LIBCPP_EXPORTED_FROM_ABI basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*, size_type)) \
34 _Func(_LIBCPP_EXPORTED_FROM_ABI basic_string<_CharType>::size_type basic_string<_CharType>::rfind(value_type const*, size_type, size_type) const) \
35 _Func(_LIBCPP_EXPORTED_FROM_ABI void basic_string<_CharType>::__init(value_type const*, size_type, size_type)) \
37 _Func(_LIBCPP_EXPORTED_FROM_ABI basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*)) \
39 _Func(_LIBCPP_EXPORTED_FROM_ABI basic_string<_CharType>::size_type basic_string<_CharType>::find_last_not_of(value_type const*, size_type, size_type) const) \
41 _Func(_LIBCPP_EXPORTED_FROM_ABI basic_string<_CharType>::size_type basic_string<_CharType>::find_first_not_of(value_type const*, size_type, size_type) const) \
42 _Func(_LIBCPP_EXPORTED_FROM_ABI basic_string<_CharType>& basic_string<_CharType>::insert(size_type, size_type, value_type)) \
43 _Func(_LIBCPP_EXPORTED_FROM_ABI basic_string<_CharType>& basic_string<_CharType>::operator=(value_type)) \
44 _Func(_LIBCPP_EXPORTED_FROM_ABI void basic_string<_CharType>::__init(value_type const*, size_type)) \
46 _Func(_LIBCPP_EXPORTED_FROM_ABI basic_string<_CharType>& basic_string<_CharType>::insert(size_type, value_type cons
[all...]
/freebsd-current/contrib/llvm-project/libcxx/include/__algorithm/
H A Dstable_sort.h41 typename iterator_traits<_BidirectionalIterator>::value_type* __first2,
45 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; typedef
48 unique_ptr<value_type, __destruct_n&> __h(__first2, __d);
49 value_type* __last2 = __first2;
50 ::new ((void*)__last2) value_type(_Ops::__iter_move(__first1));
51 __d.template __incr<value_type>();
53 value_type* __j2 = __last2;
54 value_type* __i2 = __j2;
56 ::new ((void*)__j2) value_type(st
80 typedef typename iterator_traits<_InputIterator1>::value_type value_type; typedef
152 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; typedef
199 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; typedef
[all...]
H A Dstable_partition.h57 typedef typename iterator_traits<_ForwardIterator>::value_type value_type; typedef
59 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d);
62 value_type* __t = __p.first;
63 ::new ((void*)__t) value_type(_Ops::__iter_move(__first));
64 __d.template __incr<value_type>();
72 ::new ((void*)__t) value_type(_Ops::__iter_move(__i));
73 __d.template __incr<value_type>();
80 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void)++__i)
121 typedef typename iterator_traits<_ForwardIterator>::value_type value_typ typedef
177 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; typedef
254 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; typedef
[all...]
H A Drotate.h34 typedef typename iterator_traits<_ForwardIterator>::value_type value_type; typedef
37 value_type __tmp = _Ops::__iter_move(__first);
46 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; typedef
50 value_type __tmp = _Ops::__iter_move(__lm1);
99 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; typedef
110 value_type __t(_Ops::__iter_move(--__p));
130 typedef typename iterator_traits<_ForwardIterator>::value_type value_typ typedef
144 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; typedef
160 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; typedef
[all...]
H A Dinplace_merge.h102 typename iterator_traits<_BidirectionalIterator>::value_type* __buff) {
103 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; typedef
105 unique_ptr<value_type, __destruct_n&> __h2(__buff, __d);
107 value_type* __p = __buff;
109 __d.template __incr<value_type>(), (void)++__i, (void)++__p)
110 ::new ((void*)__p) value_type(_IterOps<_AlgPolicy>::__iter_move(__i));
113 value_type* __p = __buff;
115 __d.template __incr<value_type>(), (void)++__i, (void)++__p)
116 ::new ((void*)__p) value_type(_IterOp
209 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; typedef
[all...]
/freebsd-current/contrib/llvm-project/compiler-rt/lib/orc/
H A Dinterval_set.h33 using value_type = std::pair<KeyT, KeyT>;
39 using value_type = IntervalSet::value_type;
40 using pointer = const value_type *;
41 using reference = const value_type &;
45 const value_type &operator*() const { return I->first; }
46 const value_type *operator->() const { return &I->first; }
/freebsd-current/contrib/llvm-project/libcxx/include/__type_traits/
H A Dintegral_constant.h23 typedef _Tp value_type; typedef in struct:integral_constant
25 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR operator value_type() const _NOEXCEPT { return value; }
27 _LIBCPP_HIDE_FROM_ABI constexpr value_type operator()() const _NOEXCEPT { return value; }
/freebsd-current/contrib/llvm-project/libcxx/include/__iterator/
H A Dreadable_traits.h38 using value_type = remove_cv_t<_Tp>;
42 concept __has_member_value_type = requires { typename _Tp::value_type; };
53 using value_type = remove_cv_t<remove_extent_t<_Ip>>;
63 struct indirectly_readable_traits<_Tp> : __cond_value_type<typename _Tp::value_type> {};
74 same_as<remove_cv_t<typename _Tp::element_type>, remove_cv_t<typename _Tp::value_type>>
75 struct indirectly_readable_traits<_Tp> : __cond_value_type<typename _Tp::value_type> {};
H A Dprojected.h29 using value_type = remove_cvref_t<indirect_result_t<_Proj&, _It>>;
37 using value_type = remove_cvref_t<indirect_result_t<_Proj&, _It>>;
H A Diterator.h24 typedef _Tp value_type; typedef in struct:iterator
H A Dback_insert_iterator.h43 typedef void value_type; typedef in class:back_insert_iterator
56 operator=(const typename _Container::value_type& __value) {
62 operator=(typename _Container::value_type&& __value) {
H A Dfront_insert_iterator.h43 typedef void value_type; typedef in class:front_insert_iterator
56 operator=(const typename _Container::value_type& __value) {
62 operator=(typename _Container::value_type&& __value) {
/freebsd-current/contrib/llvm-project/libcxx/include/experimental/__simd/
H A Dreference.h46 using value_type = _Vp;
51 _LIBCPP_HIDE_FROM_ABI operator value_type() const noexcept { return __get(); }
53 template <class _Up, enable_if_t<is_assignable_v<value_type&, _Up&&>, int> = 0>
55 __set(static_cast<value_type>(std::forward<_Up>(__v)));
H A Dsimd.h38 using value_type = _Tp;
39 using reference = __simd_reference<_Tp, _Storage, value_type>;
43 static _LIBCPP_HIDE_FROM_ABI constexpr size_t size() noexcept { return simd_size_v<value_type, abi_type>; }
48 template <class _Up, enable_if_t<__can_broadcast_v<value_type, __remove_cvref_t<_Up>>, int> = 0>
49 _LIBCPP_HIDE_FROM_ABI simd(_Up&& __v) noexcept : __s_(_Impl::__broadcast(static_cast<value_type>(__v))) {}
54 __is_non_narrowing_convertible_v<_Up, value_type>,
58 (*this)[__i] = static_cast<value_type>(__v[__i]);
63 template <class _Generator, enable_if_t<__can_generate_v<value_type, _Generator, size()>, int> = 0>
75 _LIBCPP_HIDE_FROM_ABI value_type operator[](size_t __i) const noexcept { return __s_.__get(__i); }
/freebsd-current/contrib/llvm-project/libcxx/include/__numeric/
H A Dadjacent_difference.h30 typename iterator_traits<_InputIterator>::value_type __acc(*__first);
33 typename iterator_traits<_InputIterator>::value_type __val(*__first);
49 typename iterator_traits<_InputIterator>::value_type __acc(*__first);
52 typename iterator_traits<_InputIterator>::value_type __val(*__first);
/freebsd-current/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h43 using value_type = _Value;
46 const value_type __default_value_;
51 size_t __sz, value_type __default_value, _Hash __hash, _BinaryPredicate __pred)
54 _LIBCPP_HIDE_FROM_ABI void insert(const key_type& __key, value_type __val) { __table_[__key] = __val; }
56 _LIBCPP_HIDE_FROM_ABI value_type operator[](const key_type& __key) const {
66 using value_type = _Value;
70 std::array<value_type, 256> __table_;
74 _LIBCPP_HIDE_FROM_ABI explicit _BMSkipTable(size_t, value_type __default_value, _Hash, _BinaryPredicate) {
78 _LIBCPP_HIDE_FROM_ABI void insert(key_type __key, value_type __val) {
82 _LIBCPP_HIDE_FROM_ABI value_type operato
[all...]
/freebsd-current/contrib/llvm-project/clang/include/clang/Serialization/
H A DContinuousRangeMap.h39 using value_type = std::pair<Int, V>;
40 using reference = value_type &;
41 using const_reference = const value_type &;
42 using pointer = value_type *;
43 using const_pointer = const value_type *;
46 using Representation = SmallVector<value_type, InitialCapacity>;
66 void insert(const value_type &Val) {
75 void insertOrReplace(const value_type &Val) {
134 void insert(const value_type &Val) {
/freebsd-current/contrib/llvm-project/llvm/include/llvm/XRay/
H A DTrace.h57 using value_type = RecordVector::value_type;
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/
H A DCombinationGenerator.h42 using value_type = T;
44 const ArrayRef<value_type> Range;
61 const value_type &operator*() const { return *Position; }
63 WrappingIterator(ArrayRef<value_type> Range_) : Range(Range_) {

Completed in 169 milliseconds

1234567891011>>