Home
last modified time | relevance | path

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

12

/llvm-project-15.0.7/libcxx/include/__functional/
H A Dhash.h33 _Size
56 _Size
65 _Size __k = __loadword<_Size>(__data);
110 static _Size __shift_mix(_Size __val) {
114 static _Size __hash_len_16(_Size __u, _Size __v)
130 const _Size __a = __loadword<_Size>(__s);
165 _Size __w, _Size __x, _Size __y, _Size __z, _Size __a, _Size __b)
179 const char* __s, _Size __a, _Size __b)
194 _Size __z = __loadword<_Size>(__s + 24);
195 _Size __a = __loadword<_Size>(__s) +
[all …]
/llvm-project-15.0.7/libcxx/include/
H A Dbitset670 template <size_t _Size> struct hash<bitset<_Size> >;
674 : private __bitset<_Size == 0 ? 0 : (_Size - 1) / (sizeof(size_t) * CHAR_BIT) + 1, _Size>
819 bitset<_Size>&
828 bitset<_Size>&
837 bitset<_Size>&
906 bitset<_Size>
1043 bitset<_Size>
1053 bitset<_Size>
1063 bitset<_Size>
1073 bitset<_Size>
[all …]
H A Darray151 template <class _Tp, size_t _Size>
168 _Tp __elems_[_Size];
231 if (__n >= _Size)
238 if (__n >= _Size)
393 operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
401 operator!=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
409 operator<(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
418 operator>(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
426 operator<=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
434 operator>=(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y)
[all …]
H A D__tuple219 template <class _Tp, size_t _Size> struct _LIBCPP_TEMPLATE_VIS array;
221 template <class _Tp, size_t _Size> struct __tuple_like<array<_Tp, _Size> > : true_type {};
223 template <size_t _Ip, class _Tp, size_t _Size>
226 get(array<_Tp, _Size>&) _NOEXCEPT;
228 template <size_t _Ip, class _Tp, size_t _Size>
231 get(const array<_Tp, _Size>&) _NOEXCEPT;
234 template <size_t _Ip, class _Tp, size_t _Size>
237 get(array<_Tp, _Size>&&) _NOEXCEPT;
239 template <size_t _Ip, class _Tp, size_t _Size>
242 get(const array<_Tp, _Size>&&) _NOEXCEPT;
/llvm-project-15.0.7/pstl/include/pstl/internal/
H A Dglue_memory_defs.h27 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator>
29 uninitialized_copy_n(_ExecutionPolicy&& __exec, _InputIterator __first, _Size __n, _ForwardIterator…
37 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator>
47 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
49 uninitialized_fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, const _Tp& __v…
57 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
59 destroy_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n);
67 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
69 uninitialized_default_construct_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n);
77 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
[all …]
H A Dunseq_backend_simd.h476 _Size __i = 2 * __block_size; in __simd_transform_reduce()
506 for (_Size __i = 0; __i < __n; ++__i) in __simd_transform_reduce()
522 for (_Size __i = 0; __i < __n; ++__i) in __simd_scan()
562 for (_Size __i = 0; __i < __n; ++__i) in __simd_scan()
580 for (_Size __i = 0; __i < __n; ++__i) in __simd_scan()
602 for (_Size __i = 0; __i < __n; ++__i) in __simd_scan()
627 _Size __min_ind; in __simd_min_element()
658 for (_Size __i = 1; __i < __n; ++__i) in __simd_min_element()
687 _Size __min_ind; in __simd_minmax_element()
688 _Size __max_ind; in __simd_minmax_element()
[all …]
H A Dglue_memory_impl.h59 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator>
78 [](_InputIterator __begin, _Size __sz, _ForwardIterator __res) in uninitialized_copy_n()
123 template <class _ExecutionPolicy, class _InputIterator, class _Size, class _ForwardIterator>
142 [](_InputIterator __begin, _Size __sz, _ForwardIterator __res) in uninitialized_move_n()
184 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
201 [&__value](_ForwardIterator __begin, _Size __count) in uninitialized_fill_n()
232 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
234 destroy_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n) in destroy_n()
271 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
320 template <class _ExecutionPolicy, class _ForwardIterator, class _Size>
[all …]
H A Dalgorithm_fwd.h83 template <class _ForwardIterator, class _Size, class _Function>
84 _ForwardIterator __brick_walk1_n(_ForwardIterator, _Size, _Function,
341 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
366 template <class _ForwardIterator, class _Size, class _OutputIterator>
367 _OutputIterator __brick_copy_n(_ForwardIterator, _Size, _OutputIterator,
370 template <class _RandomAccessIterator, class _Size, class _OutputIterator>
371 _OutputIterator __brick_copy_n(_RandomAccessIterator, _Size, _OutputIterator,
837 template <class _RandomAccessIterator, class _Size, class _Tp>
839 __brick_fill_n(_RandomAccessIterator, _Size, const _Tp&,
842 template <class _OutputIterator, class _Size, class _Tp>
[all …]
H A Dglue_algorithm_defs.h48 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Function>
50 for_each_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __n, _Function __f);
126 search_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Size __coun…
129 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
131 search_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Size __coun…
140 template <class _ExecutionPolicy, class _ForwardIterator1, class _Size, class _ForwardIterator2>
142 copy_n(_ExecutionPolicy&& __exec, _ForwardIterator1 __first, _Size __n, _ForwardIterator2 __result);
197 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Tp>
199 fill_n(_ExecutionPolicy&& __exec, _ForwardIterator __first, _Size __count, const _Tp& __value);
206 template <class _ExecutionPolicy, class _ForwardIterator, class _Size, class _Generator>
[all …]
H A Dalgorithm_impl.h80 template <class _ForwardIterator, class _Size, class _Function>
82 __for_each_n_it_serial(_ForwardIterator __first, _Size __n, _Function __f) in __for_each_n_it_serial()
159 template <class _ForwardIterator, class _Size, class _Function>
202 _Size __n, _Brick __brick) in __pattern_walk_brick_n()
298 _Size __n, _RandomAccessIterator2 __first2, _Function __f) in __pattern_walk2_n()
858 if (static_cast<_Size>(__last - __first) == __count) in __pattern_search_n()
884 template <class _ForwardIterator, class _Size, class _OutputIterator>
2537 template <class _RandomAccessIterator, class _Size, class _Tp>
2545 template <class _OutputIterator, class _Size, class _Tp>
2562 _Size __count, const _Tp& __value) in __pattern_fill_n()
[all …]
/llvm-project-15.0.7/libcxx/include/__type_traits/
H A Dtype_list.h28 template <class _TypeList, size_t _Size, bool = _Size <= sizeof(typename _TypeList::_Head)> struct …
30 template <class _Hp, class _Tp, size_t _Size>
31 struct __find_first<__type_list<_Hp, _Tp>, _Size, true>
36 template <class _Hp, class _Tp, size_t _Size>
37 struct __find_first<__type_list<_Hp, _Tp>, _Size, false>
39 typedef _LIBCPP_NODEBUG typename __find_first<_Tp, _Size>::type type;
/llvm-project-15.0.7/libcxx/include/__concepts/
H A Dswappable.h47 template<class _Tp, class _Up, size_t _Size>
49 !__unqualified_swappable_with<_Tp(&)[_Size], _Up(&)[_Size]> &&
51 requires(_Tp(& __t)[_Size], _Up(& __u)[_Size], const __fn& __swap) {
73 template<class _Tp, class _Up, size_t _Size>
74 requires __swappable_arrays<_Tp, _Up, _Size>
75 constexpr void operator()(_Tp(& __t)[_Size], _Up(& __u)[_Size]) const in operator()
79 for (size_t __i = 0; __i < _Size; ++__i) { in operator()
/llvm-project-15.0.7/pstl/include/pstl/internal/omp/
H A Dutil.h107 template <class _RandomAccessIterator, class _Size = std::size_t>
110 _Size __requested_chunk_size = __default_chunk_size) -> __chunk_metrics
120 const _Size __n = __last - __first;
121 _Size __n_chunks = 0;
122 _Size __chunk_size = 0;
123 _Size __first_chunk_size = 0;
135 const _Size __n_leftover_items = __n - (__n_chunks * __chunk_size);
148 const _Size __n_extra_items_per_chunk = __n_leftover_items / __n_chunks;
149 …const _Size __n_final_leftover_items = __n_leftover_items - (__n_extra_items_per_chunk * __n_chunk…
/llvm-project-15.0.7/libcxx/include/__memory/
H A Duninitialized_algorithms.h79 __uninitialized_copy_n(_InputIterator __ifirst, _Size __n, in __uninitialized_copy_n()
97 template <class _InputIterator, class _Size, class _ForwardIterator>
141 template <class _ValueType, class _ForwardIterator, class _Size, class _Tp>
164 template <class _ForwardIterator, class _Size, class _Tp>
205 template <class _ValueType, class _ForwardIterator, class _Size>
224 template <class _ForwardIterator, class _Size>
262 template <class _ValueType, class _ForwardIterator, class _Size>
281 template <class _ForwardIterator, class _Size>
327 __uninitialized_move_n(_InputIterator __ifirst, _Size __n, in __uninitialized_move_n()
345 template <class _InputIterator, class _Size, class _ForwardIterator>
[all …]
H A Dallocation_guard.h46 using _Size = typename allocator_traits<_Alloc>::size_type; member
50 explicit __allocation_guard(_AllocT __alloc, _Size __n) in __allocation_guard()
77 _Size __n_;
H A Dconstruct_at.h105 template <class _ForwardIterator, class _Size>
107 _ForwardIterator destroy_n(_ForwardIterator __first, _Size __n) { in destroy_n()
/llvm-project-15.0.7/libcxx/include/__format/
H A Dformatter_string.h94 template <__formatter::__char_type _CharT, size_t _Size>
95 struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<_CharT[_Size], _CharT>
99 …_LIBCPP_HIDE_FROM_ABI auto format(_CharT __str[_Size], auto& __ctx) const -> decltype(__ctx.out())…
100 return _Base::format(basic_string_view<_CharT>(__str, _Size), __ctx);
105 template <__formatter::__char_type _CharT, size_t _Size>
106 struct _LIBCPP_TEMPLATE_VIS _LIBCPP_AVAILABILITY_FORMAT formatter<const _CharT[_Size], _CharT>
110 …_LIBCPP_HIDE_FROM_ABI auto format(const _CharT __str[_Size], auto& __ctx) const -> decltype(__ctx.…
111 return _Base::format(basic_string_view<_CharT>(__str, _Size), __ctx);
H A Dbuffer.h280 using _Size = iter_difference_t<_OutIt>;
283 _LIBCPP_HIDE_FROM_ABI explicit __format_to_n_buffer_base(_OutIt __out_it, _Size __n)
284 : __writer_(_VSTD::move(__out_it)), __n_(_VSTD::max(_Size(0), __n)) {}
287 if (_Size(__size_) <= __n_)
288 __writer_.flush(__ptr, _VSTD::min(_Size(__size), __n_ - __size_));
297 _Size __n_;
298 _Size __size_{0};
310 using _Size = iter_difference_t<_OutIt>;
313 _LIBCPP_HIDE_FROM_ABI explicit __format_to_n_buffer_base(_OutIt __out_it, _Size __n)
341 _Size __size_{0};
[all …]
/llvm-project-15.0.7/libcxx/include/__algorithm/
H A Dfill_n.h24 template <class _OutputIterator, class _Size, class _Tp>
27 __fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) in __fill_n()
34 template <class _OutputIterator, class _Size, class _Tp>
37 fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) in fill_n()
H A Dcopy_n.h23 template<class _InputIterator, class _Size, class _OutputIterator>
31 copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) in copy_n()
49 template<class _InputIterator, class _Size, class _OutputIterator>
56 copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) in copy_n()
H A Dgenerate_n.h21 template <class _OutputIterator, class _Size, class _Generator>
24 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 … _Size __orig_n, in for_each_n()
H A Dsearch_n.h160 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
163 _Size __count, in search_n()
172 template <class _ForwardIterator, class _Size, class _Tp>
174 _ForwardIterator search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _… in search_n()
/llvm-project-15.0.7/libcxx/include/__compare/
H A Dcommon_comparison_category.h46 template <size_t _Size>
49 __compute_comp_type(const _ClassifyCompCategory (&__types)[_Size]) { in __compute_comp_type() argument
/llvm-project-15.0.7/libcxx/benchmarks/
H A Dunordered_set_operations.bench.cpp18 template <class _Size>
20 _Size loadword(const void* __p) { in loadword()
21 _Size __r; in loadword()

12