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 …e<I> find_last(I first, S last, const T& value, Proj proj = {}); // since C++23
112 …ed_subrange_t<R> find_last(R&& r, const T& value, Proj proj = {}); // since C++23
116 …ge<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); // since C++23
120 …ed_subrange_t<R> find_last_if(R&& r, Pred pred, Proj proj = {}); // since C++23
124 …ge<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++23
128 …ed_subrange_t<R> find_last_if_not(R&& r, Pred pred, Proj proj = {}); // since C++23
132 …& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
136 …nitializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
142 …comp = {}, Proj proj = {}); // since C++20
146 …& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
150 …nitializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
156 … comp = {}, Proj proj = {}); // since C++20
159 …form_result = in_out_result<I, O>; // since C++20
162 …sform_result = in_in_out_result<I1, I2, O>; // since C++20
168 …st1, S last1, O result, F op, Proj proj = {}); // since C++20
174 …, O result, F op, Proj proj = {}); // since C++20
183 … F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
191 … F binary_op, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
196 …S last, const T& value, Proj proj = {}); // since C++20
201 …nst T& value, Proj proj = {}); // since C++20
206 …t, S last, Pred pred, Proj proj = {}); // since C++20
211 … Pred pred, Proj proj = {}); // since C++20
219 … a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
224 …zer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
230 …omp comp = {}, Proj proj = {}); // since C++20
238 …I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
243 …R&& r, Comp comp = {}, Proj proj = {}); // since C++20
250 … Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
256 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
259 …ng copy_result = in_out_result<I, O>; // since C++20
262 …ng copy_n_result = in_out_result<I, O>; // since C++20
265 …ng copy_if_result = in_out_result<I, O>; // since C++20
268 …ng copy_backward_result = in_out_result<I1, I2>; // since C++20
272 …stexpr bool ranges::contains(I first, S last, const T& value, Proj proj = {}); // since C++23
276 …stexpr bool ranges::contains(R&& r, const T& value, Proj proj = {}); // since C++23
280 …stexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result); // since C++20
284 …stexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20
289 …anges::copy_n(I first, iter_difference_t<I> n, O result); // since C++20
295 …anges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
301 …anges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20
306 …anges::copy_backward(I1 first, S1 last, I2 result); // since C++20
311 …anges::copy_backward(R&& r, I result); // since C++20
314 …ng for_each_result = in_fun_result<I, F>; // since C++20
319 …anges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20
324 …anges::for_each(R&& r, Fun f, Proj proj = {}); // since C++20
329 …anges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20
333 …stexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20
337 …stexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C++20
343 …anges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
348 …anges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
354 …anges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
359 …anges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
365 …anges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
370 …anges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
376 …anges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
381 …anges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
385 …stexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
389 …stexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
393 …stexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
398 …s_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
402 …stexpr I ranges::reverse(I first, S last); // since C++20
406 …stexpr borrowed_iterator_t<R> ranges::reverse(R&& r); // since C++20
412 …anges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
417 …anges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
422 …anges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
427 …anges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
433 …anges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
438 …anges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++20
441 …stexpr O ranges::fill(O first, S last, const T& value); // since C++20
444 …stexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value); // since C++20
447 …stexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value); // since C++20
451 …stexpr O generate(O first, S last, F gen); // since C++20
456 … Generator gen); // since C++17
460 …stexpr borrowed_iterator_t<R> generate(R&& r, F gen); // since C++20
464 …stexpr O generate_n(O first, iter_difference_t<O> n, F gen); // since C++20
468 … ForwardIterator first, Size n, Generator gen); // since C++17
475 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
481 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
485 …stexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
489 …stexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C++20
493 …stexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
497 …stexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {}); // since C++20
505 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
513 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
517 …stexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
521 …stexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {}); // since C++20
527 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
533 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
542 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
552 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
556 …stexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
560 …stexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
564 …stexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
569 …anges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
575 …anges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++20
580 …anges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++20
583 … indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> // since C++20
590 …pper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
595 … Proj proj = {}); // since C++20
600 …ower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
605 … Proj proj = {}); // since C++20
611 … Proj proj = {}); // since C++20
616 …artition(I first, S last, Pred pred, Proj proj = {}); // since C++20
622 …artition(R&& r, Pred pred, Proj proj = {}); // since C++20
627 …range<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C++20
632 …rowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {}); // since C++20
639 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
647 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
652 …stexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C++20
657 …orrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); // since C++20
663 …eplace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
669 …eplace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
674 … ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
680 …eplace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // since C++20
685 …lamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // since C++20
693 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
701 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
706 …ove_backward(I1 first, S1 last, I2 result); // since C++20
711 …ove_backward(R&& r, I result); // since C++20
716 …ove(I first, S last, O result); // since C++20
721 …ove(R&& r, O result); // since C++20
724 …tition_copy_result = in_out_out_result<I, O1, O2>; // since C++20
732 … Proj proj = {}); // since C++20
740 …_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // since C++20
744 … partition_point(I first, S last, Pred pred, Proj proj = {}); // since C++20
749 …_point(R&& r, Pred pred, Proj proj = {}); // since C++20
752 …_result = in_in_out_result<I1, I2, O>; // since C++20
760 …p comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
767 …p comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
771 …ubrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {}); // since C++20
777 …emove(R&& r, const T& value, Proj proj = {}); // since C++20
781 …ubrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
787 …emove_if(R&& r, Pred pred, Proj proj = {}); // since C++20
790 …ifference_result = in_out_result<I, O>; // since C++20
798 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
805 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
808 …ntersection_result = in_in_out_result<I1, I2, O>; // since C++20
816 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
824 … Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
827 …_copy_result = in_out_result<_InIter, _OutIter>; // since C++20
832 …everse_copy(I first, S last, O result); // since C++20
837 …everse_copy(R&& r, O result); // since C++20
840 …ubrange<I> rotate(I first, I middle, S last); // since C++20
844 …orrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle); // since C++20
847 …copy_result = in_out_result<_InIter, _OutIter>; // since C++20
852 …otate_copy(I first, I middle, S last, O result); // since C++20
857 …otate_copy(R&& r, iterator_t<R> middle, O result); // since C++20
863 …first, S last, O out, iter_difference_t<I> n, Gen&& g); // since C++20
869 …& r, O out, range_difference_t<R> n, Gen&& g); // since C++20
874 … first, S last, Gen&& g); // since C++20
879 …erator_t<R> shuffle(R&& r, Gen&& g); // since C++20
887 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
894 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
902 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
909 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
916 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
923 … const T& value, Pred pred = {}, Proj proj = {}); // since C++20
927 …uto ranges::fold_left(I first, S last, T init, F f); // since C++23
930 …uto fold_left(R&& r, T init, F f); // since C++23
933 …left_with_iter_result = in_value_result<I, T>; // since C++23
937 …ee below fold_left_with_iter(I first, S last, T init, F f); // since C++23
940 …ee below fold_left_with_iter(R&& r, T init, F f); // since C++23
947 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
954 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
957 …ymmetric_difference_result = in_in_out_result<I1, I2, O>; // since C++20
966 … Proj2 proj2 = {}); // since C++20
974 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
979 …ge(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
985 …ge(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
988 …nion_result = in_in_out_result<I1, I2, O>; // since C++20
996 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1003 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1010 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1017 … Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1022 …merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
1028 … Proj proj = {}); // since C++20
1032 …subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // since C++20
1038 …&& r, C comp = {}, Proj proj = {}); // since C++20
1047 …opy(I first, S last, O result, C comp = {}, Proj proj = {}); // since C++20
1056 …opy(R&& r, O result, C comp = {}, Proj proj = {}); // since C++20
1059 …move_copy_result = in_out_result<I, O>; // since C++20
1065 …opy(I first, S last, O result, const T& value, Proj proj = {}); // since C++20
1072 …opy(R&& r, O result, const T& value, Proj proj = {}); // since C++20
1075 …move_copy_if_result = in_out_result<I, O>; // since C++20
1081 …opy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
1087 …opy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20
1090 …place_copy_result = in_out_result<I, O>; // since C++20
1098 … Proj proj = {}); // since C++20
1107 … Proj proj = {}); // since C++20
1110 …place_copy_if_result = in_out_result<I, O>; // since C++20
1117 … Proj proj = {}); // since C++20
1124 … Proj proj = {}); // since C++20
1127 …_permutation_result = in_found_result<I>; // since C++20
1133 …prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1139 …prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
1142 …_permutation_result = in_found_result<I>; // since C++20
1148 …next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1154 …next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
1795 … -> decltype(comp(*b1, *b2)); // since C++20
1800 … InputIterator2 first2, InputIterator2 last2); // since C++20