| /freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | equal.h | 44 __bit_iterator<_Cp, _IsConst2> __first2) { in __equal_unaligned() argument
59 unsigned __clz_r = __bits_per_word - __first2.__ctz_; in __equal_unaligned()
61 __m = std::__middle_mask<__storage_type>(__clz_r - __ddn, __first2.__ctz_); in __equal_unaligned()
62 if (__first2.__ctz_ > __first1.__ctz_) { in __equal_unaligned()
63 if (static_cast<__storage_type>(*__first2.__seg_ & __m) != in __equal_unaligned()
64 static_cast<__storage_type>(__b << (__first2.__ctz_ - __first1.__ctz_))) in __equal_unaligned()
67 if (static_cast<__storage_type>(*__first2.__seg_ & __m) != in __equal_unaligned()
68 static_cast<__storage_type>(__b >> (__first1.__ctz_ - __first2.__ctz_))) in __equal_unaligned()
71 __first2.__seg_ += (__ddn + __first2.__ctz_) / __bits_per_word; in __equal_unaligned()
72 __first2.__ctz_ = static_cast<unsigned>((__ddn + __first2.__ctz_) % __bits_per_word); in __equal_unaligned()
[all …]
|
| H A D | mismatch.h | 42 __mismatch_loop(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _… in __mismatch_loop() argument
44 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __mismatch_loop()
47 ++__first2; in __mismatch_loop()
49 return std::make_pair(std::move(__first1), std::move(__first2)); in __mismatch_loop()
54 __mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2… in __mismatch() argument
55 return std::__mismatch_loop(__first1, __last1, __first2, __pred, __proj1, __proj2); in __mismatch()
62 __mismatch_vectorized(_Iter __first1, _Iter __last1, _Iter __first2) { in __mismatch_vectorized() argument
70 auto __last2 = __first2 + (__last1 - __first1); in __mismatch_vectorized()
77 __rhs[__i] = std::__load_vector<__vec>(__first2 + __i * __vec_size); in __mismatch_vectorized()
83 return {__first1 + __offset, __first2 + __offset}; in __mismatch_vectorized()
[all …]
|
| H A D | is_permutation.h | 76 _Iter2 __first2,
94 for (auto __j = __first2; __j != __last2; ++__j) {
118 …_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _BinaryPredicate&& __p…
120 for (; __first1 != __last1; ++__first1, (void)++__first2) {
121 if (!__pred(*__first1, *__first2))
133 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
138 std::move(__first2),
157 _Iter2 __first2,
164 while (__first1 != __last1 && __first2 != __last2) {
165 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
[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 | lexicographical_compare.h | 44 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Comp& __comp, _Proj1& __proj1, … in __lexicographical_compare() argument
45 while (__first2 != __last2) { in __lexicographical_compare()
47 std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __lexicographical_compare()
49 if (std::__invoke(__comp, std::__invoke(__proj2, *__first2), std::__invoke(__proj1, *__first1))) in __lexicographical_compare()
52 ++__first2; in __lexicographical_compare()
73 __lexicographical_compare(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Tp* __last2, _Comp&, _Proj1&… in __lexicographical_compare() argument
76 …std::__constexpr_memcmp(__first1, __first2, __element_count(std::min(__last1 - __first1, __last2 -… in __lexicographical_compare()
78 return __last1 - __first1 < __last2 - __first2; in __lexicographical_compare()
83 …auto __res = std::__constexpr_wmemcmp(__first1, __first2, std::min(__last1 - __first1, __last2 - _… in __lexicographical_compare()
85 return __last1 - __first1 < __last2 - __first2; in __lexicographical_compare()
[all …]
|
| H A D | set_intersection.h | 55 _InForwardIter2& __first2, in __set_intersection_add_output_if_equal() argument
62 ++__first2; in __set_intersection_add_output_if_equal()
93 _InForwardIter2 __first2, in __set_intersection() argument
102 while (__first2 != __last2) { in __set_intersection()
104 std::__lower_bound_onesided<_AlgPolicy>(__first1, __last1, *__first2, __comp, __proj); in __set_intersection()
109 __first1 == __first1_next, __first1, __first2, __result, __prev_may_be_equal); in __set_intersection()
114 std::__lower_bound_onesided<_AlgPolicy>(__first2, __last2, *__first1, __comp, __proj); in __set_intersection()
115 std::swap(__first2_next, __first2); in __set_intersection()
117 __first2 == __first2_next, __first1, __first2, __result, __prev_may_be_equal); in __set_intersection()
121 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), in __set_intersection()
[all …]
|
| H A D | stable_sort.h | 47 typename iterator_traits<_BidirectionalIterator>::value_type* __first2, in __insertion_sort_move() argument
54 unique_ptr<value_type, __destruct_n&> __h(__first2, __d); in __insertion_sort_move()
55 value_type* __last2 = __first2; in __insertion_sort_move()
64 for (--__j2; __i2 != __first2 && __comp(*__first1, *--__i2); --__j2) in __insertion_sort_move()
80 _InputIterator2 __first2, in __merge_move_construct() argument
91 for (; __first2 != __last2; ++__first2, (void)++__result, __d.template __incr<value_type>()) in __merge_move_construct()
92 std::__construct_at(__result, _Ops::__iter_move(__first2)); in __merge_move_construct()
96 if (__first2 == __last2) { in __merge_move_construct()
102 if (__comp(*__first2, *__first1)) { in __merge_move_construct()
103 std::__construct_at(__result, _Ops::__iter_move(__first2)); in __merge_move_construct()
[all …]
|
| H A D | set_union.h | 43 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_union() argument
45 if (__first2 == __last2) { in __set_union()
48 std::move(__ret1.first), std::move(__first2), std::move((__ret1.second))); in __set_union()
50 if (__comp(*__first2, *__first1)) { in __set_union()
51 *__result = *__first2; in __set_union()
52 ++__first2; in __set_union()
54 if (!__comp(*__first1, *__first2)) { in __set_union()
55 ++__first2; in __set_union()
61 auto __ret2 = std::__copy(std::move(__first2), std::move(__last2), std::move(__result)); in __set_union()
70 _InputIterator2 __first2, in set_union() argument
[all …]
|
| H A D | merge.h | 27 _InputIterator2 __first2, in __merge() argument
32 if (__first2 == __last2) in __merge()
34 if (__comp(*__first2, *__first1)) { in __merge()
35 *__result = *__first2; in __merge()
36 ++__first2; in __merge()
42 return std::copy(__first2, __last2, __result); in __merge()
49 _InputIterator2 __first2, in merge() argument
53 …return std::__merge<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __result, __… in merge()
60 _InputIterator2 __first2, in merge() argument
63 return std::merge(__first1, __last1, __first2, __last2, __result, __less<>()); in merge()
|
| 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 | 34 …_InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result,… in __set_difference() argument
35 while (__first1 != __last1 && __first2 != __last2) { in __set_difference()
36 if (__comp(*__first1, *__first2)) { in __set_difference()
40 } else if (__comp(*__first2, *__first1)) { in __set_difference()
41 ++__first2; in __set_difference()
44 ++__first2; in __set_difference()
54 _InputIterator2 __first2, in set_difference() argument
58 …return std::__set_difference<__comp_ref_type<_Compare> >(__first1, __last1, __first2, __last2, __r… in set_difference()
66 _InputIterator2 __first2, in set_difference() argument
69 return std::__set_difference(__first1, __last1, __first2, __last2, __result, __less<>()).second; in set_difference()
|
| H A D | includes.h | 33 _Iter2 __first2, in __includes() argument
38 for (; __first2 != __last2; ++__first1) { in __includes()
40 std::__invoke(__comp, std::__invoke(__proj2, *__first2), std::__invoke(__proj1, *__first1))) in __includes()
42 … if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __includes()
43 ++__first2; in __includes()
52 _InputIterator2 __first2, in includes() argument
56 …__is_callable<_Compare&, decltype(*__first1), decltype(*__first2)>::value, "The comparator has to … in includes()
61 std::move(__first2), in includes()
70 includes(_InputIterator1 __first1, _InputIterator1 __last1, _InputIterator2 __first2, _InputIterato… in includes() argument
71 …return std::includes(std::move(__first1), std::move(__last1), std::move(__first2), std::move(__las… in includes()
|
| /freebsd/contrib/llvm-project/libcxx/include/__cxx03/__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 | 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 | set_intersection.h | 52 _InForwardIter2& __first2, in __set_intersection_add_output_if_equal() argument
59 ++__first2; in __set_intersection_add_output_if_equal()
89 _InForwardIter2 __first2, in __set_intersection() argument
98 while (__first2 != __last2) { in __set_intersection()
100 std::__lower_bound_onesided<_AlgPolicy>(__first1, __last1, *__first2, __comp, __proj); in __set_intersection()
105 __first1 == __first1_next, __first1, __first2, __result, __prev_may_be_equal); in __set_intersection()
110 std::__lower_bound_onesided<_AlgPolicy>(__first2, __last2, *__first1, __comp, __proj); in __set_intersection()
111 std::swap(__first2_next, __first2); in __set_intersection()
113 __first2 == __first2_next, __first1, __first2, __result, __prev_may_be_equal); in __set_intersection()
117 _IterOps<_AlgPolicy>::next(std::move(__first2), std::move(__last2)), in __set_intersection()
[all …]
|
| H A D | is_permutation.h | 60 _Iter2 __first2,
78 for (auto __j = __first2; __j != __last2; ++__j) {
102 …_ForwardIterator1 __first1, _Sentinel1 __last1, _ForwardIterator2 __first2, _BinaryPredicate&& __p…
104 for (; __first1 != __last1; ++__first1, (void)++__first2) {
105 if (!__pred(*__first1, *__first2))
117 auto __last2 = _IterOps<_AlgPolicy>::next(__first2, __l1);
122 std::move(__first2),
141 _Iter2 __first2,
148 while (__first1 != __last1 && __first2 != __last2) {
149 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
[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 | 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 | search.h | 39 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_forward_impl() argument
40 if (__first2 == __last2) in __search_forward_impl()
49 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_forward_impl()
55 _Iter2 __m2 = __first2; in __search_forward_impl()
85 _Iter2 __first2, in __search_random_access_impl() argument
100 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_random_access_impl()
106 _Iter2 __m2 = __first2; in __search_random_access_impl()
130 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl() argument
131 auto __size2 = __last2 - __first2; in __search_impl()
141 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __search_impl()
[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 | set_union.h | 43 …_InIter1 __first1, _Sent1 __last1, _InIter2 __first2, _Sent2 __last2, _OutIter __result, _Compare&… in __set_union() argument
45 if (__first2 == __last2) { in __set_union()
48 std::move(__ret1.first), std::move(__first2), std::move((__ret1.second))); in __set_union()
50 if (__comp(*__first2, *__first1)) { in __set_union()
51 *__result = *__first2; in __set_union()
52 ++__first2; in __set_union()
54 if (!__comp(*__first1, *__first2)) { in __set_union()
55 ++__first2; in __set_union()
61 …auto __ret2 = std::__copy<_AlgPolicy>(std::move(__first2), std::move(__last2), std::move(__result)… in __set_union()
70 _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 | 34 …_InIter1&& __first1, _Sent1&& __last1, _InIter2&& __first2, _Sent2&& __last2, _OutIter&& __result,… in __set_difference() argument
35 while (__first1 != __last1 && __first2 != __last2) { in __set_difference()
36 if (__comp(*__first1, *__first2)) { in __set_difference()
40 } else if (__comp(*__first2, *__first1)) { in __set_difference()
41 ++__first2; in __set_difference()
44 ++__first2; in __set_difference()
54 _InputIterator2 __first2, in set_difference() argument
59 __first1, __last1, __first2, __last2, __result, __comp) in set_difference()
67 _InputIterator2 __first2, in set_difference() argument
70 …return std::__set_difference<_ClassicAlgPolicy>(__first1, __last1, __first2, __last2, __result, __… in set_difference()
|
| 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()
|
| /freebsd/contrib/llvm-project/libcxx/include/__pstl/internal/ |
| H A D | parallel_backend_utils.h | |