| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | search_n.h | 39 return std::make_pair(__first, __first); in __search_n_forward_impl()
45 return std::make_pair(__first, __first); in __search_n_forward_impl()
49 ++__first; in __search_n_forward_impl()
59 return std::make_pair(__first, __first); in __search_n_forward_impl()
66 ++__first; in __search_n_forward_impl()
83 return std::make_pair(__first, __first); in __search_n_random_access_impl()
86 return std::make_pair(__first, __first); in __search_n_random_access_impl()
95 return std::make_pair(__first, __first); in __search_n_random_access_impl()
99 ++__first; in __search_n_random_access_impl()
106 return std::make_pair(__first, __first + _DiffT(__count)); in __search_n_random_access_impl()
[all …]
|
| H A D | rotate.h | 37 _Ops::next(__first), __last, __first).second; in __rotate_left()
52 *__first = _VSTD::move(__tmp); in __rotate_right()
64 ++__first; in __rotate_forward()
67 if (__first == __middle) in __rotate_forward()
70 _ForwardIterator __r = __first; in __rotate_forward()
71 if (__first != __middle) in __rotate_forward()
77 ++__first; in __rotate_forward()
80 if (__first == __middle) in __rotate_forward()
121 for (_RandomAccessIterator __p = __first + __g; __p != __first;) in __rotate_gcd()
138 return __first + __m2; in __rotate_gcd()
[all …]
|
| H A D | stable_partition.h | 37 return __first; in __stable_partition_impl()
46 return __first; in __stable_partition_impl()
65 ++__first; in __stable_partition_impl()
76 __i = __first; in __stable_partition_impl()
80 return __first; in __stable_partition_impl()
126 return __first; in __stable_partition_impl()
129 ++__first; in __stable_partition_impl()
195 ++__first; in __stable_partition_impl()
206 __i = ++__first; in __stable_partition_impl()
212 return __first; in __stable_partition_impl()
[all …]
|
| H A D | partition.h | 31 if (__first == __last) in __partition_impl()
32 return std::make_pair(std::move(__first), std::move(__first)); in __partition_impl()
33 if (!__pred(*__first)) in __partition_impl()
35 ++__first; in __partition_impl()
38 _ForwardIterator __p = __first; in __partition_impl()
44 ++__first; in __partition_impl()
62 if (__first == __last) in __partition_impl()
64 if (!__pred(*__first)) in __partition_impl()
66 ++__first; in __partition_impl()
70 if (__first == --__last) in __partition_impl()
[all …]
|
| H A D | unique_copy.h | 43 if (__first != __last) { in __unique_copy()
47 while (++__first != __last) { in __unique_copy()
49 __t = *__first; in __unique_copy()
65 if (__first != __last) { in __unique_copy()
69 while (++__first != __last) { in __unique_copy()
71 *__result = *__first; in __unique_copy()
73 __i = __first; in __unique_copy()
87 if (__first != __last) { in __unique_copy()
88 *__result = *__first; in __unique_copy()
89 while (++__first != __last) in __unique_copy()
[all …]
|
| H A D | minmax_element.h | 46 pair<_Iter, _Iter> __result(__first, __first); in __minmax_element_impl()
47 if (__first == __last || ++__first == __last) in __minmax_element_impl()
51 __result.first = __first; in __minmax_element_impl()
53 __result.second = __first; in __minmax_element_impl()
55 while (++__first != __last) { in __minmax_element_impl()
56 _Iter __i = __first; in __minmax_element_impl()
57 if (++__first == __last) { in __minmax_element_impl()
65 if (__less(__first, __i)) { in __minmax_element_impl()
67 __result.first = __first; in __minmax_element_impl()
74 __result.second = __first; in __minmax_element_impl()
[all …]
|
| H A D | nth_element.h | 57 difference_type __len = __last - __first; in __nth_element()
64 if (__comp(*--__last, *__first)) in __nth_element()
65 _Ops::iter_swap(__first, __last); in __nth_element()
69 _RandomAccessIterator __m = __first; in __nth_element()
80 _RandomAccessIterator __m = __first + __len/2; in __nth_element()
86 _RandomAccessIterator __i = __first; in __nth_element()
120 while (!__comp(*__first, *__i)) in __nth_element()
122 while (__comp(*__first, *--__j)) in __nth_element()
137 __first = __i; in __nth_element()
181 __j = __m = __first; in __nth_element()
[all …]
|
| H A D | unique.h | 30 __unique(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) { in __unique() argument
31 __first = std::__adjacent_find(__first, __last, __pred); in __unique()
32 if (__first != __last) { in __unique()
35 _Iter __i = __first; in __unique()
37 if (!__pred(*__first, *__i)) in __unique()
38 *++__first = _IterOps<_AlgPolicy>::__iter_move(__i); in __unique()
39 ++__first; in __unique()
40 return std::pair<_Iter, _Iter>(std::move(__first), std::move(__i)); in __unique()
42 return std::pair<_Iter, _Iter>(__first, __first); in __unique()
53 unique(_ForwardIterator __first, _ForwardIterator __last) { in unique() argument
[all …]
|
| H A D | reverse.h | 29 while (__first != __last) in __reverse_impl()
31 if (__first == --__last) in __reverse_impl()
33 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __reverse_impl()
34 ++__first; in __reverse_impl()
43 if (__first != __last) in __reverse_impl()
44 for (; __first < --__last; ++__first) in __reverse_impl()
45 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __reverse_impl()
50 void __reverse(_BidirectionalIterator __first, _Sentinel __last) { in __reverse() argument
52 std::__reverse_impl<_AlgPolicy>(std::move(__first), std::move(__last), _IterCategory()); in __reverse()
58 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) in reverse() argument
[all …]
|
| H A D | shuffle.h | 97 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) in random_shuffle() argument
102 difference_type __d = __last - __first; in random_shuffle()
107 for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) in random_shuffle()
111 swap(*__first, *(__first + __i)); in random_shuffle()
126 difference_type __d = __last - __first; in random_shuffle()
129 for (--__last; __first < __last; ++__first, (void) --__d) in random_shuffle()
133 swap(*__first, *(__first + __i)); in random_shuffle()
148 difference_type __d = __last - __first; in __shuffle()
152 for (--__last, (void) --__d; __first < __last; ++__first, (void) --__d) in __shuffle()
156 _IterOps<_AlgPolicy>::iter_swap(__first, __first + __i); in __shuffle()
[all …]
|
| H A D | partial_sort.h | 34 …_RandomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare&& __comp… in __partial_sort_impl() argument
35 if (__first == __middle) { in __partial_sort_impl()
39 std::__make_heap<_AlgPolicy>(__first, __middle, __comp); in __partial_sort_impl()
41 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; in __partial_sort_impl()
45 if (__comp(*__i, *__first)) in __partial_sort_impl()
47 _IterOps<_AlgPolicy>::iter_swap(__i, __first); in __partial_sort_impl()
48 std::__sift_down<_AlgPolicy>(__first, __comp, __len, __first); in __partial_sort_impl()
52 std::__sort_heap<_AlgPolicy>(std::move(__first), std::move(__middle), __comp); in __partial_sort_impl()
61 if (__first == __middle) in __partial_sort()
64 std::__debug_randomize_range<_AlgPolicy>(__first, __last); in __partial_sort()
[all …]
|
| H A D | min_element.h | 29 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) { in __min_element() argument
30 if (__first == __last) in __min_element()
31 return __first; in __min_element()
33 _Iter __i = __first; in __min_element()
36 __first = __i; in __min_element()
38 return __first; in __min_element()
43 _Iter __min_element(_Iter __first, _Sent __last, _Comp __comp) { in __min_element() argument
50 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) in min_element() argument
54 static_assert(__is_callable<_Compare, decltype(*__first), decltype(*__first)>::value, in min_element()
63 min_element(_ForwardIterator __first, _ForwardIterator __last) in min_element() argument
[all …]
|
| /llvm-project-15.0.7/libcxx/include/__random/ |
| H A D | seed_seq.h | 50 __init(__first, __last); in seed_seq()
90 if (__first != __last) in generate()
105 result_type __r = 1664525 * _Tp(__first[0] ^ __first[__p] in generate()
107 __first[__p] += __r; in generate()
109 __first[__q] += __r; in generate()
110 __first[0] = __r; in generate()
130 result_type __r = 1664525 * _Tp(__first[__kmodn] ^ __first[__kpmodn] ^ __first[__k1modn]); in generate()
134 __first[__kmodn] = __r; in generate()
147 result_type __r = 1664525 * _Tp(__first[__kmodn] ^ __first[__kpmodn] ^ __first[__k1modn]); in generate()
151 __first[__kmodn] = __r; in generate()
[all …]
|
| /llvm-project-15.0.7/libcxx/include/__charconv/ |
| H A D | to_chars_base_10.h | 33 *__first = '0' + static_cast<char>(__value); in __append1()
34 return __first + 1; in __append1()
82 return __itoa::__append2(__first, __value); in __base_10_u32()
86 return __itoa::__append3(__first, __value); in __base_10_u32()
87 return __itoa::__append4(__first, __value); in __base_10_u32()
92 return __itoa::__append5(__first, __value); in __base_10_u32()
93 return __itoa::__append6(__first, __value); in __base_10_u32()
100 return __itoa::__append7(__first, __value); in __base_10_u32()
101 return __itoa::__append8(__first, __value); in __base_10_u32()
106 return __itoa::__append9(__first, __value); in __base_10_u32()
[all …]
|
| /llvm-project-15.0.7/pstl/include/pstl/internal/ |
| H A D | algorithm_impl.h | 533 __first, _SizeType(0), __last - __first, in __brick_find_if()
918 __first, __last - __first, __result, in __brick_copy()
939 __first, __last - __first, __result, in __brick_move()
1032 for (; __first != __last; ++__first, ++__mask) in __brick_calc_mask_1()
1057 for (; __first != __last; ++__first, ++__mask) in __brick_copy_by_mask()
1084 for (; __first != __last; ++__first, ++__mask) in __brick_partition_by_mask()
1386 for (; __first != __last; ++__first, ++__mask) in __brick_calc_mask_2()
1388 *__mask = !__pred(*__first, *(__first - 1)); in __brick_calc_mask_2()
3455 __first, _SizeType(0), __last - __first, in __brick_is_heap_until()
3613 return std::make_pair(__first, __first); in __pattern_minmax_element()
[all …]
|
| H A D | unseq_backend_simd.h | 37 __f(__first[__i]); in __simd_walk_1()
39 return __first + __n; in __simd_walk_1()
246 if (!__pred(__first[__i], __first[__i - 1])) in __simd_unique_copy()
294 __mask[__i] = !__pred(__first[__i], __first[__i - 1]); in __simd_calc_mask_2()
396 if (__pred(__first[__i], __first[__i + 1])) in __simd_adjacent_find()
419 if (__first + __block_size < __last && __pred(*(__first + __i), *(__first + __i + 1))) in __simd_adjacent_find()
436 for (; __last - __first > 1; ++__first) in __simd_adjacent_find()
437 if (__pred(*__first, *(__first + 1))) in __simd_adjacent_find()
679 return std::make_pair(__first, __first); in __simd_minmax_element()
732 _ComplexType __init{*__first, *__first, &__comp}; in __simd_minmax_element()
[all …]
|
| H A D | glue_algorithm_impl.h | 35 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first); in any_of()
65 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first); in for_each()
74 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first); in for_each_n()
86 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first); in find_if()
103 return std::find_if(std::forward<_ExecutionPolicy>(__exec), __first, __last, in find()
154 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first); in adjacent_find()
165 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first); in adjacent_find()
360 std::replace_if(std::forward<_ExecutionPolicy>(__exec), __first, __last, in replace()
405 return __first; in fill_n()
429 return __first; in generate_n()
[all …]
|
| H A D | numeric_impl.h | 163 for (; __first != __last; ++__first, ++__result) in __brick_transform_scan()
179 for (; __first != __last; ++__first, ++__result) in __brick_transform_scan()
203 …return __unseq_backend::__simd_scan(__first, __last - __first, __result, __unary_op, __init, __bin… in __brick_transform_scan()
251 … [__first, __unary_op](_DifferenceType __i) mutable { return __unary_op(__first[__i]); }, __init, in __pattern_transform_scan()
256 … return __internal::__brick_transform_reduce(__first + __i, __first + __j, __init, __binary_op, in __pattern_transform_scan()
331 _PSTL_ASSERT(__first != __last); in __brick_adjacent_difference()
336 auto __n = __last - __first; in __brick_adjacent_difference()
337 *__d_first = *__first; in __brick_adjacent_difference()
339 __first + 1, __n - 1, __first, __d_first + 1, in __brick_adjacent_difference()
358 _PSTL_ASSERT(__first != __last); in __pattern_adjacent_difference()
[all …]
|
| H A D | memory_impl.h | 31 __brick_uninitialized_move(_ForwardIterator __first, _ForwardIterator __last, _OutputIterator __res… in __brick_uninitialized_move() argument
35 for (; __first != __last; ++__first, ++__result) in __brick_uninitialized_move()
37 ::new (std::addressof(*__result)) _ValueType(std::move(*__first)); in __brick_uninitialized_move()
52 __first, __last - __first, __result, in __brick_uninitialized_move()
58 __brick_destroy(_Iterator __first, _Iterator __last, /*vector*/ std::false_type) noexcept in __brick_destroy() argument
62 for (; __first != __last; ++__first) in __brick_destroy()
63 __first->~_ValueType(); in __brick_destroy()
73 …__unseq_backend::__simd_walk_1(__first, __last - __first, [](_ReferenceType __x) { __x.~_ValueType… in __brick_destroy()
86 for (; __first != __last; ++__first, ++__result) in __brick_uninitialized_copy()
88 ::new (std::addressof(*__result)) _ValueType(*__first); in __brick_uninitialized_copy()
[all …]
|
| H A D | glue_numeric_impl.h | 30 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init, in reduce() argument
39 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last, _Tp __init) in reduce() argument
48 reduce(_ExecutionPolicy&& __exec, _ForwardIterator __first, _ForwardIterator __last) in reduce() argument
87 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first); in transform_reduce()
99 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result); in exclusive_scan()
112 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result); in exclusive_scan()
159 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result); in transform_exclusive_scan()
175 auto __dispatch_tag = __pstl::__internal::__select_backend(__exec, __first, __result); in transform_inclusive_scan()
188 if (__first != __last) in transform_inclusive_scan()
190 auto __tmp = __unary_op(*__first); in transform_inclusive_scan()
[all …]
|
| /llvm-project-15.0.7/libcxx/include/__numeric/ |
| H A D | partial_sum.h | 26 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in partial_sum() argument
28 if (__first != __last) in partial_sum()
30 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
32 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result) in partial_sum()
35 __t = _VSTD::move(__t) + *__first; in partial_sum()
37 __t = __t + *__first; in partial_sum()
51 if (__first != __last) in partial_sum()
53 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
55 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result) in partial_sum()
58 __t = __binary_op(_VSTD::move(__t), *__first); in partial_sum()
[all …]
|
| H A D | adjacent_difference.h | 26 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result) in adjacent_difference() argument
28 if (__first != __last) in adjacent_difference()
30 typename iterator_traits<_InputIterator>::value_type __acc(*__first); in adjacent_difference()
32 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result) in adjacent_difference()
34 typename iterator_traits<_InputIterator>::value_type __val(*__first); in adjacent_difference()
49 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result, in adjacent_difference() argument
52 if (__first != __last) in adjacent_difference()
54 typename iterator_traits<_InputIterator>::value_type __acc(*__first); in adjacent_difference()
56 for (++__first, (void) ++__result; __first != __last; ++__first, (void) ++__result) in adjacent_difference()
58 typename iterator_traits<_InputIterator>::value_type __val(*__first); in adjacent_difference()
|
| /llvm-project-15.0.7/libcxx/src/ |
| H A D | charconv.cpp | 45 to_chars_result to_chars(char* __first, char* __last, float __value) { in to_chars() argument
46 …return _Floating_to_chars<_Floating_to_chars_overload::_Plain>(__first, __last, __value, chars_for… in to_chars()
49 to_chars_result to_chars(char* __first, char* __last, double __value) { in to_chars() argument
53 to_chars_result to_chars(char* __first, char* __last, long double __value) { in to_chars() argument
58 to_chars_result to_chars(char* __first, char* __last, float __value, chars_format __fmt) { in to_chars() argument
59 …return _Floating_to_chars<_Floating_to_chars_overload::_Format_only>(__first, __last, __value, __f… in to_chars()
62 to_chars_result to_chars(char* __first, char* __last, double __value, chars_format __fmt) { in to_chars() argument
63 …return _Floating_to_chars<_Floating_to_chars_overload::_Format_only>(__first, __last, __value, __f… in to_chars()
66 to_chars_result to_chars(char* __first, char* __last, long double __value, chars_format __fmt) { in to_chars() argument
71 to_chars_result to_chars(char* __first, char* __last, float __value, chars_format __fmt, int __prec… in to_chars() argument
[all …]
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | __bit_reference | 186 if (__first.__ctz_ != 0)
197 ++__first.__seg_;
201 if (*__first.__seg_)
222 if (__first.__ctz_ != 0)
233 ++__first.__seg_;
275 if (__first.__ctz_ != 0)
282 ++__first.__seg_;
306 if (__first.__ctz_ != 0)
313 ++__first.__seg_;
354 ++__first.__seg_;
[all …]
|
| /llvm-project-15.0.7/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 120 : __first_(__first), in __first_() argument
130 ++__first; in __first_()
142 if (__first == __last) in operator()
145 return std::make_pair(__first, __first); in operator()
193 while (__k > 0 && !__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
196 if (__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
247 : __first_(__first), in __first_() argument
252 if (__first == __last) in __first_()
258 ++__first; in __first_()
269 if (__first == __last) in operator()
[all …]
|