| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| 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()
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
75 while (__first1 != __last1 && __first2 != __last2) { in __equal_impl()
[all …]
|
| H A D | find_end.h | 41 _Sent1 __last1, in __find_end_impl() argument
50 …_Iter1 __match_first = _IterOps<_AlgPolicy>::next(__first1, __last1); // __last1 is the "default" … in __find_end_impl()
56 …if (__first1 == __last1) // if source exhausted return last correct answer (or __last1 if never fo… in __find_end_impl()
72 if (++__m1 == __last1) // Source exhausted, return last answer in __find_end_impl()
101 auto __last1 = _IterOps::next(__first1, __sent1); in __find_end() local
105 return __last1; // Everything matches an empty sequence in __find_end()
106 _Iter1 __l1 = __last1; in __find_end()
113 return __last1; in __find_end()
124 return __last1; in __find_end()
153 auto __last1 = _IterOps<_AlgPolicy>::next(__first1, __sent1); in __find_end() local
[all …]
|
| H A D | mismatch.h | 41 __mismatch_loop(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _… in __mismatch_loop() argument
42 while (__first1 != __last1) { 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()
70 … while (static_cast<size_t>(__last1 - __first1) >= __unroll_count * __vec_size) [[__unlikely__]] { in __mismatch_vectorized()
91 while (static_cast<size_t>(__last1 - __first1) >= __vec_size) { in __mismatch_vectorized()
101 if (__last1 - __first1 == 0) in __mismatch_vectorized()
107 __first1 = __last1 - __vec_size; in __mismatch_vectorized()
[all …]
|
| H A D | is_permutation.h | 74 _Sent1 __last1,
82 for (auto __i = __first1; __i != __last1; ++__i) {
102 for (auto __j = _IterOps<_AlgPolicy>::next(__i); __j != __last1; ++__j) {
117 …_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _BinaryPredicate&& __p…
119 for (; __first1 != __last1; ++__first1, (void)++__first2) {
124 if (__first1 == __last1)
129 _D1 __l1 = _IterOps<_AlgPolicy>::distance(__first1, __last1);
136 std::move(__last1),
155 _Sent1 __last1,
163 while (__first1 != __last1 && __first2 != __last2) {
[all …]
|
| H A D | search.h | 40 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_forward_impl() argument
46 if (__first1 == __last1) { // return __last1 if no element matches *__first2 in __search_forward_impl()
47 _IterOps<_AlgPolicy>::__advance_to(__first1, __last1); in __search_forward_impl()
60 if (++__m1 == __last1) { // Otherwise if source exhaused, pattern not found in __search_forward_impl()
85 _Sent1 __last1, in __search_random_access_impl() argument
98 _IterOps<_AlgPolicy>::__advance_to(__first1, __last1); in __search_random_access_impl()
131 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl() argument
136 auto __size1 = __last1 - __first1; in __search_impl()
138 return std::make_pair(__last1, __last1); in __search_impl()
142 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __search_impl()
[all …]
|
| H A D | find_first_of.h | 26 _ForwardIterator1 __last1, in __find_first_of_ce() argument
30 for (; __first1 != __last1; ++__first1) in __find_first_of_ce()
34 return __last1; in __find_first_of_ce()
40 _ForwardIterator1 __last1, 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 | set_intersection.h | 91 _Sent1 __last1, in __set_intersection() argument
103 std::__lower_bound_onesided<_AlgPolicy>(__first1, __last1, *__first2, __comp, __proj); in __set_intersection()
109 if (__first1 == __last1) in __set_intersection()
119 _IterOps<_AlgPolicy>::next(std::move(__first1), std::move(__last1)), in __set_intersection()
136 _Sent1 __last1, in __set_intersection() argument
143 while (__first1 != __last1 && __first2 != __last2) { in __set_intersection()
157 _IterOps<_AlgPolicy>::next(std::move(__first1), std::move(__last1)), in __set_intersection()
166 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_intersection() argument
169 std::move(__last1), in __set_intersection()
181 _InputIterator1 __last1, in set_intersection() argument
[all …]
|
| H A D | merge.h | 27 _InputIterator1 __last1, in __merge() argument
32 for (; __first1 != __last1; ++__result) { in __merge()
34 return std::copy(__first1, __last1, __result); in __merge()
49 _InputIterator1 __last1,
54 return std::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __comp); in merge()
60 _InputIterator1 __last1, in merge() argument
64 return std::merge(__first1, __last1, __first2, __last2, __result, __less<>()); in merge()
51 merge(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) merge() argument
|
| H A D | lexicographical_compare_three_way.h | 38 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las…
49 _Len1 __len1 = __last1 - __first1;
68 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las…
71 bool __exhausted1 = __first1 == __last1;
94 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las…
104 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __wrapped_comp_r…
108 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __wrapped_comp_r…
114 …_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterator2 __las… in lexicographical_compare_three_way() argument
116 …std::move(__first1), std::move(__last1), std::move(__first2), std::move(__last2), std::compare_thr… in lexicographical_compare_three_way()
|
| 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()
49 return std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result));
55 _InputIterator1 __last1, in set_difference()
61 __first1, __last1, __first2, __last2, __result, __comp)
68 _InputIterator1 __last1, in set_difference()
72 return std::__set_difference<_ClassicAlgPolicy>(__first1, __last1, __first2, __last2, __result, __less<>()).second;
33 __set_difference(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp) __set_difference() argument
52 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_difference() argument
65 set_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_difference() argument
|
| H A D | lexicographical_compare.h | 26 _InputIterator1 __last1, in __lexicographical_compare() argument
31 if (__first1 == __last1 || __comp(*__first1, *__first2)) in __lexicographical_compare()
42 _InputIterator1 __last1, 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 | stable_sort.h | 40 _BidirectionalIterator __last1, in __insertion_sort_move() argument
46 if (__first1 != __last1) { in __insertion_sort_move()
52 for (++__last2; ++__first1 != __last1; ++__last2) { in __insertion_sort_move()
73 _InputIterator1 __last1, 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()
111 _InputIterator1 __last1, in __merge_move_assign() argument
118 for (; __first1 != __last1; ++__result) { in __merge_move_assign()
120 for (; __first1 != __last1; ++__first1, (void)++__result) in __merge_move_assign()
146 _RandomAccessIterator __last1, in __stable_sort_move() argument
[all …]
|
| H A D | ranges_ends_with.h | 44 _Sent1 __last1, in __ends_with_fn_impl_bidirectional()
50 auto __rbegin1 = std::make_reverse_iterator(__last1); in __ends_with_fn_impl_bidirectional()
61 _Sent1 __last1, 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()
81 std::move(__last1), in __ends_with_fn_impl()
101 _Sent1 __last1, 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()
117 std::move(__last1), in __ends_with_fn_impl_with_offset()
138 _Sent1 __last1, in operator()
[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()
42 __swap_ranges(_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2) { in __swap_ranges()
43 while (__first1 != __last1) { in __swap_ranges()
54 swap_ranges(_ForwardIterator1 __first1, _ForwardIterator1 __last1, _ForwardIterator2 __first2) { in swap_ranges()
55 return std::__swap_ranges<_ClassicAlgPolicy>(std::move(__first1), std::move(__last1), std::move(__first2)).second; 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
|
| H A D | includes.h | 33 _Sent1 __last1, in __includes() argument
40 if (__first1 == __last1 || in __includes()
52 _InputIterator1 __last1, in includes() argument
61 std::move(__last1), 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()
46 while (__first1 != __last1) { in __set_symmetric_difference()
48 auto __ret1 = std::__copy<_AlgPolicy>(std::move(__first1), std::move(__last1), std::move(__result)); in __set_symmetric_difference()
74 _InputIterator1 __last1, in set_symmetric_difference()
81 std::move(__last1), in set_symmetric_difference()
92 _InputIterator1 __last1, in set_symmetric_difference()
98 std::move(__last1), in set_symmetric_difference()
42 __set_symmetric_difference(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_symmetric_difference() argument
71 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_symmetric_difference() argument
89 set_symmetric_difference(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_symmetric_difference() argument
|
| H A D | set_union.h | 44 _InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&& __comp) { in __set_union()
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()
70 _InputIterator1 __last1, in set_union()
77 std::move(__last1), in set_union()
88 _InputIterator1 __last1, in set_union()
94 std::move(__last1), in set_union()
41 __set_union(_InIter1 __first1,_Sent1 __last1,_InIter2 __first2,_Sent2 __last2,_OutIter __result,_Compare && __comp) __set_union() argument
67 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result,_Compare __comp) set_union() argument
85 set_union(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_InputIterator2 __last2,_OutputIterator __result) set_union() argument
|
| H A D | ranges_search.h | 41 _Sent1 __last1, in __ranges_search_impl()
53 auto __size1 = ranges::distance(__first1, __last1); in __ranges_search_impl()
55 ranges::advance(__first1, __last1); in __ranges_search_impl()
61 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __ranges_search_impl()
68 …std::__search_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1,… in __ranges_search_impl()
82 _Sent1 __last1, in operator()
88 return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | algorithm_impl.h | |
| H A D | parallel_backend_utils.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
40 _InputIterator1 __last1,
45 for (; __first1 != __last1; ++__first1, (void)++__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 | 38 _InputIterator1 __last1, in transform_reduce()
43 for (; __first1 != __last1; ++__first1, (void)++__first2)
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<>());
35 transform_reduce(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_Tp __init,_BinaryOp1 __b1,_BinaryOp2 __b2) transform_reduce() argument
45 transform_reduce(_InputIterator1 __first1,_InputIterator1 __last1,_InputIterator2 __first2,_Tp __init) transform_reduce() argument
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/omp/ |
| H A D | parallel_stable_sort.h | |
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/cpu_algos/ |
| H A D | merge.h | 38 _ForwardIterator1 __last1, in operator()
49 __last1, in operator()
73 return __result + (__last1 - __first1) + (__last2 - __first2); in operator()
75 return std::merge(__first1, __last1, __first2, __last2, __result, __comp); in operator()
|