Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dranges_partial_sort_copy.h54 class _Proj2 = identity> in operator()
55 requires indirectly_copyable<_Iter1, _Iter2> && sortable<_Iter2, _Comp, _Proj2> && in operator()
56 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> in operator()
64 _Proj2 __proj2 = {}) const {
80 class _Proj2 = identity>
82 sortable<iterator_t<_Range2>, _Comp, _Proj2> &&
85 projected<iterator_t<_Range2>, _Proj2>> in operator()
88 _Range1&& __range, _Range2&& __result_range, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
H A Dranges_is_permutation.h38 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, clas…
46 _Proj2& __proj2) { in __is_permutation_func_impl()
57 …class _Proj2 = identi…
58 …indirect_equivalence_relation<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Pred = ranges…
66 _Proj2 __proj2 = {}) const {
74 class _Proj2 = identity,
76 … projected<iterator_t<_Range2>, _Proj2>> _Pred = ranges::equal_to>
78 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_lexicographical_compare.h36 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, clas…
44 _Proj2& __proj2) { in __lexicographical_compare_impl()
61 … class _Proj2 = identity,
62 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
70 _Proj2 __proj2 = {}) const {
78 class _Proj2 = identity,
79 …t_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>
82 …_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_find_first_of.h37 …e <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
45 _Proj2& __proj2) { in __find_first_of_impl()
61 class _Proj2 = identity>
62 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
70 _Proj2 __proj2 = {}) const {
79 class _Proj2 = identity>
80 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
82 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
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_merge.h51 class _Proj2>
62 _Proj2&& __proj2) { in __merge_impl()
85 class _Proj2 = identity> in operator()
86 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator()
95 _Proj2 __proj2 = {}) const {
104 class _Proj2 = identity> in operator()
105 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2> in operator()
112 _Proj2 __proj2 = {}) const {
H A Dranges_search.h38 …e <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
46 _Proj2& __proj2) { in __ranges_search_impl()
78 class _Proj2 = identity>
79 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
87 _Proj2 __proj2 = {}) const {
95 class _Proj2 = identity>
96 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
98 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_mismatch.h44 template <class _I1, class _S1, class _I2, class _S2, class _Pred, class _Proj1, class _Proj2>
46 …__go(_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred& __pred, _Proj1& __proj1, _Proj2&… in __go()
66 class _Proj2 = identity>
67 requires indirectly_comparable<_I1, _I2, _Pred, _Proj1, _Proj2>
69 …S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) in operator()
78 class _Proj2 = identity>
79 requires indirectly_comparable<iterator_t<_R1>, iterator_t<_R2>, _Pred, _Proj1, _Proj2>
82 …operator()(_R1&& __r1, _R2&& __r2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) co… in operator()
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()
[all …]
H A Dranges_starts_with.h43 class _Proj2 = identity>
44 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
52 _Proj2 __proj2 = {}) {
68 class _Proj2 = identity>
69 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
71 …operator()(_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 … in operator()
H A Dranges_includes.h46 … class _Proj2 = identity,
47 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l…
55 _Proj2 __proj2 = {}) const {
69 class _Proj2 = identity,
70 …t_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>
73 …_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_find_end.h46 class _Proj2 = identity>
47 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
55 _Proj2 __proj2 = {}) const {
73 class _Proj2 = identity>
74 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
76 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_contains_subrange.h46 class _Proj2 = identity>
47 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
55 _Proj2 __proj2 = {}) {
68 class _Proj2 = identity>
69 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
71 …operator()(_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 … in operator()
H A Dranges_set_difference.h55 class _Proj2 = identity> in operator()
56 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator()
65 _Proj2 __proj2 = {}) const {
76 class _Proj2 = identity> in operator()
77 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2> in operator()
84 _Proj2 __proj2 = {}) const {
H A Dranges_set_intersection.h53 class _Proj2 = identity> in operator()
54 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator()
63 _Proj2 __proj2 = {}) const {
79 class _Proj2 = identity>
80 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
89 _Proj2 __proj2 = {}) const {
H A Dranges_set_union.h56 class _Proj2 = identity> in operator()
57 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator()
66 _Proj2 __proj2 = {}) const {
82 class _Proj2 = identity> in operator()
83 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2> in operator()
90 _Proj2 __proj2 = {}) const {
H A Dranges_set_symmetric_difference.h53 class _Proj2 = identity> in operator()
54 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator()
63 _Proj2 __proj2 = {}) const {
79 class _Proj2 = identity>
80 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2>
89 _Proj2 __proj2 = {}) const {
H A Dranges_equal.h45 class _Proj2 = identity>
46 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2>
54 _Proj2 __proj2 = {}) const {
75 class _Proj2 = identity>
76 requires indirectly_comparable<iterator_t<_Range1>, iterator_t<_Range2>, _Pred, _Proj1, _Proj2>
78 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
H A Dranges_transform.h66 class _Proj2> in __binary()
75 _Proj2& __projection2) { in __binary()
112 class _Proj2 = identity> in operator()
114 indirect_result_t<_Func&, projected<_InIter1, _Proj1>, projected<_InIter2, _Proj2>>> in operator()
123 _Proj2 __projection2 = {}) const {
140 class _Proj2 = identity>
143 indirect_result_t<_Func&, projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>>
152 _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 Dis_permutation.h70 class _Proj2,
79 _Proj2&& __proj2) {
151 class _Proj2,
160 _Proj2&& __proj2,
194 class _Proj2,
203 _Proj2&& __proj2,
225 class _Proj2,
234 _Proj2&& __proj2) {
H A Dfind_end.h38 class _Proj2>
46 _Proj2& __proj2, in __find_end_impl()
90 class _Proj2>
98 _Proj2& __proj2, in __find_end()
141 class _Proj2>
149 _Proj2& __proj2, in __find_end()
H A Dequal.h72 …e <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class _Proj2>
74 …_Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __comp, _Proj1& __proj1, _Proj2& __proj2) { in __equal_impl()
88 class _Proj2,
90 … __is_identity<_Proj2>::value && !is_volatile<_Tp>::value && !is_volatile<_Up>::value &&
94 __equal_impl(_Tp* __first1, _Tp* __last1, _Up* __first2, _Up*, _Pred&, _Proj1&, _Proj2&) { in __equal_impl() argument
H A Dmake_projected.h83 template <class _Comp, class _Proj1, class _Proj2>
84 …I constexpr decltype(auto) __make_projected_comp(_Comp& __comp, _Proj1& __proj1, _Proj2& __proj2) { in decltype()
85 if constexpr (__is_identity<decay_t<_Proj1>>::value && __is_identity<decay_t<_Proj2>>::value && in decltype()
/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Dmergeable.h32 class _Proj2 = identity>
36 indirect_strict_weak_order<_Comp, projected<_Input1, _Proj1>, projected<_Input2, _Proj2>>;

12