Lines Matching refs:iterator_t
53 …indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> …
61 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
75 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
83 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
92 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
101 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
114 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
115 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
128 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
129 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
147 requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>>
162 requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>,
163 projected<iterator_t<R2>, Proj2>>>
174 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
184 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
202 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
203 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
216 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
237 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
245 requires indirectly_copyable<iterator_t<R>, O>
260 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
261 requires indirectly_copyable<iterator_t<R>, O>
271 requires indirectly_copyable<iterator_t<R>, I>
284 indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun>
298 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
308 requires sortable<iterator_t<R>, Comp, Proj>
319 requires sortable<iterator_t<R>, Comp, Proj>
330 requires sortable<iterator_t<R>, Comp, Proj>
341 requires sortable<iterator_t<R>, Comp, Proj>
350 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
358 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
367 requires permutable<iterator_t<R>>
377 requires sortable<iterator_t<R>, Comp, Proj>
387 requires sortable<iterator_t<R>, Comp, Proj>
398 requires sortable<iterator_t<R>, Comp, Proj>
400 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
441 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
450 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
458 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
473 indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
482 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
493 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
508 requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> &&
509 sortable<iterator_t<R2>, Comp, Proj2> &&
510 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
511 projected<iterator_t<R2>, Proj2>>
521 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
529 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
540 requires sortable<iterator_t<R>, Comp, Proj>
542 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++…
549 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
559 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
570 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
581 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
582 requires permutable<iterator_t<R>>
592 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
593 requires permutable<iterator_t<R>>
605 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
617 indirect_binary_predicate<projected<iterator_t<R>, Proj>,
618 projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
628 requires indirectly_writable<iterator_t<R>, const T2&> &&
629 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
639 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
640 requires indirectly_writable<iterator_t<R>, const T&>
659 indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
660 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
671 requires indirectly_movable<iterator_t<R>, I>
681 requires indirectly_movable<iterator_t<R>, O>
698 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
699 requires indirectly_copyable<iterator_t<R>, O1> &&
700 indirectly_copyable<iterator_t<R>, O2>
709 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
726 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
736 requires permutable<iterator_t<R>> &&
737 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
746 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
747 requires permutable<iterator_t<R>>
764 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
797 requires indirectly_copyable<iterator_t<R>, O>
805 requires permutable<iterator_t<R>>
806 …constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle); //…
817 requires indirectly_copyable<iterator_t<R>, O>
819 …ranges::rotate_copy(R&& r, iterator_t<R> middle, O result); // s…
829 indirectly_copyable<iterator_t<R>, O> &&
839 requires permutable<iterator_t<R>> &&
853 indirect_equivalence_relation<projected<iterator_t<R1>, Proj1>,
854 projected<iterator_t<R2>, Proj2>> Pred = ranges::equal_to>
868 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
882 requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj>
891 template<input_range R, class T, indirectly-binary-left-foldable<T, iterator_t<R>> F>
901 template<input_range R, class T, indirectly-binary-left-foldable<T, iterator_t<R>> F>
913 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
932 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
944 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
962 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
976 indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
977 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
987 requires sortable<iterator_t<R>, Comp, Proj>
989 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
997 indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
998 requires permutable<iterator_t<R>>
1012 indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
1013 requires indirectly_copyable<iterator_t<R>, O> &&
1014 (forward_iterator<iterator_t<R>> ||
1016 indirectly_copyable_storable<iterator_t<R>, O>)
1030 requires indirectly_copyable<iterator_t<R>, O> &&
1032 projected<iterator_t<R>, Proj>, const T*>
1046 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
1047 requires indirectly_copyable<iterator_t<R>, O>
1064 requires indirectly_copyable<iterator_t<R>, O> &&
1066 projected<iterator_t<R>, Proj>, const T1*>
1082 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
1083 requires indirectly_copyable<iterator_t<R>, O>
1099 requires sortable<iterator_t<R>, Comp, Proj>
1114 requires sortable<iterator_t<R>, Comp, Proj>
1310 requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>