| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | mismatch.h | 41 __mismatch_loop(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _… in __mismatch_loop() argument
43 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __mismatch_loop()
46 ++__first2; in __mismatch_loop()
48 return std::make_pair(std::move(__first1), std::move(__first2)); in __mismatch_loop()
53 __mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2… in __mismatch() argument
54 return std::__mismatch_loop(__first1, __last1, __first2, __pred, __proj1, __proj2); in __mismatch()
61 __mismatch_vectorized(_Iter __first1, _Iter __last1, _Iter __first2) { in __mismatch_vectorized() argument
69 auto __last2 = __first2 + (__last1 - __first1); in __mismatch_vectorized()
76 __rhs[__i] = std::__load_vector<__vec>(__first2 + __i * __vec_size); in __mismatch_vectorized()
82 return {__first1 + __offset, __first2 + __offset}; in __mismatch_vectorized()
[all …]
|
| H A D | equal.h | 39 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate& __p… in __equal_iter_impl() argument
40 for (; __first1 != __last1; ++__first1, (void)++__first2) in __equal_iter_impl()
41 if (!__pred(*__first1, *__first2)) in __equal_iter_impl()
53 __equal_iter_impl(_Tp* __first1, _Tp* __last1, _Up* __first2, _BinaryPredicate&) { in __equal_iter_impl() argument
54 return std::__constexpr_memcmp_equal(__first1, __first2, __element_count(__last1 - __first1)); in __equal_iter_impl()
59 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _BinaryPredicate… in equal() argument
61 … std::__unwrap_iter(__first1), std::__unwrap_iter(__last1), std::__unwrap_iter(__first2), __pred); in equal()
66 equal(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2) { in equal() argument
67 return std::equal(__first1, __last1, __first2, __equal_to()); in equal()
74 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __comp, _Proj1& __proj1, … in __equal_impl() argument
[all …]
|
| H A D | stable_sort.h | 41 typename iterator_traits<_BidirectionalIterator>::value_type* __first2, in __insertion_sort_move() argument
48 unique_ptr<value_type, __destruct_n&> __h(__first2, __d); in __insertion_sort_move()
49 value_type* __last2 = __first2; in __insertion_sort_move()
58 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) 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()
86 ::new ((void*)__result) value_type(_Ops::__iter_move(__first2)); in __merge_move_construct()
90 if (__first2 == __last2) { in __merge_move_construct()
96 if (__comp(*__first2, *__first1)) { in __merge_move_construct()
97 ::new ((void*)__result) value_type(_Ops::__iter_move(__first2)); in __merge_move_construct()
[all …]
|
| H A D | is_permutation.h | 75 _Iter2 __first2,
93 for (auto __j = __first2; __j != __last2; ++__j) {
117 …_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _BinaryPredicate&& __p…
119 for (; __first1 != __last1; ++__first1, (void)++__first2) {
120 if (!__pred(*__first1, *__first2))
132 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
137 std::move(__first2),
156 _Iter2 __first2,
163 while (__first1 != __last1 && __first2 != __last2) {
164 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
[all …]
|
| H A D | set_intersection.h | 54 _InForwardIter2& __first2, in __set_intersection_add_output_if_equal() argument
61 ++__first2; in __set_intersection_add_output_if_equal()
92 _InForwardIter2 __first2, in __set_intersection() argument
101 while (__first2 != __last2) { in __set_intersection()
103 std::__lower_bound_onesided<_AlgPolicy>(__first1, __last1, *__first2, __comp, __proj); in __set_intersection()
108 __first1 == __first1_next, __first1, __first2, __result, __prev_may_be_equal); in __set_intersection()
113 std::__lower_bound_onesided<_AlgPolicy>(__first2, __last2, *__first1, __comp, __proj); in __set_intersection()
114 std::swap(__first2_next, __first2); in __set_intersection()
116 __first2 == __first2_next, __first1, __first2, __result, __prev_may_be_equal); in __set_intersection()
120 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), in __set_intersection()
[all …]
|
| H A D | lexicographical_compare_three_way.h | 38 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las…
39 -> decltype(__comp(*__first1, *__first2)) {
50 _Len2 __len2 = __last2 - __first2;
54 auto __c = __comp(*__first1, *__first2);
59 ++__first2;
68 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las…
69 -> decltype(__comp(*__first1, *__first2)) {
72 bool __exhausted2 = __first2 == __last2;
82 auto __c = __comp(*__first1, *__first2);
88 ++__first2;
[all …]
|
| H A D | swap_ranges.h | 29 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _Sentinel2 __last2) { in __swap_ranges()
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));
42 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) { in __swap_ranges()
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()
27 __swap_ranges(_ForwardIterator1 __first1,_Sentinel1 __last1,_ForwardIterator2 __first2,_Sentinel2 __last2) __swap_ranges() argument
41 __swap_ranges(_ForwardIterator1 __first1,_Sentinel1 __last1,_ForwardIterator2 __first2) __swap_ranges() argument
53 swap_ranges(_ForwardIterator1 __first1,_ForwardIterator1 __last1,_ForwardIterator2 __first2) swap_ranges() argument
[all...] |
| H A D | find_end.h | 42 _Iter2 __first2, in __find_end_impl() argument
52 if (__first2 == __last2) in __find_end_impl()
58 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __find_end_impl()
64 _Iter2 __m2 = __first2; in __find_end_impl()
94 _Iter2 __first2, in __find_end() argument
102 auto __last2 = _IterOps::next(__first2, __sent2); in __find_end()
104 if (__first2 == __last2) in __find_end()
121 … if (__m2 == __first2) // If pattern exhausted, __m1 is the answer (works for 1 element pattern) in __find_end()
145 _Iter2 __first2, in __find_end() argument
154 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __sent2); in __find_end()
[all …]
|
| H A D | set_union.h | 44 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { in __set_union()
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()
62 auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)); in __set_union()
71 _InputIterator2 __first2, in set_union()
41 __set_union(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_union() argument
68 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_union() argument
86 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_union() 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,
54 return std::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __comp); in merge()
61 _InputIterator2 __first2, in merge() argument
64 return std::merge(__first1, __last1, __first2, __last in merge()
52 merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) merge() 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 | search.h | 40 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_forward_impl() argument
41 if (__first2 == __last2) in __search_forward_impl()
50 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_forward_impl()
56 _Iter2 __m2 = __first2; in __search_forward_impl()
86 _Iter2 __first2, in __search_random_access_impl() argument
101 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_random_access_impl()
107 _Iter2 __m2 = __first2; in __search_random_access_impl()
131 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl() argument
132 auto __size2 = __last2 - __first2; in __search_impl()
142 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __search_impl()
[all …]
|
| H A D | set_difference.h | 36 _InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result, _Comp&& __comp) { in __set_difference()
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()
61 __first1, __last1, __first2, __last2, __result, __comp)
69 _InputIterator2 __first2, in set_difference()
72 return std::__set_difference<_ClassicAlgPolicy>(__first1, __last1, __first2, __last
33 __set_difference(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp) __set_difference() argument
53 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_difference() argument
66 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_difference() argument
[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 | 45 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { in __set_symmetric_difference()
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()
82 std::move(__first2), in set_symmetric_difference()
42 __set_symmetric_difference(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_symmetric_difference() argument
72 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_symmetric_difference() argument
90 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_symmetric_difference() 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_merge.h | 57 _InIter2&& __first2, in __merge_impl()
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));
90 _InIter2 __first2, in operator()
96 return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __proj2);
54 __merge_impl(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp,_Proj1 && __proj1,_Proj2 && __proj2) __merge_impl() argument
|
| 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,…
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | parallel_backend_utils.h | |
| H A D | algorithm_impl.h | |
| H A D | glue_algorithm_impl.h | |
| /freebsd/contrib/llvm-project/libcxx/include/__numeric/ |
| H A D | inner_product.h | 27 inner_product(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) {
28 for (; __first1 != __last1; ++__first1, (void)++__first2) in inner_product() argument
30 __init = std::move(__init) + *__first1 * *__first2; in inner_product()
32 __init = __init + *__first1 * *__first2; in inner_product()
41 _InputIterator2 __first2,
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()
42 inner_product(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_Tp __init,_BinaryOperation1 __binary_op1,_BinaryOperation2 __binary_op2) inner_product() argument
|
| H A D | transform_reduce.h | 39 _InputIterator2 __first2, in transform_reduce()
43 for (; __first1 != __last1; ++__first1, (void)++__first2)
44 __init = __b1(std::move(__init), __b2(*__first1, *__first2)); in transform_reduce()
50 transform_reduce(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _Tp __init) {
51 return std::transform_reduce(__first1, __last1, __first2, std::move(__init), std::plus<>(), std::multiplies<>());
36 transform_reduce(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_Tp __init,_BinaryOp1 __b1,_BinaryOp2 __b2) transform_reduce() argument
46 transform_reduce(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_Tp __init) transform_reduce() argument
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/cpu_algos/ |
| H A D | transform.h | 35 __simd_transform(_Iterator1 __first1, _DifferenceType __n, _Iterator2 __first2, _Function __f) noex… in __simd_transform() argument
38 __f(__first1[__i], __first2[__i]); in __simd_transform()
39 return __first2 + __n; in __simd_transform()
44 …_Iterator1 __first1, _DifferenceType __n, _Iterator2 __first2, _Iterator3 __first3, _Function __f)… in __simd_transform() argument
47 __f(__first1[__i], __first2[__i], __first3[__i]); in __simd_transform()
105 _ForwardIterator2 __first2, in operator()
115 [&__policy, __op, __first1, __first2, __result]( in operator()
123 __first2 + (__brick_first - __first1), in operator()
137 __first2, in operator()
143 return std::transform(__first1, __last1, __first2, __result, __op); in operator()
|