| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | search_n.h | 37 return std::make_pair(__first, __first); in __search_n_forward_impl()
43 return std::make_pair(__first, __first); in __search_n_forward_impl()
47 ++__first; in __search_n_forward_impl()
57 return std::make_pair(__first, __first); in __search_n_forward_impl()
63 ++__first; in __search_n_forward_impl()
75 return std::make_pair(__first, __first); in __search_n_random_access_impl()
78 return std::make_pair(__first, __first); in __search_n_random_access_impl()
87 return std::make_pair(__first, __first); in __search_n_random_access_impl()
91 ++__first; in __search_n_random_access_impl()
98 return std::make_pair(__first, __first + _DiffT(__count)); in __search_n_random_access_impl()
[all …]
|
| H A D | sort.h | 273 for (--__lm1; __first != __lm1; ++__first) {
359 __first, __first + difference_type(1), __first + difference_type(2), --__last, __comp);
363 __first,
520 ++__first;
549 ++__first;
555 while (++__first < __last && !__comp(__pivot, *__first)) {
576 ++__first;
640 ++__first;
785 __first, __first + difference_type(1), __first + difference_type(2), --__last, __comp);
823 __first + (__half_len - 1), __first + __half_len, __first + (__half_len + 1), __comp);
[all …]
|
| H A D | rotate.h | 38 _ForwardIterator __lm1 = std::__move<_AlgPolicy>(_Ops::next(__first), __last, __first).second; in __rotate_left()
62 ++__first; in __rotate_forward()
65 if (__first == __middle) in __rotate_forward()
68 _ForwardIterator __r = __first; in __rotate_forward()
69 if (__first != __middle) { in __rotate_forward()
73 ++__first; in __rotate_forward()
75 if (__first == __middle) in __rotate_forward()
109 for (_RandomAccessIterator __p = __first + __g; __p != __first;) { in __rotate_gcd()
124 return __first + __m2; in __rotate_gcd()
156 _RandomAccessIterator __first, in __rotate_impl() argument
[all …]
|
| H A D | stable_partition.h | 47 return __first; in __stable_partition_impl()
54 return __first; in __stable_partition_impl()
70 ++__first; in __stable_partition_impl()
79 __i = __first; in __stable_partition_impl()
83 return __first; in __stable_partition_impl()
127 return __first; in __stable_partition_impl()
130 ++__first; in __stable_partition_impl()
190 ++__first; in __stable_partition_impl()
205 return __first; in __stable_partition_impl()
259 return __first; in __stable_partition_impl()
[all …]
|
| H A D | find.h | 47 for (; __first != __last; ++__first) in __find_impl()
48 if (std::__invoke(__proj, *__first) == __value) in __find_impl()
50 return __first; in __find_impl()
62 if (auto __ret = std::__constexpr_memchr(__first, __value, __last - __first)) in __find_impl()
76 if (auto __ret = std::__constexpr_wmemchr(__first, __value, __last - __first)) in __find_impl()
107 if (__first.__ctz_ != 0) { in __find_bool()
115 return __first + __n; in __find_bool()
117 ++__first.__seg_; in __find_bool()
139 return std::__find_bool<true>(__first, static_cast<typename _Cp::size_type>(__last - __first)); in __find_impl()
140 return std::__find_bool<false>(__first, static_cast<typename _Cp::size_type>(__last - __first)); in __find_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()
42 ++__first; in __partition_impl()
56 if (__first == __last) in __partition_impl()
58 if (!__pred(*__first)) in __partition_impl()
60 ++__first; in __partition_impl()
63 if (__first == --__last) in __partition_impl()
[all …]
|
| H A D | unique_copy.h | 46 if (__first != __last) { in __unique_copy()
50 while (++__first != __last) { in __unique_copy()
52 __t = *__first; in __unique_copy()
68 if (__first != __last) { in __unique_copy()
72 while (++__first != __last) { in __unique_copy()
74 *__result = *__first; in __unique_copy()
76 __i = __first; in __unique_copy()
90 if (__first != __last) { in __unique_copy()
91 *__result = *__first; in __unique_copy()
92 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()
50 if (__less(__first, __result.first)) 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()
[all …]
|
| H A D | nth_element.h | 64 if (__comp(*--__last, *__first)) in __nth_element()
65 _Ops::iter_swap(__first, __last); in __nth_element()
68 _RandomAccessIterator __m = __first; in __nth_element()
84 _RandomAccessIterator __i = __first; in __nth_element()
118 while (!__comp(*__first, *__i)) { in __nth_element()
126 __j != __first, in __nth_element()
129 } while (__comp(*__first, *__j)); in __nth_element()
143 __first = __i; in __nth_element()
163 __j != __first, in __nth_element()
190 __j = __m = __first; in __nth_element()
[all …]
|
| H A D | unique.h | 33 __unique(_Iter __first, _Sent __last, _BinaryPredicate&& __pred) { in __unique() argument
34 __first = std::__adjacent_find(__first, __last, __pred); in __unique()
35 if (__first != __last) { in __unique()
38 _Iter __i = __first; in __unique()
40 if (!__pred(*__first, *__i)) in __unique()
41 *++__first = _IterOps<_AlgPolicy>::__iter_move(__i); in __unique()
42 ++__first; in __unique()
43 return std::pair<_Iter, _Iter>(std::move(__first), std::move(__i)); in __unique()
45 return std::pair<_Iter, _Iter>(__first, __first); in __unique()
56 unique(_ForwardIterator __first, _ForwardIterator __last) { in unique() argument
[all …]
|
| H A D | count.h | 35 __count(_Iter __first, _Sent __last, const _Tp& __value, _Proj& __proj) { in __count() argument
37 for (; __first != __last; ++__first) in __count()
38 if (std::__invoke(__proj, *__first) == __value) in __count()
54 if (__first.__ctz_ != 0) { in __count_bool()
60 ++__first.__seg_; in __count_bool()
63 for (; __n >= __bits_per_word; ++__first.__seg_, __n -= __bits_per_word) in __count_bool()
64 __r += std::__libcpp_popcount(std::__invert_if<!_ToCount>(*__first.__seg_)); in __count_bool()
77 return std::__count_bool<true>(__first, static_cast<typename _Cp::size_type>(__last - __first)); in __count()
78 return std::__count_bool<false>(__first, static_cast<typename _Cp::size_type>(__last - __first)); in __count()
83 count(_InputIterator __first, _InputIterator __last, const _Tp& __value) { in count() argument
[all …]
|
| H A D | reverse.h | 30 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()
40 __reverse_impl(_RandomAccessIterator __first, _RandomAccessIterator __last, random_access_iterator_… in __reverse_impl() argument
41 if (__first != __last) in __reverse_impl()
42 for (; __first < --__last; ++__first) in __reverse_impl()
43 _IterOps<_AlgPolicy>::iter_swap(__first, __last); in __reverse_impl()
49 std::__reverse_impl<_AlgPolicy>(std::move(__first), std::move(__last), _IterCategory()); in __reverse()
54 reverse(_BidirectionalIterator __first, _BidirectionalIterator __last) { in reverse() argument
[all …]
|
| H A D | shuffle.h | 96 random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last) { in random_shuffle() argument
100 difference_type __d = __last - __first; in random_shuffle()
104 for (--__last, (void)--__d; __first < __last; ++__first, (void)--__d) { in random_shuffle()
107 swap(*__first, *(__first + __i)); in random_shuffle()
114 random_shuffle(_RandomAccessIterator __first, in random_shuffle() argument
123 difference_type __d = __last - __first; in random_shuffle()
125 for (--__last; __first < __last; ++__first, (void)--__d) { in random_shuffle()
128 swap(*__first, *(__first + __i)); in random_shuffle()
143 difference_type __d = __last - __first; in __shuffle()
146 for (--__last, (void)--__d; __first < __last; ++__first, (void)--__d) { in __shuffle()
[all …]
|
| H A D | partial_sort.h | 36 …_RandomAccessIterator __first, _RandomAccessIterator __middle, _Sentinel __last, _Compare&& __comp… in __partial_sort_impl() argument
37 if (__first == __middle) { in __partial_sort_impl()
41 std::__make_heap<_AlgPolicy>(__first, __middle, __comp); in __partial_sort_impl()
43 typename iterator_traits<_RandomAccessIterator>::difference_type __len = __middle - __first; in __partial_sort_impl()
46 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()
51 std::__sort_heap<_AlgPolicy>(std::move(__first), std::move(__middle), __comp); in __partial_sort_impl()
59 if (__first == __middle) in __partial_sort()
62 std::__debug_randomize_range<_AlgPolicy>(__first, __last); in __partial_sort()
[all …]
|
| H A D | min_element.h | 32 __min_element(_Iter __first, _Sent __last, _Comp __comp, _Proj& __proj) { in __min_element() argument
33 if (__first == __last) in __min_element()
34 return __first; in __min_element()
36 _Iter __i = __first; in __min_element()
39 __first = __i; in __min_element()
41 return __first; in __min_element()
47 return std::__min_element<_Comp>(std::move(__first), std::move(__last), __comp, __proj); in __min_element()
52 min_element(_ForwardIterator __first, _ForwardIterator __last, _Compare __comp) { in min_element() argument
56 …__is_callable<_Compare, decltype(*__first), decltype(*__first)>::value, "The comparator has to be … in min_element()
63 min_element(_ForwardIterator __first, _ForwardIterator __last) { in min_element() argument
[all …]
|
| H A D | copy.h | 39 while (__first != __last) { in operator()
40 *__result = *__first; in operator()
41 ++__first; in operator()
45 return std::make_pair(std::move(__first), std::move(__result)); in operator()
80 if (__first == __last) in operator()
88 auto __iters = std::__copy<_AlgPolicy>(__first, __first + __size, __local_first); in operator()
89 __first = std::move(__iters.first); in operator()
91 if (__first == __last) in operator()
103 operator()(_In* __first, _In* __last, _Out* __result) const { in operator()
104 return std::__copy_trivial_impl(__first, __last, __result); in operator()
[all …]
|
| H A D | move.h | 34 __move(_InIter __first, _Sent __last, _OutIter __result);
41 while (__first != __last) { in operator()
42 *__result = _IterOps<_AlgPolicy>::__iter_move(__first); in operator()
43 ++__first; in operator()
81 if (__first == __last) in operator()
89 auto __iters = std::__move<_AlgPolicy>(__first, __first + __size, __local_first); in operator()
90 __first = std::move(__iters.first); in operator()
92 if (__first == __last) in operator()
104 operator()(_In* __first, _In* __last, _Out* __result) const { in operator()
105 return std::__copy_trivial_impl(__first, __last, __result); in operator()
[all …]
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__random/ |
| H A D | seed_seq.h | 48 __init(__first, __last); in seed_seq()
82 if (__first != __last) { in generate()
92 result_type __r = 1664525 * _Tp(__first[0] ^ __first[__p] ^ __first[__n - 1]); in generate()
93 __first[__p] += __r; in generate()
95 __first[__q] += __r; in generate()
96 __first[0] = __r; in generate()
115 result_type __r = 1664525 * _Tp(__first[__kmodn] ^ __first[__kpmodn] ^ __first[__k1modn]); in generate()
119 __first[__kmodn] = __r; in generate()
131 result_type __r = 1664525 * _Tp(__first[__kmodn] ^ __first[__kpmodn] ^ __first[__k1modn]); in generate()
135 __first[__kmodn] = __r; in generate()
[all …]
|
| /freebsd-14.2/contrib/llvm-project/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()
83 return __itoa::__append2(__first, __value); in __base_10_u32()
87 return __itoa::__append3(__first, __value); in __base_10_u32()
88 return __itoa::__append4(__first, __value); in __base_10_u32()
93 return __itoa::__append5(__first, __value); in __base_10_u32()
94 return __itoa::__append6(__first, __value); in __base_10_u32()
101 return __itoa::__append7(__first, __value); in __base_10_u32()
102 return __itoa::__append8(__first, __value); in __base_10_u32()
107 return __itoa::__append9(__first, __value); in __base_10_u32()
[all …]
|
| H A D | to_chars_integral.h | 52 if (__value < 0 && __first != __last) { in __to_chars_itoa()
53 *__first++ = '-'; in __to_chars_itoa()
64 auto __diff = __last - __first; in __to_chars_itoa()
84 auto __diff = __last - __first; in __to_chars_itoa()
102 *__first++ = '-'; in __to_chars_integral()
127 ptrdiff_t __cap = __last - __first;
163 ptrdiff_t __cap = __last - __first;
168 __last = __first + __n;
213 if (__first != __last)
288 ptrdiff_t __cap = __last - __first;
[all …]
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__numeric/ |
| H A D | partial_sum.h | 28 partial_sum(_InputIterator __first, _InputIterator __last, _OutputIterator __result) { in partial_sum() argument
29 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()
34 __t = std::move(__t) + *__first; in partial_sum()
36 __t = __t + *__first; in partial_sum()
47 if (__first != __last) { in partial_sum()
48 typename iterator_traits<_InputIterator>::value_type __t(*__first); in partial_sum()
50 for (++__first, (void)++__result; __first != __last; ++__first, (void)++__result) { in partial_sum()
52 __t = __binary_op(std::move(__t), *__first); in partial_sum()
[all …]
|
| H A D | adjacent_difference.h | 28 adjacent_difference(_InputIterator __first, _InputIterator __last, _OutputIterator __result) { in adjacent_difference() argument
29 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()
33 typename iterator_traits<_InputIterator>::value_type __val(*__first); in adjacent_difference()
47 …_InputIterator __first, _InputIterator __last, _OutputIterator __result, _BinaryOperation __binary… in adjacent_difference() argument
48 if (__first != __last) { in adjacent_difference()
49 typename iterator_traits<_InputIterator>::value_type __acc(*__first); in adjacent_difference()
51 for (++__first, (void)++__result; __first != __last; ++__first, (void)++__result) { in adjacent_difference()
52 typename iterator_traits<_InputIterator>::value_type __val(*__first); in adjacent_difference()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/src/ |
| H A D | charconv.cpp | 36 to_chars_result to_chars(char* __first, char* __last, float __value) { in to_chars() argument
40 to_chars_result to_chars(char* __first, char* __last, double __value) { in to_chars() argument
44 to_chars_result to_chars(char* __first, char* __last, long double __value) { in to_chars() argument
46 __first, __last, static_cast<double>(__value), chars_format{}, 0); in to_chars()
49 to_chars_result to_chars(char* __first, char* __last, float __value, chars_format __fmt) { in to_chars() argument
53 to_chars_result to_chars(char* __first, char* __last, double __value, chars_format __fmt) { in to_chars() argument
57 to_chars_result to_chars(char* __first, char* __last, long double __value, chars_format __fmt) { in to_chars() argument
59 __first, __last, static_cast<double>(__value), __fmt, 0); in to_chars()
64 __first, __last, __value, __fmt, __precision); in to_chars()
69 __first, __last, __value, __fmt, __precision); in to_chars()
[all …]
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__debug_utils/ |
| H A D | strict_weak_ordering_check.h | 28 __check_strict_weak_ordering_sorted(_RandomAccessIterator __first, _RandomAccessIterator __last, _C… in __check_strict_weak_ordering_sorted() argument
35 (std::is_sorted<_RandomAccessIterator, _Comp_ref>(__first, __last, _Comp_ref(__comp))), in __check_strict_weak_ordering_sorted()
38 __diff_t __size = __last - __first > __diff_t(100) ? __diff_t(100) : __last - __first; in __check_strict_weak_ordering_sorted()
43 while (__q < __size && !__comp(*(__first + __p), *(__first + __q))) { in __check_strict_weak_ordering_sorted()
50 …!__comp(*(__first + __a), *(__first + __b)), "Your comparator is not a valid strict-weak ordering"… in __check_strict_weak_ordering_sorted()
52 …!__comp(*(__first + __b), *(__first + __a)), "Your comparator is not a valid strict-weak ordering"… in __check_strict_weak_ordering_sorted()
59 …__comp(*(__first + __a), *(__first + __b)), "Your comparator is not a valid strict-weak ordering"); in __check_strict_weak_ordering_sorted()
61 …!__comp(*(__first + __b), *(__first + __a)), "Your comparator is not a valid strict-weak ordering"… in __check_strict_weak_ordering_sorted()
69 (void)__first; in __check_strict_weak_ordering_sorted()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__functional/ |
| H A D | boyer_moore_searcher.h | 108 : __first_(__first), in __first_() argument
118 ++__first; in __first_()
130 if (__first == __last) in operator()
133 return std::make_pair(__first, __first); in operator()
182 while (__k > 0 && !__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
185 if (__pred(__first[__k], __first[__i])) in __compute_bm_prefix()
239 : __first_(__first), in __first_() argument
244 if (__first == __last) in __first_()
250 ++__first; in __first_()
261 if (__first == __last) in operator()
[all …]
|