Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_find_first_of.h36 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class…
43 _Proj1& __proj1, in __find_first_of_impl()
59 class _Proj1 = identity,
61 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
68 _Proj1 __proj1 = {},
77 class _Proj1 = 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…
44 _Proj1& __proj1, in __is_permutation_func_impl()
55 …class _Proj1 = identi…
57 …indirect_equivalence_relation<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Pred = ranges…
64 _Proj1 __proj1 = {},
72 class _Proj1 = identity,
74 indirect_equivalence_relation<projected<iterator_t<_Range1>, _Proj1>,
77 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_ends_with.h41 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class…
48 _Proj1& __proj1, in __ends_with_fn_impl_bidirectional()
58 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class…
65 _Proj1& __proj1, in __ends_with_fn_impl()
96 class _Proj1,
105 _Proj1& __proj1, in __ends_with_fn_impl_with_offset()
131 class _Proj1 = identity,
135 indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
142 _Proj1 __proj1 = {},
151 class _Proj1 = identity,
[all …]
H A Dranges_lexicographical_compare.h37 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, clas…
44 _Proj1& __proj1, in __lexicographical_compare_unwrap()
62 … class _Proj1 = identity,
64 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
71 _Proj1 __proj1 = {},
79 class _Proj1 = identity,
81 …indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, …
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()
64 class _Proj1 = identity,
66 requires indirectly_comparable<_I1, _I2, _Pred, _Proj1, _Proj2>
68 …_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Pro… in operator()
76 class _Proj1 = 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 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class…
44 _Proj1& __proj1, in __ranges_search_impl()
76 class _Proj1 = identity,
78 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
85 _Proj1 __proj1 = {},
93 class _Proj1 = 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.h49 class _Proj1 = identity,
51 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
59 _Proj1 __proj1 = {},
68 class _Proj1 = identity,
70 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
76 _Proj1 __proj1 = {},
95 class _Proj1,
106 _Proj1&& __proj1, in __merge_impl()
H A Dranges_starts_with.h41 class _Proj1 = identity,
43 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
50 _Proj1 __proj1 = {},
66 class _Proj1 = 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.h43 … class _Proj1 = identity,
45 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
52 _Proj1 __proj1 = {},
66 class _Proj1 = identity,
68 …indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, …
71 …_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_contains_subrange.h44 class _Proj1 = identity,
46 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
53 _Proj1 __proj1 = {},
66 class _Proj1 = 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 Dmismatch.h40 template <class _Iter1, class _Sent1, class _Iter2, class _Pred, class _Proj1, class _Proj2>
42 __mismatch_loop(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _… 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()
123 class _Proj1,
126 __is_identity<_Proj1>::value && __is_identity<_Proj2>::value,
129 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred&, _Proj1&, _Proj2&) { in __mismatch() argument
135 class _Proj1,
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_find_end.h44 class _Proj1 = identity,
46 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
53 _Proj1 __proj1 = {},
71 class _Proj1 = 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.h51 class _Proj1 = identity,
53 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
61 _Proj1 __proj1 = {},
72 class _Proj1 = identity,
74 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
80 _Proj1 __proj1 = {},
H A Dranges_partial_sort_copy.h51 class _Proj1 = identity,
54 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>>
61 _Proj1 __proj1 = {},
77 class _Proj1 = identity,
82 projected<iterator_t<_Range1>, _Proj1>,
86 …_Range1&& __range, _Range2&& __result_range, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj… in operator()
H A Dranges_set_union.h52 class _Proj1 = identity,
54 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
62 _Proj1 __proj1 = {},
78 class _Proj1 = identity,
80 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
86 _Proj1 __proj1 = {},
H A Dranges_set_symmetric_difference.h49 class _Proj1 = identity,
51 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
59 _Proj1 __proj1 = {},
75 class _Proj1 = identity,
77 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
85 _Proj1 __proj1 = {},
H A Dranges_equal.h43 class _Proj1 = identity,
45 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
52 _Proj1 __proj1 = {},
73 class _Proj1 = 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.h50 class _Proj1 = identity,
52 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2>
60 _Proj1 __proj1 = {},
76 class _Proj1 = identity,
78 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
86 _Proj1 __proj1 = {},
H A Dranges_transform.h64 class _Proj1,
73 _Proj1& __projection1, in __binary()
110 class _Proj1 = identity,
113 … indirect_result_t<_Func&, projected<_InIter1, _Proj1>, projected<_InIter2, _Proj2>>>
121 _Proj1 __projection1 = {}, in operator()
138 class _Proj1 = identity,
142 …indirect_result_t<_Func&, projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _…
150 _Proj1 __projection1 = {}, in operator()
H A Dsearch.h37 class _Proj1,
40 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_forward_impl()
79 class _Proj1,
89 _Proj1& __proj1, in __search_random_access_impl()
125 class _Proj1,
131 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl()
151 class _Proj1,
158 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl()
H A Dlexicographical_compare.h42 template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, class…
44 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Comp& __comp, _Proj1& __proj1, … in __lexicographical_compare()
65 class _Proj1,
70 __is_identity<_Proj1>::value && __is_identity<_Proj2>::value,
73 __lexicographical_compare(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Tp* __last2, _Comp&, _Proj1&… in __lexicographical_compare() argument
H A Dis_permutation.h70 class _Proj1,
79 _Proj1&& __proj1,
151 class _Proj1,
160 _Proj1&& __proj1,
194 class _Proj1,
203 _Proj1&& __proj1,
225 class _Proj1,
234 _Proj1&& __proj1,
/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 __mismatch_loop(_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Pred& __pred, _Proj1& __proj1, _… 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()
122 class _Proj1,
125 __is_identity<_Proj1>::value && __is_identity<_Proj2>::value,
128 __mismatch(_Tp* __first1, _Tp* __last1, _Tp* __first2, _Pred&, _Proj1&, _Proj2&) { in __mismatch() argument
134 class _Proj1,
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.h36 class _Proj1,
39 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_forward_impl()
78 class _Proj1,
88 _Proj1& __proj1, in __search_random_access_impl()
124 class _Proj1,
130 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl()
150 class _Proj1,
157 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __pred, _Proj1& __proj1, … in __search_impl()
H A Dis_permutation.h54 class _Proj1,
63 _Proj1&& __proj1,
135 class _Proj1,
144 _Proj1&& __proj1,
178 class _Proj1,
187 _Proj1&& __proj1,
209 class _Proj1,
218 _Proj1&& __proj1,

12