| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | search.h | 48 return std::make_pair(__first1, __first1); in __search_forward_impl()
52 ++__first1; in __search_forward_impl()
66 ++__first1; in __search_forward_impl()
84 _Iter1 __first1, in __search_random_access_impl() argument
99 return std::make_pair(__first1, __first1); in __search_random_access_impl()
103 ++__first1; in __search_random_access_impl()
110 return std::make_pair(__first1, __first1 + _DiffT1(__size2)); in __search_random_access_impl()
113 ++__first1; in __search_random_access_impl()
122 _Iter1 __first1,
133 return std::make_pair(__first1, __first1);
[all …]
|
| H A D | equal.h | 41 for (; __first1 != __last1; ++__first1, (void)++__first2) in __equal_iter_impl()
42 if (!__pred(*__first1, *__first2)) in __equal_iter_impl()
55 return std::__constexpr_memcmp_equal(__first1, __first2, __element_count(__last1 - __first1)); in __equal_iter_impl()
74 __equal(_InputIterator1 __first1, in __equal() argument
81 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
93 ++__first1; in __equal_impl()
110 return std::__constexpr_memcmp_equal(__first1, __first2, __element_count(__last1 - __first1)); in __equal_impl()
126 std::__unwrap_iter(__first1), in __equal()
137 equal(_InputIterator1 __first1, in equal() argument
143 __first1, in equal()
[all …]
|
| H A D | mismatch.h | 26 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredic… in mismatch() argument
27 for (; __first1 != __last1; ++__first1, (void)++__first2) in mismatch()
28 if (!__pred(*__first1, *__first2)) in mismatch()
30 return pair<_InputIterator1, _InputIterator2>(__first1, __first2); in mismatch()
35 mismatch(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in mismatch() argument
36 return std::mismatch(__first1, __last1, __first2, __equal_to()); in mismatch()
42 mismatch(_InputIterator1 __first1, in mismatch() argument
47 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in mismatch()
48 if (!__pred(*__first1, *__first2)) in mismatch()
50 return pair<_InputIterator1, _InputIterator2>(__first1, __first2); in mismatch()
[all …]
|
| H A D | is_permutation.h | 73 _Iter1 __first1,
119 for (; __first1 != __last1; ++__first1, (void)++__first2) {
124 if (__first1 == __last1)
135 std::move(__first1),
154 _Iter1 __first1,
166 ++__first1;
170 if (__first1 == __last1)
197 _Iter1 __first1,
208 std::move(__first1),
228 _Iter1 __first1,
[all …]
|
| H A D | stable_sort.h | 39 _BidirectionalIterator __first1, in __insertion_sort_move() argument
46 if (__first1 != __last1) { in __insertion_sort_move()
55 if (__comp(*__first1, *--__i2)) { in __insertion_sort_move()
72 _InputIterator1 __first1, in __merge_move_construct() argument
84 if (__first1 == __last1) { in __merge_move_construct()
91 for (; __first1 != __last1; ++__first1, (void)++__result, __d.template __incr<value_type>()) in __merge_move_construct()
96 if (__comp(*__first2, *__first1)) { in __merge_move_construct()
103 ++__first1; in __merge_move_construct()
110 _InputIterator1 __first1, in __merge_move_assign() argument
120 for (; __first1 != __last1; ++__first1, (void)++__result) in __merge_move_assign()
[all …]
|
| H A D | lexicographical_compare_three_way.h | 39 -> decltype(__comp(*__first1, *__first2)) {
49 _Len1 __len1 = __last1 - __first1;
54 auto __c = __comp(*__first1, *__first2);
58 ++__first1;
69 -> decltype(__comp(*__first1, *__first2)) {
71 bool __exhausted1 = __first1 == __last1;
82 auto __c = __comp(*__first1, *__first2);
87 ++__first1;
95 -> decltype(__comp(*__first1, *__first2)) {
96 static_assert(__comparison_category<decltype(__comp(*__first1, *__first2))>,
[all …]
|
| H A D | find_end.h | 40 _Iter1 __first1, in __find_end_impl() argument
60 ++__first1; in __find_end_impl()
63 _Iter1 __m1 = __first1; in __find_end_impl()
67 __match_first = __first1; in __find_end_impl()
69 ++__first1; in __find_end_impl()
76 ++__first1; in __find_end_impl()
92 _Iter1 __first1, in __find_end() argument
143 _Iter1 __first1, in __find_end() argument
188 _ForwardIterator1 __first1, in __find_end_classic() argument
195 __first1, in __find_end_classic()
[all …]
|
| H A D | ranges_search.h | 40 _Iter1 __first1, in __ranges_search_impl()
50 return {__first1, __first1}; in __ranges_search_impl()
53 auto __size1 = ranges::distance(__first1, __last1); in __ranges_search_impl()
55 ranges::advance(__first1, __last1); in __ranges_search_impl()
56 return {__first1, __first1}; in __ranges_search_impl()
61 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __ranges_search_impl()
81 _Iter1 __first1, in operator()
99 auto __first1 = ranges::begin(__range1); local
103 return {__first1, __first1};
107 ranges::advance(__first1, ranges::end(__range1));
[all …]
|
| H A D | swap_ranges.h | 29 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel… in __swap_ranges() argument
30 while (__first1 != __last1 && __first2 != __last2) { in __swap_ranges()
31 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
32 ++__first1; in __swap_ranges()
36 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2)); in __swap_ranges()
42 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) { in __swap_ranges() argument
43 while (__first1 != __last1) { in __swap_ranges()
44 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
45 ++__first1; in __swap_ranges()
49 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2)); in __swap_ranges()
[all …]
|
| H A D | set_difference.h | 37 while (__first1 != __last1 && __first2 != __last2) { in __set_difference()
38 if (__comp(*__first1, *__first2)) { in __set_difference()
39 *__result = *__first1; in __set_difference()
40 ++__first1; in __set_difference()
42 } else if (__comp(*__first2, *__first1)) { in __set_difference()
45 ++__first1; in __set_difference()
49 return std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result)); in __set_difference()
54 _InputIterator1 __first1, in set_difference() argument
61 __first1, __last1, __first2, __last2, __result, __comp) in set_difference()
67 _InputIterator1 __first1, in set_difference() argument
[all …]
|
| H A D | merge.h | 26 _InputIterator1 __first1, in __merge() argument
32 for (; __first1 != __last1; ++__result) { in __merge()
34 return std::copy(__first1, __last1, __result); in __merge()
35 if (__comp(*__first2, *__first1)) { in __merge()
39 *__result = *__first1; in __merge()
40 ++__first1; in __merge()
48 merge(_InputIterator1 __first1, in merge() argument
54 …return std::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __… in merge()
59 merge(_InputIterator1 __first1, in merge() argument
64 return std::merge(__first1, __last1, __first2, __last2, __result, __less<>()); in merge()
|
| H A D | set_symmetric_difference.h | 46 while (__first1 != __last1) { in __set_symmetric_difference()
52 if (__comp(*__first1, *__first2)) { in __set_symmetric_difference()
53 *__result = *__first1; in __set_symmetric_difference()
55 ++__first1; in __set_symmetric_difference()
57 if (__comp(*__first2, *__first1)) { in __set_symmetric_difference()
61 ++__first1; in __set_symmetric_difference()
68 std::move(__first1), std::move(__ret2.first), std::move((__ret2.second))); in __set_symmetric_difference()
73 _InputIterator1 __first1, in set_symmetric_difference() argument
80 std::move(__first1), in set_symmetric_difference()
91 _InputIterator1 __first1, in set_symmetric_difference() argument
[all …]
|
| H A D | lexicographical_compare.h | 25 _InputIterator1 __first1, in __lexicographical_compare() argument
30 for (; __first2 != __last2; ++__first1, (void)++__first2) { in __lexicographical_compare()
31 if (__first1 == __last1 || __comp(*__first1, *__first2)) in __lexicographical_compare()
33 if (__comp(*__first2, *__first1)) in __lexicographical_compare()
41 _InputIterator1 __first1, in lexicographical_compare() argument
46 …return std::__lexicographical_compare<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __l… in lexicographical_compare()
51 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las… in lexicographical_compare() argument
52 return std::lexicographical_compare(__first1, __last1, __first2, __last2, __less<>()); in lexicographical_compare()
|
| H A D | set_intersection.h | 45 while (__first1 != __last1 && __first2 != __last2) { in __set_intersection()
46 if (__comp(*__first1, *__first2)) in __set_intersection()
47 ++__first1; in __set_intersection()
49 if (!__comp(*__first2, *__first1)) { in __set_intersection()
50 *__result = *__first1; in __set_intersection()
52 ++__first1; in __set_intersection()
59 _IterOps<_AlgPolicy>::next(std::move(__first1), std::move(__last1)), in __set_intersection()
66 _InputIterator1 __first1, in set_intersection() argument
73 std::move(__first1), in set_intersection()
84 _InputIterator1 __first1, in set_intersection() argument
[all …]
|
| H A D | find_first_of.h | 25 _ForwardIterator1 __first1, in __find_first_of_ce() argument
30 for (; __first1 != __last1; ++__first1) in __find_first_of_ce()
32 if (__pred(*__first1, *__j)) in __find_first_of_ce()
33 return __first1; in __find_first_of_ce()
39 _ForwardIterator1 __first1, in find_first_of() argument
44 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __pred); in find_first_of()
49 …_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2, _ForwardIterato… in find_first_of() argument
50 return std::__find_first_of_ce(__first1, __last1, __first2, __last2, __equal_to()); in find_first_of()
|
| H A D | includes.h | 32 _Iter1 __first1, in __includes() argument
39 for (; __first2 != __last2; ++__first1) { in __includes()
40 if (__first1 == __last1 || in __includes()
41 std::__invoke(__comp, std::__invoke(__proj2, *__first2), std::__invoke(__proj1, *__first1))) in __includes()
43 … if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __includes()
51 includes(_InputIterator1 __first1, in includes() argument
57 …__is_callable<_Compare, decltype(*__first1), decltype(*__first2)>::value, "Comparator has to be ca… in includes()
60 std::move(__first1), in includes()
71 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato… in includes() argument
72 …return std::includes(std::move(__first1), std::move(__last1), std::move(__first2), std::move(__las… in includes()
|
| H A D | set_union.h | 45 for (; __first1 != __last1; ++__result) { in __set_union()
47 …auto __ret1 = std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result)… in __set_union()
51 if (__comp(*__first2, *__first1)) { in __set_union()
55 if (!__comp(*__first1, *__first2)) { in __set_union()
58 *__result = *__first1; in __set_union()
59 ++__first1; in __set_union()
64 std::move(__first1), std::move(__ret2.first), std::move((__ret2.second))); in __set_union()
69 _InputIterator1 __first1, in set_union() argument
76 std::move(__first1), in set_union()
87 _InputIterator1 __first1, in set_union() argument
[all …]
|
| H A D | pstl_equal.h | 42 _ForwardIterator1&& __first1, in __equal() argument
59 std::move(__first1), in __equal()
73 _ForwardIterator1 __first1, in equal() argument
77 …auto __res = std::__equal(__policy, std::move(__first1), std::move(__last1), std::move(__first2), … in equal()
89 …return std::equal(__policy, std::move(__first1), std::move(__last1), std::move(__first2), std::equ… in equal()
100 _ForwardIterator1&& __first1, in __equal() argument
128 std::move(__first1), in __equal()
143 _ForwardIterator1 __first1, in equal() argument
149 …__policy, std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), std::m… in equal()
161 _ForwardIterator1 __first1, in equal() argument
[all …]
|
| H A D | ranges_find_first_of.h | 39 _Iter1 __first1, in __find_first_of_impl()
46 for (; __first1 != __last1; ++__first1) { in __find_first_of_impl()
48 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) in __find_first_of_impl()
49 return __first1; in __find_first_of_impl()
52 return __first1; in __find_first_of_impl()
64 _Iter1 __first1, in operator()
72 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,…
|
| H A D | ranges_ends_with.h | 43 _Iter1 __first1, in __ends_with_fn_impl_bidirectional()
51 auto __rend1 = std::make_reverse_iterator(__first1); in __ends_with_fn_impl_bidirectional()
60 _Iter1 __first1, in __ends_with_fn_impl()
69 …return __ends_with_fn_impl_bidirectional(__first1, __last1, __first2, __last2, __pred, __proj1, __… in __ends_with_fn_impl()
72 auto __n1 = ranges::distance(__first1, __last1); in __ends_with_fn_impl()
80 std::move(__first1), in __ends_with_fn_impl()
100 _Iter1 __first1, in __ends_with_fn_impl_with_offset()
114 ranges::advance(__first1, __offset); in __ends_with_fn_impl_with_offset()
116 std::move(__first1), in __ends_with_fn_impl_with_offset()
137 _Iter1 __first1, in operator()
[all …]
|
| H A D | ranges_lexicographical_compare.h | 38 _Iter1 __first1, in __lexicographical_compare_impl()
46 …if (__first1 == __last1 || std::invoke(__comp, std::invoke(__proj1, *__first1), std::invoke(__proj… in __lexicographical_compare_impl()
48 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) in __lexicographical_compare_impl()
50 ++__first1; in __lexicographical_compare_impl()
64 _Iter1 __first1, in operator()
72 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __comp, __proj1,…
|
| H A D | ranges_mismatch.h | 44 …__go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2&… in __go()
45 while (__first1 != __last1 && __first2 != __last2) { in __go()
46 if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __go()
48 ++__first1; in __go()
51 return {std::move(__first1), std::move(__first2)}; in __go()
63 …_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Pro… in operator()
65 … return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__numeric/ |
| H A D | inner_product.h | 27 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __in… in inner_product() argument
28 for (; __first1 != __last1; ++__first1, (void)++__first2) in inner_product()
30 __init = std::move(__init) + *__first1 * *__first2; in inner_product()
32 __init = __init + *__first1 * *__first2; in inner_product()
39 _InputIterator1 __first1, in inner_product() argument
45 for (; __first1 != __last1; ++__first1, (void)++__first2) in inner_product()
47 __init = __binary_op1(std::move(__init), __binary_op2(*__first1, *__first2)); in inner_product()
49 __init = __binary_op1(__init, __binary_op2(*__first1, *__first2)); in inner_product()
|
| H A D | transform_reduce.h | 37 _InputIterator1 __first1, in transform_reduce() argument
43 for (; __first1 != __last1; ++__first1, (void)++__first2) in transform_reduce()
44 __init = __b1(std::move(__init), __b2(*__first1, *__first2)); in transform_reduce()
50 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp _… in transform_reduce() argument
51 …return std::transform_reduce(__first1, __last1, __first2, std::move(__init), std::plus<>(), std::m… in transform_reduce()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/ |
| H A D | transform.h | 35 __simd_walk(_Iterator1 __first1, _DifferenceType __n, _Iterator2 __first2, _Function __f) noexcept { in __simd_walk() argument
38 __f(__first1[__i], __first2[__i]); in __simd_walk()
80 __f(__first1[__i], __first2[__i], __first3[__i]); in __simd_walk()
91 _ForwardIterator1 __first1, in __pstl_transform() argument
101 __first1, in __pstl_transform()
108 __first2 + (__brick_first - __first1), in __pstl_transform()
109 __result + (__brick_first - __first1), in __pstl_transform()
114 return __result + (__last1 - __first1); in __pstl_transform()
120 __first1, in __pstl_transform()
121 __last1 - __first1, in __pstl_transform()
[all …]
|