Lines Matching refs:iterator_t
50 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
58 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
72 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
80 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
89 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
98 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
111 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
112 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
125 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
126 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
144 requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R>, Proj>>>
159 requires indirectly_writable<O, indirect_result_t<F&, projected<iterator_t<R1>, Proj1>,
160 projected<iterator_t<R2>, Proj2>>>
171 requires indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
181 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
199 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
200 requires indirectly_copyable_storable<iterator_t<R>, range_value_t<R>*>
213 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
234 requires indirectly_copyable<iterator_t<R>, O>
249 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
250 requires indirectly_copyable<iterator_t<R>, O>
260 requires indirectly_copyable<iterator_t<R>, I>
273 indirectly_unary_invocable<projected<iterator_t<R>, Proj>> Fun>
287 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
297 requires sortable<iterator_t<R>, Comp, Proj>
308 requires sortable<iterator_t<R>, Comp, Proj>
319 requires sortable<iterator_t<R>, Comp, Proj>
330 requires sortable<iterator_t<R>, Comp, Proj>
339 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
347 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
356 requires permutable<iterator_t<R>>
366 requires sortable<iterator_t<R>, Comp, Proj>
376 requires sortable<iterator_t<R>, Comp, Proj>
387 requires sortable<iterator_t<R>, Comp, Proj>
389 …ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++…
421 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
430 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
438 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
446 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
460 requires indirectly_copyable<iterator_t<R1>, iterator_t<R2>> &&
461 sortable<iterator_t<R2>, Comp, Proj2> &&
462 indirect_strict_weak_order<Comp, projected<iterator_t<R1>, Proj1>,
463 projected<iterator_t<R2>, Proj2>>
473 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
481 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less>
492 requires sortable<iterator_t<R>, Comp, Proj>
494 …ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C…
501 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
511 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
522 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
533 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
534 requires permutable<iterator_t<R>>
544 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
545 requires permutable<iterator_t<R>>
557 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
569 indirect_binary_predicate<projected<iterator_t<R>, Proj>,
570 projected<iterator_t<R>, Proj>> Pred = ranges::equal_to>
580 requires indirectly_writable<iterator_t<R>, const T2&> &&
581 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T1*>
591 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
592 requires indirectly_writable<iterator_t<R>, const T&>
611 indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
612 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
623 requires indirectly_movable<iterator_t<R>, I>
633 requires indirectly_movable<iterator_t<R>, O>
650 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
651 requires indirectly_copyable<iterator_t<R>, O1> &&
652 indirectly_copyable<iterator_t<R>, O2>
661 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
678 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
688 requires permutable<iterator_t<R>> &&
689 indirect_binary_predicate<ranges::equal_to, projected<iterator_t<R>, Proj>, const T*>
698 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
699 requires permutable<iterator_t<R>>
716 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
749 requires indirectly_copyable<iterator_t<R>, O>
757 requires permutable<iterator_t<R>>
758 …constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle); //…
769 requires indirectly_copyable<iterator_t<R>, O>
771 …ranges::rotate_copy(R&& r, iterator_t<R> middle, O result); // s…
781 indirectly_copyable<iterator_t<R>, O> &&
791 requires permutable<iterator_t<R>> &&
805 indirect_equivalence_relation<projected<iterator_t<R1>, Proj1>,
806 projected<iterator_t<R2>, Proj2>> Pred = ranges::equal_to>
820 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
834 requires indirectly_comparable<iterator_t<R>, const T*, Pred, Proj>
848 requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
867 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
879 indirect_strict_weak_order<const T*, projected<iterator_t<R>, Proj>> Comp =
897 requires mergeable<iterator_t<R1>, iterator_t<R2>, O, Comp, Proj1, Proj2>
911 indirect_strict_weak_order<projected<iterator_t<R1>, Proj1>,
912 projected<iterator_t<R2>, Proj2>> Comp = ranges::less>
922 requires sortable<iterator_t<R>, Comp, Proj>
924 inplace_merge(R&& r, iterator_t<R> middle, Comp comp = {},
932 indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
933 requires permutable<iterator_t<R>>
947 indirect_equivalence_relation<projected<iterator_t<R>, Proj>> C = ranges::equal_to>
948 requires indirectly_copyable<iterator_t<R>, O> &&
949 (forward_iterator<iterator_t<R>> ||
951 indirectly_copyable_storable<iterator_t<R>, O>)
965 requires indirectly_copyable<iterator_t<R>, O> &&
967 projected<iterator_t<R>, Proj>, const T*>
981 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
982 requires indirectly_copyable<iterator_t<R>, O>
999 requires indirectly_copyable<iterator_t<R>, O> &&
1001 projected<iterator_t<R>, Proj>, const T1*>
1017 indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
1018 requires indirectly_copyable<iterator_t<R>, O>
1034 requires sortable<iterator_t<R>, Comp, Proj>
1049 requires sortable<iterator_t<R>, Comp, Proj>
1245 requires indirectly_swappable<iterator_t<R1>, iterator_t<R2>>