| /freebsd-14.2/contrib/llvm-project/libcxx/include/__algorithm/ |
| H A D | ranges_ends_with.h | 49 _Proj2& __proj2) { in __ends_with_fn_impl_bidirectional()
55 … __rbegin1, __rend1, __rbegin2, __rend2, std::ref(__pred), std::ref(__proj1), std::ref(__proj2)); in __ends_with_fn_impl_bidirectional()
66 _Proj2& __proj2) { in __ends_with_fn_impl()
69 … __ends_with_fn_impl_bidirectional(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2); in __ends_with_fn_impl()
86 __proj2, in __ends_with_fn_impl()
106 _Proj2& __proj2, in __ends_with_fn_impl_with_offset()
122 std::ref(__proj2)); in __ends_with_fn_impl_with_offset()
143 _Proj2 __proj2 = {}) const {
156 … __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
173 __proj2,
[all …]
|
| H A D | ranges_lexicographical_compare.h | 44 _Proj2& __proj2) { 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()
70 _Proj2 __proj2 = {}) const {
72 …(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __comp, __proj1, __proj2);
82 … __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
90 __proj2);
|
| H A D | search.h | 40 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_forward_impl() argument
50 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_forward_impl()
65 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_forward_impl()
90 _Proj2& __proj2, in __search_random_access_impl() argument
101 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_random_access_impl()
112 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_random_access_impl()
128 _Proj2& __proj2,
141 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2);
152 _Proj2& __proj2,
156 …ch_forward_impl<_ClassicAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
|
| H A D | ranges_search.h | 46 _Proj2& __proj2) { in __ranges_search_impl()
61 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __ranges_search_impl()
68 …arch_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2); in __ranges_search_impl()
87 _Proj2 __proj2 = {}) const {
88 return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
98 … __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
120 __proj2);
|
| H A D | ranges_find_first_of.h | 45 _Proj2& __proj2) { in __find_first_of_impl()
48 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) in __find_first_of_impl()
70 _Proj2 __proj2 = {}) const {
72 …(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2);
82 … __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
90 __proj2);
|
| H A D | ranges_is_permutation.h | 46 _Proj2& __proj2) { in __is_permutation_func_impl()
48 …(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2); in __is_permutation_func_impl()
66 _Proj2 __proj2 = {}) const {
68 …(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2);
78 … __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
91 __proj2);
|
| H A D | ranges_mismatch.h | 44 …_first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __go()
46 if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __go()
63 …S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) in operator()
65 … return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
76 …operator()(_R1&& __r1, _R2&& __r2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) co… in operator()
78 …:begin(__r1), ranges::end(__r1), ranges::begin(__r2), ranges::end(__r2), __pred, __proj1, __proj2);
|
| H A D | find_end.h | 46 _Proj2& __proj2, in __find_end_impl() argument
58 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __find_end_impl()
75 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __find_end_impl()
98 _Proj2& __proj2, in __find_end() argument
114 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
127 … if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(__proj2, *--__m2))) { in __find_end()
149 _Proj2& __proj2, in __find_end() argument
170 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
|
| H A D | ranges_merge.h | 62 _Proj2&& __proj2) { in __merge_impl() argument
64 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) { in __merge_impl()
95 _Proj2 __proj2 = {}) const {
96 …rn __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __proj2);
112 _Proj2 __proj2 = {}) const {
121 __proj2);
|
| H A D | is_permutation.h | 79 _Proj2&& __proj2) {
94 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j)))
160 _Proj2&& __proj2,
164 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
184 …(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2);
203 _Proj2&& __proj2,
214 __proj2,
234 _Proj2&& __proj2) {
242 __proj2,
|
| H A D | ranges_includes.h | 55 _Proj2 __proj2 = {}) const {
63 std::move(__proj2));
73 … __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
81 std::move(__proj2));
|
| H A D | ranges_starts_with.h | 52 _Proj2 __proj2 = {}) const {
60 __proj2)
71 … __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
79 __proj2)
|
| H A D | ranges_find_end.h | 55 _Proj2 __proj2 = {}) const {
63 __proj2,
76 … __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
84 __proj2,
|
| H A D | ranges_set_difference.h | 65 _Proj2 __proj2 = {}) const {
67 …t1, __last1, __first2, __last2, __result, ranges::__make_projected_comp(__comp, __proj1, __proj2));
84 _Proj2 __proj2 = {}) const {
91 ranges::__make_projected_comp(__comp, __proj1, __proj2));
|
| H A D | ranges_partial_sort_copy.h | 64 _Proj2 __proj2 = {}) const {
72 __proj2);
88 …nge, _Range2&& __result_range, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
96 __proj2);
|
| H A D | ranges_set_union.h | 66 _Proj2 __proj2 = {}) const {
73 ranges::__make_projected_comp(__comp, __proj1, __proj2));
90 _Proj2 __proj2 = {}) const {
97 ranges::__make_projected_comp(__comp, __proj1, __proj2));
|
| H A D | ranges_set_symmetric_difference.h | 63 _Proj2 __proj2 = {}) const {
70 ranges::__make_projected_comp(__comp, __proj1, __proj2));
89 _Proj2 __proj2 = {}) const {
96 ranges::__make_projected_comp(__comp, __proj1, __proj2));
|
| H A D | ranges_equal.h | 54 _Proj2 __proj2 = {}) const {
68 __proj2);
78 … __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
92 __proj2);
|
| H A D | ranges_set_intersection.h | 63 _Proj2 __proj2 = {}) const {
70 ranges::__make_projected_comp(__comp, __proj1, __proj2));
89 _Proj2 __proj2 = {}) const {
96 ranges::__make_projected_comp(__comp, __proj1, __proj2));
|
| H A D | includes.h | 38 _Proj2&& __proj2) { in __includes() argument
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()
|
| H A D | partial_sort_copy.h | 51 _Proj2&& __proj2) { in __partial_sort_copy() argument
53 auto&& __projected_comp = std::__make_projected(__comp, __proj2); in __partial_sort_copy()
61 …if (std::__invoke(__comp, std::__invoke(__proj1, *__first), std::__invoke(__proj2, *__result_first… in __partial_sort_copy()
|
| H A D | make_projected.h | 84 …I constexpr decltype(auto) __make_projected_comp(_Comp& __comp, _Proj1& __proj1, _Proj2& __proj2) { in decltype()
95 std::invoke(__proj2, std::forward<decltype(__rhs)>(__rhs))); in decltype()
|
| H A D | equal.h | 89 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __comp, _Proj1& __proj1, _Proj2& __proj2) { in __equal_impl() argument
91 … if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __equal_impl()
|