Lines Matching refs:since
25 struct in_fun_result; // since C++20
28 struct in_in_result; // since C++20
31 struct in_out_result; // since C++20
34 struct in_in_out_result; // since C++20
37 struct in_out_out_result; // since C++20
40 struct min_max_result; // since C++20
43 struct in_found_result; // since C++20
46 struct in_value_result; // since C++23
49 …eak_order<projected<I, Proj>> Comp = ranges::less> // since C++20
53 …eak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
58 …:max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
62 …iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
70 …result<_I1, _I2> // since C++20
77 …2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20
80 …I first, S last, const T& value, Proj proj = {}); // since C++20
85 …st T& value, Proj proj = {}); // since C++20
89 …if(I first, S last, Pred pred, Proj proj = {}); // since C++20
94 …Pred pred, Proj proj = {}); // since C++20
98 …if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20
103 … r, Pred pred, Proj proj = {}); // since C++20
107 …& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
111 …nitializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
117 …comp = {}, Proj proj = {}); // since C++20
121 …& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
125 …nitializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
131 … comp = {}, Proj proj = {}); // since C++20
134 …form_result = in_out_result<I, O>; // since C++20
137 …sform_result = in_in_out_result<I1, I2, O>; // since C++20
143 …st1, S last1, O result, F op, Proj proj = {}); // since C++20
149 …, O result, F op, Proj proj = {}); // since C++20
158 … F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
166 … F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
171 …S last, const T& value, Proj proj = {}); // since C++20
176 …nst T& value, Proj proj = {}); // since C++20
181 …t, S last, Pred pred, Proj proj = {}); // since C++20
186 … Pred pred, Proj proj = {}); // since C++20
194 … a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
199 …zer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
205 …omp comp = {}, Proj proj = {}); // since C++20
213 …I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
218 …R&& r, Comp comp = {}, Proj proj = {}); // since C++20
221 …ng copy_result = in_out_result<I, O>; // since C++20
224 …ng copy_n_result = in_out_result<I, O>; // since C++20
227 …ng copy_if_result = in_out_result<I, O>; // since C++20
230 …ng copy_backward_result = in_out_result<I1, I2>; // since C++20
234 …stexpr bool ranges::contains(I first, S last, const T& value, Proj proj = {}); // since C++23
238 …stexpr bool ranges::contains(R&& r, const T& value, Proj proj = {}); // since C++23
242 …stexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result); // since C++20
246 …stexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20
251 …anges::copy_n(I first, iter_difference_t<I> n, O result); // since C++20
257 …anges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
263 …anges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20
268 …anges::copy_backward(I1 first, S1 last, I2 result); // since C++20
273 …anges::copy_backward(R&& r, I result); // since C++20
276 …ng for_each_result = in_fun_result<I, F>; // since C++20
281 …anges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20
286 …anges::for_each(R&& r, Fun f, Proj proj = {}); // since C++20
291 …anges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20
295 …stexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20
299 …stexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C++20
305 …anges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
310 …anges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
316 …anges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
321 …anges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
327 …anges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
332 …anges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
338 …anges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
343 …anges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
347 …stexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
351 …stexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
355 …stexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
360 …s_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
364 …stexpr I ranges::reverse(I first, S last); // since C++20
368 …stexpr borrowed_iterator_t<R> ranges::reverse(R&& r); // since C++20
374 …anges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
379 …anges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
384 …anges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
389 …anges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
395 …anges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
400 …anges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++20
403 …stexpr O ranges::fill(O first, S last, const T& value); // since C++20
406 …stexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value); // since C++20
409 …stexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value); // since C++20
413 …stexpr O generate(O first, S last, F gen); // since C++20
418 … Generator gen); // since C++17
422 …stexpr borrowed_iterator_t<R> generate(R&& r, F gen); // since C++20
426 …stexpr O generate_n(O first, iter_difference_t<O> n, F gen); // since C++20
430 … ForwardIterator first, Size n, Generator gen); // since C++17
437 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
443 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
447 …stexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
451 …stexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C++20
455 …stexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
459 …stexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {}); // since C++20
467 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
475 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
479 …stexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
483 …stexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {}); // since C++20
489 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
495 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
504 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
514 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
518 …stexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
522 …stexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
526 …stexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
531 …anges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
537 …anges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++20
542 …anges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++20
545 … indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> // since C++20
552 …pper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
557 … Proj proj = {}); // since C++20
562 …ower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
567 … Proj proj = {}); // since C++20
573 … Proj proj = {}); // since C++20
578 …artition(I first, S last, Pred pred, Proj proj = {}); // since C++20
584 …artition(R&& r, Pred pred, Proj proj = {}); // since C++20
589 …range<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C++20
594 …rowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {}); // since C++20
601 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
609 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
614 …stexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C++20
619 …orrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); // since C++20
625 …eplace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
631 …eplace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
636 … ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
642 …eplace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // since C++20
647 …lamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // since C++20
655 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
663 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
668 …ove_backward(I1 first, S1 last, I2 result); // since C++20
673 …ove_backward(R&& r, I result); // since C++20
678 …ove(I first, S last, O result); // since C++20
683 …ove(R&& r, O result); // since C++20
686 …tition_copy_result = in_out_out_result<I, O1, O2>; // since C++20
694 … Proj proj = {}); // since C++20
702 …_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // since C++20
706 … partition_point(I first, S last, Pred pred, Proj proj = {}); // since C++20
711 …_point(R&& r, Pred pred, Proj proj = {}); // since C++20
714 …_result = in_in_out_result<I1, I2, O>; // since C++20
722 …p comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
729 …p comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
733 …ubrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {}); // since C++20
739 …emove(R&& r, const T& value, Proj proj = {}); // since C++20
743 …ubrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
749 …emove_if(R&& r, Pred pred, Proj proj = {}); // since C++20
752 …ifference_result = in_out_result<I, O>; // since C++20
760 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
767 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
770 …ntersection_result = in_in_out_result<I1, I2, O>; // since C++20
778 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
786 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
789 …_copy_result = in_out_result<_InIter, _OutIter>; // since C++20
794 …everse_copy(I first, S last, O result); // since C++20
799 …everse_copy(R&& r, O result); // since C++20
802 …ubrange<I> rotate(I first, I middle, S last); // since C++20
806 …orrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle); // since C++20
809 …copy_result = in_out_result<_InIter, _OutIter>; // since C++20
814 …otate_copy(I first, I middle, S last, O result); // since C++20
819 …otate_copy(R&& r, iterator_t<R> middle, O result); // since C++20
825 …first, S last, O out, iter_difference_t<I> n, Gen&& g); // since C++20
831 …& r, O out, range_difference_t<R> n, Gen&& g); // since C++20
836 … first, S last, Gen&& g); // since C++20
841 …erator_t<R> shuffle(R&& r, Gen&& g); // since C++20
849 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
856 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
864 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
871 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
878 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
885 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
889 …uto ranges::fold_left(I first, S last, T init, F f); // since C++23
892 …uto fold_left(R&& r, T init, F f); // since C++23
895 …left_with_iter_result = in_value_result<I, T>; // since C++23
899 …ee below fold_left_with_iter(I first, S last, T init, F f); // since C++23
902 …ee below fold_left_with_iter(R&& r, T init, F f); // since C++23
909 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
916 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
919 …ymmetric_difference_result = in_in_out_result<I1, I2, O>; // since C++20
928 … Proj2 proj2 = {}); // since C++20
936 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
941 …ge(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
947 …ge(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
950 …nion_result = in_in_out_result<I1, I2, O>; // since C++20
958 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
965 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
972 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
979 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
984 …merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
990 … Proj proj = {}); // since C++20
994 …subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // since C++20
1000 …&& r, C comp = {}, Proj proj = {}); // since C++20
1009 …opy(I first, S last, O result, C comp = {}, Proj proj = {}); // since C++20
1018 …opy(R&& r, O result, C comp = {}, Proj proj = {}); // since C++20
1021 …move_copy_result = in_out_result<I, O>; // since C++20
1027 …opy(I first, S last, O result, const T& value, Proj proj = {}); // since C++20
1034 …opy(R&& r, O result, const T& value, Proj proj = {}); // since C++20
1037 …move_copy_if_result = in_out_result<I, O>; // since C++20
1043 …opy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
1049 …opy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20
1052 …place_copy_result = in_out_result<I, O>; // since C++20
1060 … Proj proj = {}); // since C++20
1069 … Proj proj = {}); // since C++20
1072 …place_copy_if_result = in_out_result<I, O>; // since C++20
1079 … Proj proj = {}); // since C++20
1086 … Proj proj = {}); // since C++20
1089 …_permutation_result = in_found_result<I>; // since C++20
1095 …prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1101 …prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
1104 …_permutation_result = in_found_result<I>; // since C++20
1110 …next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1116 …next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
1757 … -> decltype(comp(*b1, *b2)); // since C++20
1762 … InputIterator2 first2, InputIterator2 last2); // since C++20