/freebsd/contrib/llvm-project/libcxx/include/ |
H A D | algorithm | 49 …indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> … 53 …indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> … 57 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> 61 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> 79 requires indirect_binary_predicate<ranges::equal_to, projected<I, Proj>, const T*> 83 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*> 88 indirect_unary_predicate<projected<I, Proj>> Pred> 92 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> 97 indirect_unary_predicate<projected<I, Proj>> Pred> 101 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred> [all …]
|
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/ |
H A D | ranges_transform.h | 19 #include <__iterator/projected.h> 92 requires indirectly_writable<_OutIter, indirect_result_t<_Func&, projected<_InIter, _Proj>>> 99 requires indirectly_writable<_OutIter, indirect_result_t<_Func, projected<iterator_t<_Range>, _Proj>>> 114 indirect_result_t<_Func&, projected<_InIter1, _Proj1>, projected<_InIter2, _Proj2>>> in operator() 143 indirect_result_t<_Func&, projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, _Proj2>>>
|
H A D | ranges_adjacent_find.h | 17 #include <__iterator/projected.h> 55 …indirect_binary_predicate<projected<_Iter, _Proj>, projected<_Iter, _Proj>> _Pred = ranges::equal_… 63 …indirect_binary_predicate<projected<iterator_t<_Range>, _Proj>, projected<iterator_t<_Range>, _Pro…
|
H A D | ranges_includes.h | 20 #include <__iterator/projected.h> 47 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l… 70 …indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, …
|
H A D | ranges_find_last.h | 20 #include <__iterator/projected.h> 87 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*> 94 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _… 116 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 124 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred> 146 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 154 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
|
H A D | ranges_partial_sort_copy.h | 21 #include <__iterator/projected.h> 56 indirect_strict_weak_order<_Comp, projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> in operator() 84 projected<iterator_t<_Range1>, _Proj1>, in operator() 85 projected<iterator_t<_Range2>, _Proj2>> in operator()
|
H A D | ranges_is_permutation.h | 19 #include <__iterator/projected.h> 58 …indirect_equivalence_relation<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Pred = ranges… 75 indirect_equivalence_relation<projected<iterator_t<_Range1>, _Proj1>, 76 … projected<iterator_t<_Range2>, _Proj2>> _Pred = ranges::equal_to>
|
H A D | ranges_lexicographical_compare.h | 17 #include <__iterator/projected.h> 62 …indirect_strict_weak_order<projected<_Iter1, _Proj1>, projected<_Iter2, _Proj2>> _Comp = ranges::l… 79 …indirect_strict_weak_order<projected<iterator_t<_Range1>, _Proj1>, projected<iterator_t<_Range2>, …
|
H A D | ranges_min.h | 20 #include <__iterator/projected.h> 42 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less> 53 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less> 63 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
|
H A D | ranges_max.h | 20 #include <__iterator/projected.h> 43 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less> 54 indirect_strict_weak_order<projected<const _Tp*, _Proj>> _Comp = ranges::less> 66 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
|
H A D | ranges_is_sorted.h | 17 #include <__iterator/projected.h> 39 indirect_strict_weak_order<projected<_Iter, _Proj>> _Comp = ranges::less> 47 indirect_strict_weak_order<projected<iterator_t<_Range>, _Proj>> _Comp = ranges::less>
|
H A D | ranges_for_each.h | 17 #include <__iterator/projected.h> 54 indirectly_unary_invocable<projected<_Iter, _Proj>> _Func> 62 indirectly_unary_invocable<projected<iterator_t<_Range>, _Proj>> _Func>
|
H A D | ranges_replace.h | 17 #include <__iterator/projected.h> 39 indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type1*> 48 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _Type1*>
|
H A D | ranges_replace_if.h | 16 #include <__iterator/projected.h> 51 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> in operator() 61 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred> in operator()
|
H A D | ranges_contains.h | 19 #include <__iterator/projected.h> 39 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*> 46 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _…
|
H A D | ranges_count.h | 20 #include <__iterator/projected.h> 40 requires indirect_binary_predicate<ranges::equal_to, projected<_Iter, _Proj>, const _Type*> 47 …requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<_Range>, _Proj>, const _…
|
H A D | ranges_max_element.h | 18 #include <__iterator/projected.h> 40 indirect_strict_weak_order<projected<_Ip, _Proj>> _Comp = ranges::less> 49 indirect_strict_weak_order<projected<iterator_t<_Rp>, _Proj>> _Comp = ranges::less>
|
H A D | ranges_any_of.h | 16 #include <__iterator/projected.h> 47 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 55 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
|
H A D | ranges_find_if.h | 17 #include <__iterator/projected.h> 50 indirect_unary_predicate<projected<_Ip, _Proj>> _Pred> 56 …template <input_range _Rp, class _Proj = identity, indirect_unary_predicate<projected<iterator_t<_…
|
H A D | ranges_all_of.h | 16 #include <__iterator/projected.h> 47 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 55 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
|
H A D | ranges_count_if.h | 19 #include <__iterator/projected.h> 52 indirect_unary_predicate<projected<_Iter, _Proj>> _Predicate> 60 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Predicate>
|
H A D | ranges_none_of.h | 16 #include <__iterator/projected.h> 48 indirect_unary_predicate<projected<_Iter, _Proj>> _Pred> 56 indirect_unary_predicate<projected<iterator_t<_Range>, _Proj>> _Pred>
|
H A D | ranges_lower_bound.h | 21 #include <__iterator/projected.h> 45 indirect_strict_weak_order<const _Type*, projected<_Iter, _Proj>> _Comp = ranges::less> 54 …indirect_strict_weak_order<const _Type*, projected<iterator_t<_Range>, _Proj>> _Comp = ranges::les…
|
/freebsd/contrib/llvm-project/libcxx/include/__iterator/ |
H A D | indirectly_comparable.h | 16 #include <__iterator/projected.h> 27 concept indirectly_comparable = indirect_binary_predicate<_Rp, projected<_I1, _P1>, projected<_I2, _P2>>;
|
H A D | mergeable.h | 17 #include <__iterator/projected.h> 36 indirect_strict_weak_order<_Comp, projected<_Input1, _Proj1>, projected<_Input2, _Proj2>>;
|