/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | ranges_ends_with.h | 41 …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 D | ranges_is_permutation.h | 38 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, clas… 45 _Proj1& __proj1, in __is_permutation_func_impl() 56 …class _Proj1 = identi… 58 …indirect_equivalence_relation<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Pred = ranges… 65 _Proj1 __proj1 = {}, 73 class _Proj1 = identity, 75 indirect_equivalence_relation<projected<iterator_t<_Range1>, _Proj1>, 78 …_Range1&& __range1, _Range2&& __range2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
|
H A D | ranges_lexicographical_compare.h | 36 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Proj1, class _Proj2, clas… 43 _Proj1& __proj1, in __lexicographical_compare_impl() 60 … class _Proj1 = identity, 62 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l… 69 _Proj1 __proj1 = {}, 77 class _Proj1 = identity, 79 …indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, … 82 …_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
|
H A D | ranges_find_first_of.h | 37 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class… 44 _Proj1& __proj1, in __find_first_of_impl() 60 class _Proj1 = identity, 62 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> 69 _Proj1 __proj1 = {}, 78 class _Proj1 = 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 D | ranges_merge.h | 50 class _Proj1, 61 _Proj1&& __proj1, in __merge_impl() 84 class _Proj1 = identity, in operator() 86 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator() 94 _Proj1 __proj1 = {}, 103 class _Proj1 = identity, 105 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2> in operator() 111 _Proj1 __proj1 = {},
|
H A D | ranges_mismatch.h | 44 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() 65 class _Proj1 = identity, 67 requires indirectly_comparable<_I1, _I2, _Pred, _Proj1, _Proj2> 69 …_I1 __first1, _S1 __last1, _I2 __first2, _S2 __last2, _Pred __pred = {}, _Proj1 __proj1 = {}, _Pro… in operator() 77 class _Proj1 = 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 D | ranges_search.h | 38 …template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class… 45 _Proj1& __proj1, in __ranges_search_impl() 77 class _Proj1 = identity, 79 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> 86 _Proj1 __proj1 = {}, 94 class _Proj1 = 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 D | mismatch.h | 39 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() [all …]
|
H A D | ranges_starts_with.h | 42 class _Proj1 = identity, 44 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> 51 _Proj1 __proj1 = {}, 67 class _Proj1 = 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 D | ranges_includes.h | 45 … class _Proj1 = identity, 47 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l… 54 _Proj1 __proj1 = {}, 68 class _Proj1 = identity, 70 …indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, … 73 …_Range1&& __range1, _Range2&& __range2, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {… in operator()
|
H A D | ranges_find_end.h | 45 class _Proj1 = identity, 47 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> 54 _Proj1 __proj1 = {}, 72 class _Proj1 = 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 D | ranges_contains_subrange.h | 45 class _Proj1 = identity, 47 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> 54 _Proj1 __proj1 = {}, 67 class _Proj1 = 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 D | ranges_set_difference.h | 54 class _Proj1 = identity, in operator() 56 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator() 64 _Proj1 __proj1 = {}, 75 class _Proj1 = identity, 77 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2> in operator() 83 _Proj1 __proj1 = {},
|
H A D | ranges_partial_sort_copy.h | 53 class _Proj1 = identity, 56 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> in operator() 63 _Proj1 __proj1 = {}, 79 class _Proj1 = identity, 84 projected<iterator_t<_Range1>, _Proj1>, in operator() 88 _Range1&& __range, _Range2&& __result_range, _Comp __comp = {}, _Proj1 __proj1 = {}, _Proj2 __proj2 = {}) const {
|
H A D | ranges_set_intersection.h | 52 class _Proj1 = identity, in operator() 54 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator() 62 _Proj1 __proj1 = {}, 78 class _Proj1 = identity, 80 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2> 88 _Proj1 __proj1 = {},
|
H A D | ranges_set_union.h | 55 class _Proj1 = identity, in operator() 57 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator() 65 _Proj1 __proj1 = {}, 81 class _Proj1 = identity, 83 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2> in operator() 89 _Proj1 __proj1 = {},
|
H A D | ranges_set_symmetric_difference.h | 52 class _Proj1 = identity, in operator() 54 requires mergeable<_InIter1, _InIter2, _OutIter, _Comp, _Proj1, _Proj2> in operator() 62 _Proj1 __proj1 = {}, 78 class _Proj1 = identity, 80 requires mergeable<iterator_t<_Range1>, iterator_t<_Range2>, _OutIter, _Comp, _Proj1, _Proj2> 88 _Proj1 __proj1 = {},
|
H A D | ranges_equal.h | 44 class _Proj1 = identity, 46 requires indirectly_comparable<_Iter1, _Iter2, _Pred, _Proj1, _Proj2> 53 _Proj1 __proj1 = {}, 74 class _Proj1 = 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 D | ranges_transform.h | 65 class _Proj1, in __binary() 74 _Proj1& __projection1, in __binary() 111 class _Proj1 = identity, 114 indirect_result_t<_Func&, projected<_InIter1, _Proj1>, projected<_InIter2, _Proj2>>> in operator() 122 _Proj1 __projection1 = {}, 139 class _Proj1 = identity, 143 indirect_result_t<_Func&, projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>> 151 _Proj1 __projection1 = {},
|
H A D | search.h | 37 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 D | is_permutation.h | 69 class _Proj1, 78 _Proj1&& __proj1, 150 class _Proj1, 159 _Proj1&& __proj1, 193 class _Proj1, 202 _Proj1&& __proj1, 224 class _Proj1, 233 _Proj1&& __proj1,
|
H A D | find_end.h | 37 class _Proj1, 45 _Proj1& __proj1, in __find_end_impl() 89 class _Proj1, 97 _Proj1& __proj1, in __find_end() 140 class _Proj1, 148 _Proj1& __proj1, in __find_end()
|
H A D | equal.h | 72 template <class _Iter1, class _Sent1, class _Iter2, class _Sent2, class _Pred, class _Proj1, class … 74 …_Iter1 __first1, _Sent1 __last1, _Iter2 __first2, _Sent2 __last2, _Pred& __comp, _Proj1& __proj1, … in __equal_impl() 87 class _Proj1, 89 … __enable_if_t<__desugars_to_v<__equal_tag, _Pred, _Tp, _Up> && __is_identity<_Proj1>::value && 94 __equal_impl(_Tp* __first1, _Tp* __last1, _Up* __first2, _Up*, _Pred&, _Proj1&, _Proj2&) { in __equal_impl() argument
|
H A D | make_projected.h | 83 template <class _Comp, class _Proj1, class _Proj2> 84 _LIBCPP_HIDE_FROM_ABI constexpr decltype(auto) __make_projected_comp(_Comp& __comp, _Proj1& __proj1… 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 D | mergeable.h | 31 class _Proj1 = identity, 36 indirect_strict_weak_order<_Comp, projected<_Input1, _Proj1>, projected<_Input2, _Proj2>>;
|