| /llvm-project-15.0.7/libcxx/include/__algorithm/ |
| H A D | ranges_lexicographical_compare.h | 40 _Proj2& __proj2) { in __lexicographical_compare_impl()
43 || std::invoke(__comp, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __lexicographical_compare_impl()
45 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) in __lexicographical_compare_impl()
63 _Proj2 __proj2 = {}) const {
68 __proj2);
78 … __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
83 __proj2);
|
| H A D | search.h | 41 _Proj2& __proj2) { in __search_forward_impl() argument
51 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_forward_impl()
66 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) in __search_forward_impl()
88 _Proj2& __proj2, in __search_random_access_impl() argument
99 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __search_random_access_impl()
110 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) { in __search_random_access_impl()
128 _Proj2& __proj2,
145 __proj2,
160 _Proj2& __proj2,
169 __proj2);
|
| H A D | ranges_search.h | 45 _Proj2& __proj2) { in __ranges_search_impl()
60 __first1, __last1, __first2, __last2, __pred, __proj1, __proj2, __size1, __size2); in __ranges_search_impl()
67 …arch_forward_impl<_RangeAlgPolicy>(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2); in __ranges_search_impl()
82 _Proj2 __proj2 = {}) const {
83 return __ranges_search_impl(__first1, __last1, __first2, __last2, __pred, __proj1, __proj2);
97 _Proj2 __proj2 = {}) const {
119 __proj2);
|
| H A D | ranges_is_permutation.h | 40 _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __is_permutation_func_impl()
43 __pred, __proj1, __proj2); in __is_permutation_func_impl()
54 _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
57 __pred, __proj1, __proj2);
67 _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
75 __pred, __proj1, __proj2);
|
| H A D | ranges_find_first_of.h | 41 _Proj2& __proj2) { in __find_first_of_impl()
44 if (std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__j))) in __find_first_of_impl()
62 _Proj2 __proj2 = {}) const {
67 __proj2);
81 _Proj2 __proj2 = {}) const {
86 __proj2);
|
| H A D | ranges_mismatch.h | 44 _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __go()
46 if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __go()
60 … _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
61 … return __go(std::move(__first1), __last1, std::move(__first2), __last2, __pred, __proj1, __proj2);
69 …operator()(_R1&& __r1, _R2&& __r2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) co… in operator()
71 __pred, __proj1, __proj2);
|
| H A D | ranges_equal.h | 45 _Proj2& __proj2) { in __equal_impl()
47 if (!std::invoke(__pred, std::invoke(__proj1, *__first1), std::invoke(__proj2, *__first2))) in __equal_impl()
68 _Proj2 __proj2 = {}) const {
77 __proj2);
91 _Proj2 __proj2 = {}) const {
100 __proj2);
|
| H A D | find_end.h | 47 _Proj2& __proj2, in __find_end_impl() argument
59 … if (std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __find_end_impl()
76 if (!std::__invoke(__pred, std::__invoke(__proj1, *__m1), std::__invoke(__proj2, *__m2))) in __find_end_impl()
101 _Proj2& __proj2, in __find_end() argument
117 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
130 if (!std::__invoke(__pred, std::__invoke(__proj1, *--__m1), std::__invoke(__proj2, *--__m2))) in __find_end()
154 _Proj2& __proj2, in __find_end() argument
175 if (std::__invoke(__pred, std::__invoke(__proj1, *--__l1), std::__invoke(__proj2, *__l2))) in __find_end()
|
| H A D | ranges_merge.h | 59 _Proj2&& __proj2) { in __merge_impl() argument
61 if (std::invoke(__comp, std::invoke(__proj2, *__first2), std::invoke(__proj1, *__first1))) { in __merge_impl()
93 _Proj2 __proj2 = {}) const {
94 …rn __merge::__merge_impl(__first1, __last1, __first2, __last2, __result, __comp, __proj1, __proj2);
118 _Proj2 __proj2 = {}) const {
127 __proj2);
|
| H A D | is_permutation.h | 60 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2) {
75 if (std::__invoke(__pred, std::__invoke(__proj1, *__i), std::__invoke(__proj2, *__j)))
127 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2,
131 … if (!std::__invoke(__pred, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2)))
152 __pred, __proj1, __proj2);
161 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2,
167 __pred, __proj1, __proj2,
177 _Pred&& __pred, _Proj1&& __proj1, _Proj2&& __proj2) {
180 __pred, __proj1, __proj2,
|
| H A D | ranges_includes.h | 53 _Proj2 __proj2 = {}) const {
61 std::move(__proj2));
72 … __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
80 std::move(__proj2));
|
| H A D | ranges_find_end.h | 47 _Proj2 __proj2 = {}) const {
55 __proj2,
72 _Proj2 __proj2 = {}) const {
80 __proj2,
|
| H A D | ranges_set_difference.h | 61 _Proj2 __proj2 = {}) const {
63 …t1, __last1, __first2, __last2, __result, ranges::__make_projected_comp(__comp, __proj1, __proj2));
82 _Proj2 __proj2 = {}) const {
89 ranges::__make_projected_comp(__comp, __proj1, __proj2));
|
| H A D | ranges_partial_sort_copy.h | 53 _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const { in operator()
56 __comp, __proj1, __proj2
70 _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
73 __comp, __proj1, __proj2
|
| H A D | ranges_set_union.h | 63 _Proj2 __proj2 = {}) const {
70 ranges::__make_projected_comp(__comp, __proj1, __proj2));
97 _Proj2 __proj2 = {}) const {
104 ranges::__make_projected_comp(__comp, __proj1, __proj2));
|
| H A D | ranges_set_symmetric_difference.h | 60 _Proj2 __proj2 = {}) const {
67 ranges::__make_projected_comp(__comp, __proj1, __proj2));
94 _Proj2 __proj2 = {}) const {
101 ranges::__make_projected_comp(__comp, __proj1, __proj2));
|
| H A D | ranges_set_intersection.h | 61 _Proj2 __proj2 = {}) const {
68 ranges::__make_projected_comp(__comp, __proj1, __proj2));
95 _Proj2 __proj2 = {}) const {
102 ranges::__make_projected_comp(__comp, __proj1, __proj2));
|
| H A D | includes.h | 30 _Comp&& __comp, _Proj1&& __proj1, _Proj2&& __proj2) { in __includes() argument
33 __comp, std::__invoke(__proj2, *__first2), std::__invoke(__proj1, *__first1))) in __includes()
35 … if (!std::__invoke(__comp, std::__invoke(__proj1, *__first1), std::__invoke(__proj2, *__first2))) in __includes()
|
| H A D | partial_sort_copy.h | 39 _Compare&& __comp, _Proj1&& __proj1, _Proj2&& __proj2) in __partial_sort_copy() argument
42 auto&& __projected_comp = std::__make_projected(__comp, __proj2); in __partial_sort_copy()
51 …if (std::__invoke(__comp, std::__invoke(__proj1, *__first), std::__invoke(__proj2, *__result_first… in __partial_sort_copy()
|
| H A D | make_projected.h | 104 decltype(auto) __make_projected_comp(_Comp& __comp, _Proj1& __proj1, _Proj2& __proj2) {
115 std::invoke(__proj2, std::forward<decltype(__rhs)>(__rhs)));
|