| /openbsd-src/gnu/llvm/llvm/include/llvm/Support/ |
| H A D | Endian.h | 48 template <typename value_type> 49 inline value_type byte_swap(value_type value, endianness endian) { in byte_swap() 56 template<typename value_type, endianness endian> 57 inline value_type byte_swap(value_type value) { in byte_swap() 62 template <typename value_type, std::size_t alignment> 63 inline value_type read(const void *memory, endianness endian) { in read() 64 value_type ret; in read() 68 memory, (detail::PickAlignment<value_type, alignment>::value)), in read() 69 sizeof(value_type)); in read() 70 return byte_swap<value_type>(ret, endian); in read() [all …]
|
| H A D | EndianStream.h | 27 template <typename value_type> 28 inline void write(raw_ostream &os, value_type value, endianness endian) { in write() 29 value = byte_swap<value_type>(value, endian); in write() 30 os.write((const char *)&value, sizeof(value_type)); in write() 44 template <typename value_type> 45 inline void write(raw_ostream &os, ArrayRef<value_type> vals, in write() 47 for (value_type v : vals) in write() 56 template <typename value_type> void write(ArrayRef<value_type> Val) { in write() 59 template <typename value_type> void write(value_type Val) { in write()
|
| /openbsd-src/gnu/llvm/libcxx/include/ |
| H A D | valarray | 23 typedef T value_type; 28 valarray(const value_type& x, size_t n); 29 valarray(const value_type* px, size_t n); 32 valarray(const slice_array<value_type>& sa); 33 valarray(const gslice_array<value_type>& ga); 34 valarray(const mask_array<value_type>& ma); 35 valarray(const indirect_array<value_type>& ia); 36 valarray(initializer_list<value_type> il); 42 valarray& operator=(initializer_list<value_type> il); 43 valarray& operator=(const value_type& x); [all …]
|
| /openbsd-src/gnu/llvm/libcxx/include/__string.d/__string/ |
| H A D | extern_template_lists.h | 31 …ing<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*, size_typ… 32 …_VIS basic_string<_CharType>::size_type basic_string<_CharType>::rfind(value_type const*, size_typ… 33 …_Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init(value_type const*, size_type, size_typ… 35 …sic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*)) \ 37 …string<_CharType>::size_type basic_string<_CharType>::find_last_not_of(value_type const*, size_typ… 39 …tring<_CharType>::size_type basic_string<_CharType>::find_first_not_of(value_type const*, size_typ… 40 …C_VIS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, size_type, value_type)) \ 41 _Func(_LIBCPP_FUNC_VIS basic_string<_CharType>& basic_string<_CharType>::operator=(value_type)) \ 42 _Func(_LIBCPP_FUNC_VIS void basic_string<_CharType>::__init(value_type const*, size_type)) \ 44 …IS basic_string<_CharType>& basic_string<_CharType>::insert(size_type, value_type const*, size_typ… [all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/bits/ |
| H A D | valarray_after.h | 52 typedef typename _Dom::value_type value_type; in _GLIBCXX_BEGIN_NAMESPACE() typedef 57 value_type in _GLIBCXX_BEGIN_NAMESPACE() 74 typedef _Tp value_type; typedef 79 value_type 97 typedef typename _Base::value_type value_type; 108 typedef typename _Base::value_type value_type; 121 typedef typename _Dom::value_type value_type; 126 value_type 144 typedef typename _Base::value_type value_type; 155 typedef _Tp value_type; [all …]
|
| H A D | valarray_before.h | 410 typedef typename _Dom::value_type value_type; 412 _FunBase(const _Dom& __e, value_type __f(_Arg)) 415 value_type operator[](size_t __i) const 422 value_type (*_M_func)(_Arg); 426 struct _ValFunClos<_Expr,_Dom> : _FunBase<_Dom, typename _Dom::value_type> 428 typedef _FunBase<_Dom, typename _Dom::value_type> _Base; 429 typedef typename _Base::value_type value_type; 430 typedef value_type _Tp; 439 typedef _Tp value_type; 446 : _FunBase<_Dom, const typename _Dom::value_type&> [all …]
|
| /openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/ |
| H A D | valarray_meta.h | 390 typedef typename _Dom::value_type value_type; 392 _FunBase(const _Dom& __e, value_type __f(_Arg)) 395 value_type operator[](size_t __i) const 402 value_type (*_M_func)(_Arg); 406 struct _ValFunClos<_Expr,_Dom> : _FunBase<_Dom, typename _Dom::value_type> 408 typedef _FunBase<_Dom, typename _Dom::value_type> _Base; 409 typedef typename _Base::value_type value_type; 410 typedef value_type _Tp; 419 typedef _Tp value_type; 426 _FunBase<_Dom, const typename _Dom::value_type&> [all …]
|
| H A D | stl_algo.h | 297 typename iterator_traits<_InputIter>::value_type, _Tp>) in find() 317 typename iterator_traits<_InputIter>::value_type>) in find_if() 336 typename iterator_traits<_ForwardIter>::value_type>) in adjacent_find() 366 typename iterator_traits<_ForwardIter>::value_type, in adjacent_find() 367 typename iterator_traits<_ForwardIter>::value_type>) in adjacent_find() 394 typename iterator_traits<_InputIter>::value_type >) in count() 418 typename iterator_traits<_InputIter>::value_type>) in count_if() 459 typename iterator_traits<_ForwardIter1>::value_type, in search() 460 typename iterator_traits<_ForwardIter2>::value_type>) in search() 532 typename iterator_traits<_ForwardIter1>::value_type, in search() [all …]
|
| H A D | stl_list.h | 149 typedef _Tp value_type; typedef 374 typedef _Tp value_type; typedef 375 typedef value_type* pointer; 376 typedef const value_type* const_pointer; 381 typedef value_type& reference; 382 typedef const value_type& const_reference; 409 _M_create_node(const value_type& __x) in _M_create_node() 461 list(size_type __n, const value_type& __value, 476 { this->insert(begin(), __n, value_type()); } in list() 536 assign(size_type __n, const value_type& __val) { _M_fill_assign(__n, __val); } in assign() [all …]
|
| /openbsd-src/gnu/llvm/libcxx/include/__algorithm/ |
| H A D | stable_sort.h | 37 typename iterator_traits<_InputIterator1>::value_type* __result, _Compare __comp) in __merge_move_construct() 41 typedef typename iterator_traits<_InputIterator1>::value_type value_type; in __merge_move_construct() typedef 43 unique_ptr<value_type, __destruct_n&> __h(__result, __d); in __merge_move_construct() 48 … for (; __first2 != __last2; ++__first2, (void) ++__result, __d.template __incr<value_type>()) in __merge_move_construct() 49 ::new ((void*)__result) value_type(_Ops::__iter_move(__first2)); in __merge_move_construct() 55 … for (; __first1 != __last1; ++__first1, (void) ++__result, __d.template __incr<value_type>()) in __merge_move_construct() 56 ::new ((void*)__result) value_type(_Ops::__iter_move(__first1)); in __merge_move_construct() 62 ::new ((void*)__result) value_type(_Ops::__iter_move(__first2)); in __merge_move_construct() 63 __d.template __incr<value_type>(); in __merge_move_construct() 68 ::new ((void*)__result) value_type(_Ops::__iter_move(__first1)); in __merge_move_construct() [all …]
|
| H A D | stable_partition.h | 55 typedef typename iterator_traits<_ForwardIterator>::value_type value_type; in __stable_partition_impl() typedef 57 unique_ptr<value_type, __destruct_n&> __h(__p.first, __d); in __stable_partition_impl() 60 value_type* __t = __p.first; in __stable_partition_impl() 61 ::new ((void*)__t) value_type(_Ops::__iter_move(__first)); in __stable_partition_impl() 62 __d.template __incr<value_type>(); in __stable_partition_impl() 74 ::new ((void*)__t) value_type(_Ops::__iter_move(__i)); in __stable_partition_impl() 75 __d.template __incr<value_type>(); in __stable_partition_impl() 82 for (value_type* __t2 = __p.first; __t2 < __t; ++__t2, (void) ++__i) in __stable_partition_impl() 139 typedef typename iterator_traits<_ForwardIterator>::value_type value_type; in __stable_partition_impl() typedef 141 pair<value_type*, ptrdiff_t> __p(0, 0); in __stable_partition_impl() [all …]
|
| H A D | rotate.h | 32 typedef typename iterator_traits<_ForwardIterator>::value_type value_type; in __rotate_left() typedef 35 value_type __tmp = _Ops::__iter_move(__first); in __rotate_left() 46 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; in __rotate_right() typedef 50 value_type __tmp = _Ops::__iter_move(__lm1); in __rotate_right() 110 typedef typename iterator_traits<_RandomAccessIterator>::value_type value_type; in __rotate_gcd() typedef 123 value_type __t(_Ops::__iter_move(--__p)); in __rotate_gcd() 147 typedef typename iterator_traits<_ForwardIterator>::value_type value_type; in __rotate_impl() typedef 148 if (is_trivially_move_assignable<value_type>::value) in __rotate_impl() 162 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; in __rotate_impl() typedef 163 if (is_trivially_move_assignable<value_type>::value) in __rotate_impl() [all …]
|
| H A D | inplace_merge.h | 99 typename iterator_traits<_BidirectionalIterator>::value_type* __buff) { in __buffered_inplace_merge() 100 typedef typename iterator_traits<_BidirectionalIterator>::value_type value_type; in __buffered_inplace_merge() typedef 102 unique_ptr<value_type, __destruct_n&> __h2(__buff, __d); in __buffered_inplace_merge() 105 value_type* __p = __buff; in __buffered_inplace_merge() 106 …for (_BidirectionalIterator __i = __first; __i != __middle; __d.template __incr<value_type>(), (vo… in __buffered_inplace_merge() 107 ::new ((void*)__p) value_type(_IterOps<_AlgPolicy>::__iter_move(__i)); in __buffered_inplace_merge() 112 value_type* __p = __buff; in __buffered_inplace_merge() 113 …for (_BidirectionalIterator __i = __middle; __i != __last; __d.template __incr<value_type>(), (voi… in __buffered_inplace_merge() 114 ::new ((void*)__p) value_type(_IterOps<_AlgPolicy>::__iter_move(__i)); in __buffered_inplace_merge() 116 typedef __unconstrained_reverse_iterator<value_type*> _Rv; in __buffered_inplace_merge() [all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/basic_tree_policy/ |
| H A D | basic_tree_policy_base.hpp | 67 typedef typename Node_Iterator::value_type it_type; 69 typedef typename std::iterator_traits< it_type>::value_type value_type; typedef 71 typedef typename value_type::first_type key_type; 82 value_type>::type>::other::const_reference 88 value_type>::type>::other::reference 94 value_type>::type>::other::const_pointer 124 typedef typename Const_Node_Iterator::value_type it_type; 126 typedef typename std::iterator_traits< it_type>::value_type value_type; typedef 128 typedef value_type key_type; 139 value_type>::type>::other::const_reference [all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/ |
| H A D | basic_types.hpp | 70 typedef typename mapped_type_allocator::value_type mapped_type; 77 typedef typename value_type_allocator::value_type value_type; typedef 85 value_type m_value; 97 typedef typename mapped_type_allocator::value_type mapped_type; 104 typedef typename value_type_allocator::value_type value_type; typedef 112 value_type m_value; 131 typedef typename mapped_type_allocator::value_type mapped_type; 137 typedef Key value_type; typedef 139 typedef typename Allocator::template rebind<value_type>::other value_type_allocator; 147 value_type m_value; [all …]
|
| /openbsd-src/gnu/llvm/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 49 using value_type = _Value; 52 const value_type __default_value_; 57 …explicit _BMSkipTable(size_t __sz, value_type __default_value, _Hash __hash, _BinaryPredicate __pr… in _BMSkipTable() 61 _LIBCPP_HIDE_FROM_ABI void insert(const key_type& __key, value_type __val) { in insert() 65 _LIBCPP_HIDE_FROM_ABI value_type operator[](const key_type& __key) const { 78 using value_type = _Value; 82 std::array<value_type, 256> __table_; 86 …_LIBCPP_HIDE_FROM_ABI explicit _BMSkipTable(size_t, value_type __default_value, _Hash, _BinaryPred… in _BMSkipTable() 90 _LIBCPP_HIDE_FROM_ABI void insert(key_type __key, value_type __val) { in insert() 94 _LIBCPP_HIDE_FROM_ABI value_type operator[](key_type __key) const { [all …]
|
| /openbsd-src/gnu/usr.bin/binutils/gdb/ |
| H A D | infcall.c | 167 struct type *value_type; in find_function_addr() local 177 value_type = TYPE_TARGET_TYPE (ftype); in find_function_addr() 189 value_type = TYPE_TARGET_TYPE (ftype); in find_function_addr() 192 value_type = builtin_type_int; in find_function_addr() 204 value_type = builtin_type_int; in find_function_addr() 210 *retval_type = value_type; in find_function_addr() 227 struct type *value_type, in generic_push_dummy_code() argument 266 struct type *value_type, in push_dummy_code() argument 271 args, nargs, value_type, real_pc, bp_addr); in push_dummy_code() 274 args, nargs, value_type, real_pc, bp_addr); in push_dummy_code() [all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/ov_tree_map_/ |
| H A D | traits.hpp | 80 false>::value_type 81 value_type; typedef 95 value_type, 102 value_type, 146 false>::value_type 147 value_type; typedef 161 value_type,
|
| /openbsd-src/gnu/llvm/libcxx/include/experimental/ |
| H A D | functional | 26 class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>, 31 class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>, 41 class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>, 49 class Hash = hash<typename iterator_traits<RandomAccessIterator>::value_type>, 131 typedef _Value value_type; 143 void insert(const key_type &__key, value_type __val) 149 value_type operator [](const key_type & __key) const 161 typedef _Value value_type; 165 typedef std::array<value_type, 256> skip_map; 176 void insert(key_type __key, value_type __val) [all …]
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/ |
| H A D | trie_policy.hpp | 68 …template<typename String, typename String::value_type Min_E_Val, typename String::value_type Max_E… 75 …typename String::value_type Min_E_Val = detail::__numeric_traits<typename String::value_type>::__m… 76 …typename String::value_type Max_E_Val = detail::__numeric_traits<typename String::value_type>::__m… 96 typedef typename std::iterator_traits<const_iterator>::value_type e_type; 180 typedef typename const_node_iterator::value_type const_iterator; 181 typedef typename node_iterator::value_type iterator; 270 typedef typename const_node_iterator::value_type const_iterator; 271 typedef typename node_iterator::value_type iterator;
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/ext/ |
| H A D | throw_allocator.h | 167 typedef map_type::value_type entry_type; 196 typedef T value_type; typedef 197 typedef value_type* pointer; 198 typedef const value_type* const_pointer; 199 typedef value_type& reference; 200 typedef const value_type& const_reference; 220 { return std::allocator<value_type>().max_size(); } in max_size() 226 value_type* const a = std::allocator<value_type>().allocate(num, hint); 227 insert(a, sizeof(value_type) * num); 233 { return std::allocator<value_type>().construct(p, val); } in construct() [all …]
|
| /openbsd-src/gnu/llvm/clang/include/clang/Serialization/ |
| H A D | ContinuousRangeMap.h | 39 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) { in insert() 75 void insertOrReplace(const value_type &Val) { in insertOrReplace() 134 void insert(const value_type &Val) { in insert()
|
| /openbsd-src/gnu/llvm/libcxx/include/__iterator/ |
| H A D | readable_traits.h | 36 struct __cond_value_type<_Tp> { using value_type = remove_cv_t<_Tp>; }; 39 concept __has_member_value_type = requires { typename _Tp::value_type; }; 49 using value_type = remove_cv_t<remove_extent_t<_Ip>>; 60 : __cond_value_type<typename _Tp::value_type> {}; 73 remove_cv_t<typename _Tp::value_type>> 75 : __cond_value_type<typename _Tp::value_type> {}; 86 iterator_traits<remove_cvref_t<_Ip> > >::value_type;
|
| /openbsd-src/gnu/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| H A D | const_point_iterator.hpp | 82 typedef typename Node::value_type value_type; typedef in pb_ds::detail::left_child_next_sibling_heap_node_const_point_iterator_ 87 value_type>::other::pointer 93 value_type>::other::const_pointer 99 value_type>::other::reference 105 value_type>::other::const_reference
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/orc/ |
| H A D | interval_set.h | 33 using value_type = std::pair<KeyT, KeyT>; 39 using value_type = IntervalSet::value_type; variable 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; }
|