| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | equal.h | 42 if (!__pred(*__first1, *__first2)) in __equal_iter_impl()
76 _InputIterator2 __first2, in __equal() argument
81 for (; __first1 != __last1 && __first2 != __last2; ++__first1, (void)++__first2) in __equal()
82 if (!__pred(*__first1, *__first2)) in __equal()
84 return __first1 == __last1 && __first2 == __last2; in __equal()
94 ++__first2; in __equal_impl()
117 _RandomAccessIterator2 __first2, in __equal() argument
128 std::__unwrap_iter(__first2), in __equal()
139 _InputIterator2 __first2, in equal() argument
145 __first2, in equal()
[all …]
|
| H A D | stable_sort.h | 49 value_type* __last2 = __first2; in __insertion_sort_move()
74 _InputIterator2 __first2, in __merge_move_construct() argument
85 for (; __first2 != __last2; ++__first2, (void)++__result, __d.template __incr<value_type>()) in __merge_move_construct()
90 if (__first2 == __last2) { in __merge_move_construct()
99 ++__first2; in __merge_move_construct()
112 _InputIterator2 __first2, in __merge_move_assign() argument
119 if (__first2 == __last2) { in __merge_move_assign()
126 ++__first2; in __merge_move_assign()
132 for (; __first2 != __last2; ++__first2, (void)++__result) in __merge_move_assign()
165 ++__first2; in __stable_sort_move()
[all …]
|
| H A D | lexicographical_compare_three_way.h | 39 -> decltype(__comp(*__first1, *__first2)) {
50 _Len2 __len2 = __last2 - __first2;
54 auto __c = __comp(*__first1, *__first2);
59 ++__first2;
69 -> decltype(__comp(*__first1, *__first2)) {
72 bool __exhausted2 = __first2 == __last2;
82 auto __c = __comp(*__first1, *__first2);
88 ++__first2;
95 -> decltype(__comp(*__first1, *__first2)) {
96 static_assert(__comparison_category<decltype(__comp(*__first1, *__first2))>,
[all …]
|
| H A D | is_permutation.h | 75 _Iter2 __first2,
137 std::move(__first2),
156 _Iter2 __first2,
167 ++__first2;
171 return __first2 == __last2;
199 _Iter2 __first2,
210 std::move(__first2),
230 _Iter2 __first2,
238 std::move(__first2),
274 std::move(__first2),
[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()
44 _InputIterator2 __first2, 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 | 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()
33 ++__first2; 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
44 _IterOps<_AlgPolicy>::iter_swap(__first1, __first2); in __swap_ranges()
46 ++__first2; in __swap_ranges()
49 return pair<_ForwardIterator1, _ForwardIterator2>(std::move(__first1), std::move(__first2)); in __swap_ranges()
54 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) { in swap_ranges() argument
[all …]
|
| H A D | merge.h | 28 _InputIterator2 __first2, in __merge() argument
33 if (__first2 == __last2) in __merge()
35 if (__comp(*__first2, *__first1)) { in __merge()
36 *__result = *__first2; in __merge()
37 ++__first2; in __merge()
43 return std::copy(__first2, __last2, __result); in __merge()
50 _InputIterator2 __first2, in merge() argument
54 …return std::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __… in merge()
61 _InputIterator2 __first2, in merge() argument
64 return std::merge(__first1, __last1, __first2, __last2, __result, __less<>()); in merge()
|
| H A D | find_end.h | 42 _Iter2 __first2, in __find_end_impl() argument
52 if (__first2 == __last2) in __find_end_impl()
64 _Iter2 __m2 = __first2; in __find_end_impl()
94 _Iter2 __first2, in __find_end() argument
104 if (__first2 == __last2) in __find_end()
145 _Iter2 __first2, in __find_end() argument
156 auto __len2 = __last2 - __first2; in __find_end()
176 if (__m2 == __first2) in __find_end()
190 _ForwardIterator2 __first2, in __find_end_classic() argument
197 __first2, in __find_end_classic()
[all …]
|
| H A D | set_union.h | 46 if (__first2 == __last2) { in __set_union()
49 std::move(__ret1.first), std::move(__first2), std::move((__ret1.second))); in __set_union()
51 if (__comp(*__first2, *__first1)) { in __set_union()
52 *__result = *__first2; in __set_union()
53 ++__first2; in __set_union()
55 if (!__comp(*__first1, *__first2)) { in __set_union()
56 ++__first2; in __set_union()
71 _InputIterator2 __first2, in set_union() argument
78 std::move(__first2), in set_union()
89 _InputIterator2 __first2, in set_union() argument
[all …]
|
| H A D | lexicographical_compare.h | 27 _InputIterator2 __first2, 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()
43 _InputIterator2 __first2, 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_difference.h | 36 …_InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result,… in __set_difference() argument
37 while (__first1 != __last1 && __first2 != __last2) { in __set_difference()
38 if (__comp(*__first1, *__first2)) { in __set_difference()
42 } else if (__comp(*__first2, *__first1)) { in __set_difference()
43 ++__first2; in __set_difference()
46 ++__first2; in __set_difference()
56 _InputIterator2 __first2, in set_difference() argument
61 __first1, __last1, __first2, __last2, __result, __comp) in set_difference()
69 _InputIterator2 __first2, in set_difference() argument
72 …return std::__set_difference<_ClassicAlgPolicy>(__first1, __last1, __first2, __last2, __result, __… in set_difference()
|
| H A D | search.h | 41 if (__first2 == __last2) in __search_forward_impl()
56 _Iter2 __m2 = __first2; in __search_forward_impl()
86 _Iter2 __first2, in __search_random_access_impl() argument
107 _Iter2 __m2 = __first2; in __search_random_access_impl()
124 _Iter2 __first2,
131 auto __size2 = __last2 - __first2;
141 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2);
148 _Iter2 __first2,
163 _ForwardIterator2 __first2, in search() argument
169 return std::__search_impl(__first1, __last1, __first2, __last2, __pred, __proj, __proj).first; in search()
[all …]
|
| H A D | includes.h | 34 _Iter2 __first2, in __includes() argument
39 for (; __first2 != __last2; ++__first1) { 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()
44 ++__first2; in __includes()
53 _InputIterator2 __first2, in includes() argument
57 …__is_callable<_Compare, decltype(*__first1), decltype(*__first2)>::value, "Comparator has to be ca… in includes()
62 std::move(__first2), 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_symmetric_difference.h | 47 if (__first2 == __last2) { in __set_symmetric_difference()
50 std::move(__ret1.first), std::move(__first2), std::move((__ret1.second))); in __set_symmetric_difference()
52 if (__comp(*__first1, *__first2)) { in __set_symmetric_difference()
57 if (__comp(*__first2, *__first1)) { in __set_symmetric_difference()
58 *__result = *__first2; in __set_symmetric_difference()
63 ++__first2; in __set_symmetric_difference()
66 …auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)… in __set_symmetric_difference()
75 _InputIterator2 __first2, in set_symmetric_difference() argument
82 std::move(__first2), in set_symmetric_difference()
93 _InputIterator2 __first2, in set_symmetric_difference() argument
[all …]
|
| H A D | set_intersection.h | 44 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_intersection() argument
45 while (__first1 != __last1 && __first2 != __last2) { in __set_intersection()
46 if (__comp(*__first1, *__first2)) in __set_intersection()
49 if (!__comp(*__first2, *__first1)) { in __set_intersection()
54 ++__first2; in __set_intersection()
60 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), in __set_intersection()
68 _InputIterator2 __first2, in set_intersection() argument
75 std::move(__first2), in set_intersection()
86 _InputIterator2 __first2, in set_intersection() argument
92 std::move(__first2), in set_intersection()
|
| H A D | pstl_equal.h | 44 _ForwardIterator2&& __first2, in __equal() argument
61 std::move(__first2), in __equal()
75 _ForwardIterator2 __first2, 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()
102 _ForwardIterator2&& __first2, in __equal() argument
130 std::move(__first2), in __equal()
145 _ForwardIterator2 __first2, in equal() argument
149 …__policy, std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), std::m… in equal()
163 _ForwardIterator2 __first2, in equal() argument
[all …]
|
| H A D | find_first_of.h | 27 _ForwardIterator2 __first2, in __find_first_of_ce() argument
31 for (_ForwardIterator2 __j = __first2; __j != __last2; ++__j) in __find_first_of_ce()
41 _ForwardIterator2 __first2, 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 | ranges_ends_with.h | 45 _Iter2 __first2, in __ends_with_fn_impl_bidirectional()
53 auto __rend2 = std::make_reverse_iterator(__first2); in __ends_with_fn_impl_bidirectional()
62 _Iter2 __first2, in __ends_with_fn_impl()
69 …return __ends_with_fn_impl_bidirectional(__first1, __last1, __first2, __last2, __pred, __proj1, __… in __ends_with_fn_impl()
73 auto __n2 = ranges::distance(__first2, __last2); in __ends_with_fn_impl()
82 std::move(__first2), in __ends_with_fn_impl()
102 _Iter2 __first2, in __ends_with_fn_impl_with_offset()
111 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1,… in __ends_with_fn_impl_with_offset()
118 std::move(__first2), in __ends_with_fn_impl_with_offset()
139 _Iter2 __first2, in operator()
[all …]
|
| H A D | ranges_lexicographical_compare.h | 40 _Iter2 __first2, in __lexicographical_compare_impl()
45 while (__first2 != __last2) { in __lexicographical_compare_impl()
46 …= __last1 || std::invoke(__comp, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __lexicographical_compare_impl()
48 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) in __lexicographical_compare_impl()
51 ++__first2; in __lexicographical_compare_impl()
66 _Iter2 __first2, 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()
49 ++__first2; 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);
|
| H A D | ranges_merge.h | 57 _InIter2&& __first2, in __merge_impl() argument
63 for (; __first1 != __last1 && __first2 != __last2; ++__result) { in __merge_impl()
64 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) { in __merge_impl()
65 *__result = *__first2; in __merge_impl()
66 ++__first2; in __merge_impl()
73 auto __ret2 = ranges::copy(std::move(__first2), std::move(__last2), std::move(__ret1.out)); in __merge_impl()
90 _InIter2 __first2, in operator()
96 …return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __pr…
|
| /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()
41 _InputIterator2 __first2, 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 | 39 _InputIterator2 __first2, 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()
39 return __first2 + __n; in __simd_walk()
77 …_Iterator1 __first1, _DifferenceType __n, _Iterator2 __first2, _Iterator3 __first3, _Function __f)… in __simd_walk() argument
80 __f(__first1[__i], __first2[__i], __first3[__i]); in __simd_walk()
93 _ForwardIterator2 __first2, in __pstl_transform() argument
103 …[__op, __first1, __first2, __result](_ForwardIterator1 __brick_first, _ForwardIterator1 __brick_la… in __pstl_transform()
108 __first2 + (__brick_first - __first1), in __pstl_transform()
122 __first2, in __pstl_transform()
128 return std::transform(__first1, __last1, __first2, __result, __op); in __pstl_transform()
|
| /freebsd-14.2/contrib/llvm-project/libcxx/include/__memory/ |
| H A D | uninitialized_algorithms.h | 546 auto __destruct_first = __first2; in __uninitialized_allocator_copy_impl()
552 ++__first2; in __uninitialized_allocator_copy_impl()
555 return __first2; in __uninitialized_allocator_copy_impl()
580 ++__first2;
582 return __first2;
594 return std::__rewrap_iter(__first2, __result);
607 auto __destruct_first = __first2;
617 ++__first2;
620 return __first2;
643 ++__first2;
[all …]
|