| /freebsd/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()
111 …(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2); in __ends_with_fn_impl_with_offset()
122 std::ref(__proj2)); in __ends_with_fn_impl_with_offset()
143 _Proj2 __proj2 = {}) const {
145 …(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __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()
131 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl() argument
142 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __search_impl()
158 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl() argument
159 …ch_forward_impl<_ClassicAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2); in __search_impl()
|
| H A D | ranges_mismatch.h | 46 …_first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __go()
51 …smatch(__range1.first, __range1.second, __range2.first, __range2.second, __pred, __proj1, __proj2); in __go()
55 …(__first1), std::move(__last1), std::move(__first2), std::move(__last2), __pred, __proj1, __proj2); in __go()
69 …S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) in operator()
71 … return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
82 …operator()(_R1&& __r1, _R2&& __r2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) co… in operator()
84 …:begin(__r1), ranges::end(__r1), ranges::begin(__r2), ranges::end(__r2), __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_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_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 | 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()
64 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) { in __merge_impl()
95 _Proj2 __proj2 = {}) const {
96 return __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __proj2);
112 _Proj2 __proj2 = {}) const {
121 __proj2);
59 __merge_impl(_InIter1 && __first1,_Sent1 && __last1,_InIter2 && __first2,_Sent2 && __last2,_OutIter && __result,_Comp && __comp,_Proj1 && __proj1,_Proj2 && __proj2) __merge_impl() argument
|
| H A D | mismatch.h | 41 …Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __mismatch_loop() argument
43 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __mismatch_loop()
53 …Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __mismatch() argument
54 return std::__mismatch_loop(__first1, __last1, __first2, __pred, __proj1, __proj2); in __mismatch()
141 …atch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __mismatch() argument
143 return std::__mismatch_loop(__first1, __last1, __first2, __pred, __proj1, __proj2); in __mismatch()
170 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __mismatch() argument
172 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __mismatch()
182 …rst1, _Tp* __last1, _Tp* __first2, _Tp* __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __mismatch() argument
184 return std::__mismatch(__first1, __first1 + __len, __first2, __pred, __proj1, __proj2); in __mismatch()
|
| 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_starts_with.h | 52 _Proj2 __proj2 = {}) {
60 __proj2)
71 …nge1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) { in operator()
79 __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_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_contains_subrange.h | 55 _Proj2 __proj2 = {}) {
60 …ve(__first1), __last1, std::move(__first2), __last2, __pred, std::ref(__proj1), std::ref(__proj2));
71 …nge1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) { in operator()
80 auto __ret = ranges::search(__range1, __range2, __pred, std::ref(__proj1), std::ref(__proj2));
|
| H A D | ranges_set_difference.h | 65 _Proj2 __proj2 = {}) const {
67 __first1, __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 _Range1&& __range, _Range2&& __result_range, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
96 __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 | 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 | 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()
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))) {
39 __partial_sort_copy(_InputIterator __first,_Sentinel1 __last,_RandomAccessIterator __result_first,_Sentinel2 __result_last,_Compare && __comp,_Proj1 && __proj1,_Proj2 && __proj2) __partial_sort_copy() argument
|
| 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 | 74 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __comp, _Proj1& __proj1, _Proj2& __proj2) { in __equal_impl() argument
76 … if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __equal_impl()
|