Home
last modified time | relevance | path

Searched refs:_Proj2 (Results 1 – 25 of 35) sorted by relevance

12

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_ends_with.h41 …e <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
49 _Proj2& __proj2) { in __ends_with_fn_impl_bidirectional()
58 …e <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
66 _Proj2& __proj2) { in __ends_with_fn_impl()
97 class _Proj2,
106 _Proj2& __proj2, in __ends_with_fn_impl_with_offset()
132 class _Proj2 = identity>
135 indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
143 _Proj2 __proj2 = {}) const {
152 class _Proj2 = identity>
[all …]
H A Dranges_find_first_of.h36 …e <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
44 _Proj2& __proj2) { in __find_first_of_impl()
60 class _Proj2 = identity>
61 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
69 _Proj2 __proj2 = {}) const {
78 class _Proj2 = identity>
79 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
81 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_is_permutation.h37 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, clas…
45 _Proj2& __proj2) { in __is_permutation_func_impl()
56 …class _Proj2 = identi…
57 …indirect_equivalence_relation<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Pred = ranges…
65 _Proj2 __proj2 = {}) const {
73 class _Proj2 = identity,
75 … projected<iterator_t<_Range2>, _Proj2>> _Pred = ranges::equal_to>
77 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_partial_sort_copy.h52 class _Proj2 = identity>
53 requires indirectly_copyable<_Iter1, _Iter2> && sortable<_Iter2, _Comp, _Proj2> &&
54 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>>
62 _Proj2 __proj2 = {}) const {
78 class _Proj2 = identity>
80 sortable<iterator_t<_Range2>, _Comp, _Proj2> &&
83 projected<iterator_t<_Range2>, _Proj2>>
86 …_Range1&& __range, _Range2&& __result_range, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj… in operator()
H A Dranges_lexicographical_compare.h37 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, clas…
45 _Proj2& __proj2) { in __lexicographical_compare_unwrap()
63 … class _Proj2 = identity,
64 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
72 _Proj2 __proj2 = {}) const {
80 class _Proj2 = identity,
81 …t_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>
84 …_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_mismatch.h43 template <class _I1, class _S1, class _I2, class _S2, class _Pred, class _Proj1, class _Proj2>
45 …__go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2&… in __go()
65 class _Proj2 = identity>
66 requires indirectly_comparable<_I1, _I2, _Pred, _Proj1, _Proj2>
68 …S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) in operator()
77 class _Proj2 = identity>
78 requires indirectly_comparable<iterator_t<_R1>, iterator_t<_R2>, _Pred, _Proj1, _Proj2>
81 …operator()(_R1&& __r1, _R2&& __r2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) co… in operator()
H A Dranges_search.h37 …e <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
45 _Proj2& __proj2) { in __ranges_search_impl()
77 class _Proj2 = identity>
78 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
86 _Proj2 __proj2 = {}) const {
94 class _Proj2 = identity>
95 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
97 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_merge.h50 class _Proj2 = identity>
51 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
60 _Proj2 __proj2 = {}) const {
69 class _Proj2 = identity>
70 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
77 _Proj2 __proj2 = {}) const {
96 class _Proj2>
107 _Proj2&& __proj2) { in __merge_impl()
H A Dmismatch.h40 template <class _Iter1, class _Sent1, class _Iter2, class _Pred, class _Proj1, class _Proj2>
42 …Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __mismatch_loop()
52 template <class _Iter1, class _Sent1, class _Iter2, class _Pred, class _Proj1, class _Proj2>
54 __mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2… in __mismatch()
124 class _Proj2,
126 __is_identity<_Proj1>::value && __is_identity<_Proj2>::value,
129 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred&, _Proj1&, _Proj2&) { in __mismatch() argument
136 class _Proj2,
138 __is_identity<_Proj1>::value && __is_identity<_Proj2>::value &&
142 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __pr… in __mismatch()
[all …]
H A Dranges_starts_with.h42 class _Proj2 = identity>
43 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
51 _Proj2 __proj2 = {}) {
67 class _Proj2 = identity>
68 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
70 …operator()(_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 … in operator()
H A Dranges_includes.h44 … class _Proj2 = identity,
45 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
53 _Proj2 __proj2 = {}) const {
67 class _Proj2 = identity,
68 …t_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>
71 …_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_contains_subrange.h45 class _Proj2 = identity>
46 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
54 _Proj2 __proj2 = {}) {
67 class _Proj2 = identity>
68 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
70 …operator()(_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 … in operator()
H A Dranges_find_end.h45 class _Proj2 = identity>
46 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
54 _Proj2 __proj2 = {}) const {
72 class _Proj2 = identity>
73 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
75 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_set_difference.h52 class _Proj2 = identity>
53 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
62 _Proj2 __proj2 = {}) const {
73 class _Proj2 = identity>
74 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
81 _Proj2 __proj2 = {}) const {
H A Dranges_set_union.h53 class _Proj2 = identity>
54 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
63 _Proj2 __proj2 = {}) const {
79 class _Proj2 = identity>
80 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
87 _Proj2 __proj2 = {}) const {
H A Dranges_set_symmetric_difference.h50 class _Proj2 = identity>
51 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
60 _Proj2 __proj2 = {}) const {
76 class _Proj2 = identity>
77 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
86 _Proj2 __proj2 = {}) const {
H A Dranges_equal.h44 class _Proj2 = identity>
45 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
53 _Proj2 __proj2 = {}) const {
74 class _Proj2 = identity>
75 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
77 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_set_intersection.h51 class _Proj2 = identity>
52 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
61 _Proj2 __proj2 = {}) const {
77 class _Proj2 = identity>
78 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
87 _Proj2 __proj2 = {}) const {
H A Dranges_transform.h65 class _Proj2>
74 _Proj2& __projection2) { in __binary()
111 class _Proj2 = identity>
113 … indirect_result_t<_Func&, projected<_InIter1, _Proj1>, projected<_InIter2, _Proj2>>>
122 _Proj2 __projection2 = {}) const {
139 class _Proj2 = identity>
142 …t_result_t<_Func&, projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>>
151 _Proj2 __projection2 = {}) const {
H A Dsearch.h38 class _Proj2>
40 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_forward_impl()
80 class _Proj2,
90 _Proj2& __proj2, in __search_random_access_impl()
126 class _Proj2,
131 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl()
152 class _Proj2,
158 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl()
H A Dlexicographical_compare.h42 template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, class…
44 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Comp& __comp, _Proj1& __proj1, _Proj2& __proj2) { in __lexicographical_compare()
66 class _Proj2,
70 __is_identity<_Proj1>::value && __is_identity<_Proj2>::value,
73 …hical_compare(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Tp* __last2, _Comp&, _Proj1&, _Proj2&) { in __lexicographical_compare() argument
H A Dis_permutation.h71 class _Proj2,
80 _Proj2&& __proj2) {
152 class _Proj2,
161 _Proj2&& __proj2,
195 class _Proj2,
204 _Proj2&& __proj2,
226 class _Proj2,
235 _Proj2&& __proj2) {
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__algorithm/
H A Dmismatch.h39 template <class _Iter1, class _Sent1, class _Iter2, class _Pred, class _Proj1, class _Proj2>
41 …Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __mismatch_loop()
51 template <class _Iter1, class _Sent1, class _Iter2, class _Pred, class _Proj1, class _Proj2>
53 __mismatch(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _Proj2… in __mismatch()
123 class _Proj2,
125 __is_identity<_Proj1>::value && __is_identity<_Proj2>::value,
128 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred&, _Proj1&, _Proj2&) { in __mismatch() argument
135 class _Proj2,
137 __is_identity<_Proj1>::value && __is_identity<_Proj2>::value &&
141 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred& __pred, _Proj1& __proj1, _Proj2& __pr… in __mismatch()
H A Dsearch.h37 class _Proj2>
39 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_forward_impl()
79 class _Proj2,
89 _Proj2& __proj2, in __search_random_access_impl()
125 class _Proj2,
130 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl()
151 class _Proj2,
157 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2& __proj2) { in __search_impl()
H A Dis_permutation.h55 class _Proj2,
64 _Proj2&& __proj2) {
136 class _Proj2,
145 _Proj2&& __proj2,
179 class _Proj2,
188 _Proj2&& __proj2,
210 class _Proj2,
219 _Proj2&& __proj2) {

12