Home
last modified time | relevance | path

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

12

/src/contrib/llvm-project/libcxx/include/__functional/
H A Dhash.h32 template <class _Size>
33 inline _LIBCPP_HIDE_FROM_ABI _Size __loadword(const void* __p) { in __loadword()
34 _Size __r; in __loadword()
42 template <class _Size, size_t = sizeof(_Size) * __CHAR_BIT__>
45 template <class _Size>
46 struct __murmur2_or_cityhash<_Size, 32> {
47 _LIBCPP_HIDE_FROM_ABI _LIBCPP_DISABLE_UBSAN_UNSIGNED_INTEGER_CHECK _Size
48 operator()(const void* __key, _Size __len) const {
50 const _Size __m = 0x5bd1e995;
51 const _Size __r = 24;
[all …]
/src/contrib/llvm-project/libcxx/include/
H A Dbitset158 template <size_t _N_words, size_t _Size>
161 template <size_t _N_words, size_t _Size>
162 struct __has_storage_type<__bitset<_N_words, _Size> > {
166 template <size_t _N_words, size_t _Size>
214 return to_ulong(integral_constant < bool, _Size< sizeof(unsigned long) * CHAR_BIT>());
217 return to_ullong(integral_constant < bool, _Size< sizeof(unsigned long long) * CHAR_BIT>());
237 template <size_t _N_words, size_t _Size>
238 inline _LIBCPP_CONSTEXPR __bitset<_N_words, _Size>::__bitset() _NOEXCEPT
250 template <size_t _N_words, size_t _Size>
251 void __bitset<_N_words, _Size>::__init(unsigned long long __v, false_type) _NOEXCEPT {
[all …]
H A Darray168 template <class _Tp, size_t _Size>
191 _Tp __elems_[_Size];
195 std::fill_n(data(), _Size, __u);
199 std::swap_ranges(data(), data() + _Size, __a.data());
207 …ROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX17 iterator end() _NOEXCEPT { return iterator(data() + _Size); }
209 return const_iterator(data() + _Size);
233 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT { return _Size; }
234 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT { return _Size; }
235 …DISCARD _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT { return _Size == 0; }
239 _LIBCPP_ASSERT_VALID_ELEMENT_ACCESS(__n < _Size, "out-of-bounds access in std::array<T, N>");
[all …]
/src/contrib/llvm-project/libcxx/include/__fwd/
H A Darray.h21 template <class _Tp, size_t _Size>
24 template <size_t _Ip, class _Tp, size_t _Size>
25 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp& get(array<_Tp, _Size>&) _NOEXCEPT;
27 template <size_t _Ip, class _Tp, size_t _Size>
28 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const _Tp& get(const array<_Tp, _Size>&) _NOEXC…
31 template <size_t _Ip, class _Tp, size_t _Size>
32 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp&& get(array<_Tp, _Size>&&) _NOEXCEPT;
34 template <size_t _Ip, class _Tp, size_t _Size>
35 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const _Tp&& get(const array<_Tp, _Size>&&) _NOE…
41 template <class _Tp, size_t _Size>
[all …]
/src/contrib/llvm-project/libcxx/include/__type_traits/
H A Dtype_list.h27 template <class _TypeList, size_t _Size, bool = _Size <= sizeof(typename _TypeList::_Head)>
30 template <class _Hp, class _Tp, size_t _Size>
31 struct __find_first<__type_list<_Hp, _Tp>, _Size, true> {
35 template <class _Hp, class _Tp, size_t _Size>
36 struct __find_first<__type_list<_Hp, _Tp>, _Size, false> {
37 typedef _LIBCPP_NODEBUG typename __find_first<_Tp, _Size>::type type;
/src/contrib/llvm-project/libcxx/include/__concepts/
H A Dswappable.h58 template <class _Tp, class _Up, size_t _Size>
60 !__unqualified_swappable_with<_Tp (&)[_Size], _Up (&)[_Size]> &&
62 requires(_Tp (&__t)[_Size], _Up (&__u)[_Size], const __fn& __swap) {
82 template <class _Tp, class _Up, size_t _Size>
83 requires __swappable_arrays<_Tp, _Up, _Size>
84 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp (&__t)[_Size], _Up (&__u)[_Size]) const in operator()
87 for (size_t __i = 0; __i < _Size; ++__i) { in operator()
/src/contrib/llvm-project/libcxx/include/__mdspan/
H A Dextents.h76 template <class _Tp, size_t _Size>
78 _Tp __vals_[_Size];
155 template <class _Tp, size_t _Size >
156 requires(_Size == __size_dynamic_)
157 …_LIBCPP_HIDE_FROM_ABI constexpr __maybe_static_array([[maybe_unused]] const span<_Tp, _Size>& __va…
158 if constexpr (_Size > 0) {
159 for (size_t __i = 0; __i < _Size; __i++)
185 template <class _Tp, size_t _Size>
186 requires(_Size != __size_dynamic_)
187 _LIBCPP_HIDE_FROM_ABI constexpr __maybe_static_array(const span<_Tp, _Size>& __vals) {
[all …]
H A Dmdspan.h119 template <class _OtherIndexType, size_t _Size>
122 …((_Size == rank()) || (_Size == rank_dynamic())) && is_constructible_v<mapping_type, extents_type>…
124 explicit(_Size != rank_dynamic())
125 …P_HIDE_FROM_ABI constexpr mdspan(data_handle_type __p, const array<_OtherIndexType, _Size>& __exts) in mdspan()
128 template <class _OtherIndexType, size_t _Size>
131 …((_Size == rank()) || (_Size == rank_dynamic())) && is_constructible_v<mapping_type, extents_type>…
133 explicit(_Size != rank_dynamic())
134 … _LIBCPP_HIDE_FROM_ABI constexpr mdspan(data_handle_type __p, span<_OtherIndexType, _Size> __exts) in mdspan()
289 template <class _ElementType, class _OtherIndexType, size_t _Size>
290 …span(_ElementType*, const array<_OtherIndexType, _Size>&) -> mdspan<_ElementType, dextents<size_t,…
[all …]
/src/contrib/llvm-project/libcxx/include/__algorithm/
H A Dfill_n.h30 template <class _OutputIterator, class _Size, class _Tp>
32 __fill_n(_OutputIterator __first, _Size __n, const _Tp& __value);
68 template <class _Cp, class _Size>
70 __fill_n(__bit_iterator<_Cp, false> __first, _Size __n, const bool& __value) { in __fill_n()
80 template <class _OutputIterator, class _Size, class _Tp>
82 __fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) { in __fill_n()
88 template <class _OutputIterator, class _Size, class _Tp>
90 fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) { in fill_n()
H A Dcopy_n.h25 class _Size,
31 copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) { in copy_n()
47 class _Size,
51 copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) { in copy_n()
H A Dgenerate_n.h21 template <class _OutputIterator, class _Size, class _Generator>
23 generate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) { in generate_n()
H A Dfor_each_n.h24 template <class _InputIterator, class _Size, class _Function>
26 for_each_n(_InputIterator __first, _Size __orig_n, _Function __f) { in for_each_n()
H A Dsearch_n.h138 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
140 …_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value, _BinaryPredi… in search_n()
147 template <class _ForwardIterator, class _Size, class _Tp>
149 search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value) { in search_n()
H A Dpstl.h97 class _Size,
101 copy_n(_ExecutionPolicy&& __policy, _ForwardIterator __first, _Size __n, _ForwardOutIterator __resu… in copy_n()
245 class _Size,
250 fill_n(_ExecutionPolicy&& __policy, _ForwardIterator __first, _Size __n, const _Tp& __value) { in fill_n()
311 class _Size,
316 for_each_n(_ExecutionPolicy&& __policy, _ForwardIterator __first, _Size __size, _Function __func) { in for_each_n()
338 class _Size,
343 generate_n(_ExecutionPolicy&& __policy, _ForwardIterator __first, _Size __n, _Generator __gen) { in generate_n()
/src/contrib/llvm-project/libcxx/include/__pstl/cpu_algos/
H A Dtransform_reduce.h55 typename _Size,
59 typename _UnaryResult = invoke_result_t<_UnaryOperation, _Size>,
64 __simd_transform_reduce(_Size __n, _Tp __init, _BinaryOperation __binary_op, _UnaryOperation __f) n… in __simd_transform_reduce()
66 const _Size __block_size = __lane_size / sizeof(_Tp); in __simd_transform_reduce()
73 for (_Size __i = 0; __i < __block_size; ++__i) { in __simd_transform_reduce()
77 _Size __i = 2 * __block_size; in __simd_transform_reduce()
78 const _Size __last_iteration = __block_size * (__n / __block_size); in __simd_transform_reduce()
81 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce()
87 for (_Size __j = 0; __j < __n - __last_iteration; ++__j) { in __simd_transform_reduce()
91 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce()
[all …]
/src/contrib/llvm-project/libcxx/include/__memory/
H A Duninitialized_algorithms.h88 template <class _ValueType, class _InputIterator, class _Size, class _ForwardIterator, class _EndPr…
90 __uninitialized_copy_n(_InputIterator __ifirst, _Size __n, _ForwardIterator __ofirst, _EndPredicate… in __uninitialized_copy_n()
107 template <class _InputIterator, class _Size, class _ForwardIterator>
109 uninitialized_copy_n(_InputIterator __ifirst, _Size __n, _ForwardIterator __ofirst) { in uninitialized_copy_n()
146 template <class _ValueType, class _ForwardIterator, class _Size, class _Tp>
148 __uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) { in __uninitialized_fill_n()
165 template <class _ForwardIterator, class _Size, class _Tp>
167 uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) { in uninitialized_fill_n()
203 template <class _ValueType, class _ForwardIterator, class _Size>
204 …ROM_ABI _ForwardIterator __uninitialized_default_construct_n(_ForwardIterator __first, _Size __n) { in __uninitialized_default_construct_n()
[all …]
H A Dallocation_guard.h50 using _Size = typename allocator_traits<_Alloc>::size_type; member
53 _LIBCPP_HIDE_FROM_ABI explicit __allocation_guard(_AllocT __alloc, _Size __n) in __allocation_guard()
100 _Size __n_;
H A Dconstruct_at.h115 template <class _ForwardIterator, class _Size>
116 …ABI _LIBCPP_CONSTEXPR_SINCE_CXX20 _ForwardIterator destroy_n(_ForwardIterator __first, _Size __n) { in destroy_n()
/src/contrib/llvm-project/libcxx/include/__format/
H A Dbuffer.h412 using _Size = iter_difference_t<_OutIt>;
415 _LIBCPP_HIDE_FROM_ABI explicit __format_to_n_buffer_base(_OutIt __out_it, _Size __max_size)
416 : __writer_(std::move(__out_it)), __max_size_(std::max(_Size(0), __max_size)) {}
419 if (_Size(__size_) <= __max_size_)
420 __writer_.__flush(__ptr, std::min(_Size(__n), __max_size_ - __size_));
429 _Size __max_size_;
430 _Size __size_{0};
442 using _Size = iter_difference_t<_OutIt>;
445 _LIBCPP_HIDE_FROM_ABI explicit __format_to_n_buffer_base(_OutIt __out_it, _Size __max_size)
471 _Size __s = std::min(_Size(__n), __max_size_ - __size_);
[all …]
H A Dformatter_string.h108 template <__fmt_char_type _CharT, size_t _Size>
109 struct _LIBCPP_TEMPLATE_VIS formatter<_CharT[_Size], _CharT> : public __formatter_string<_CharT> {
114 format(const _CharT (&__str)[_Size], _FormatContext& __ctx) const {
115 return _Base::format(basic_string_view<_CharT>(__str, _Size), __ctx);
/src/contrib/llvm-project/libcxx/include/__tuple/
H A Dtuple_like_no_subrange.h38 template <class _Tp, size_t _Size>
39 inline constexpr bool __tuple_like_no_subrange_impl<array<_Tp, _Size>> = true;
H A Dtuple_like_ext.h44 template <class _Tp, size_t _Size>
45 struct __tuple_like_ext<array<_Tp, _Size> > : true_type {};
/src/contrib/llvm-project/libcxx/include/__compare/
H A Dcommon_comparison_category.h40 template <size_t _Size>
42 __compute_comp_type(const _ClassifyCompCategory (&__types)[_Size]) { in __compute_comp_type() argument
/src/contrib/llvm-project/libcxx/include/__pstl/backends/
H A Ddefault.h184 template <class _Policy, class _ForwardIterator, class _Size, class _Function>
186 …operator()(_Policy&& __policy, _ForwardIterator __first, _Size __size, _Function __func) const noe…
212 template <class _Policy, class _ForwardIterator, class _Size, class _Tp>
214 …operator()(_Policy&& __policy, _ForwardIterator __first, _Size __n, _Tp const& __value) const noex…
268 template <class _Policy, class _ForwardIterator, class _Size, class _Generator>
270 …operator()(_Policy&& __policy, _ForwardIterator __first, _Size __n, _Generator&& __gen) const noex…
467 template <class _Policy, class _ForwardIterator, class _Size, class _ForwardOutIterator>
469 …operator()(_Policy&& __policy, _ForwardIterator __first, _Size __n, _ForwardOutIterator __out_it) …
/src/contrib/llvm-project/libcxx/include/experimental/__simd/
H A Dutility.h93 template <class _Tp, class _Generator, std::size_t _Size>
94 …ool __can_generate_v = experimental::__can_generate<_Tp, _Generator>(make_index_sequence<_Size>());

12