Lines Matching full: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 indirect_strict_weak_order<projected<I, Proj>> Comp = ranges::less> // since C++20
53 indirect_strict_weak_order<projected<iterator_t<R>, Proj>> Comp = ranges::less> // since C++20
58 constexpr I ranges::max_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
62 constexpr borrowed_iterator_t<R> ranges::max_element(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
70 constexpr mismatch_result<_I1, _I2> // since C++20
77 mismatch(R1&& r1, R2&& r2, Pred pred = {}, Proj1 proj1 = {}, Proj2 proj2 = {}) // since C++20
80 constexpr I find(I first, S last, const T& value, Proj proj = {}); // since C++20
85 find(R&& r, const T& value, Proj proj = {}); // since C++20
89 constexpr I find_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
94 find_if(R&& r, Pred pred, Proj proj = {}); // since C++20
98 constexpr I find_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++20
103 find_if_not(R&& r, Pred pred, Proj proj = {}); // since C++20
107 constexpr subrange<I> find_last(I first, S last, const T& value, Proj proj = {}); // since C++23
112 constexpr borrowed_subrange_t<R> find_last(R&& r, const T& value, Proj proj = {}); // since C++23
116 constexpr subrange<I> find_last_if(I first, S last, Pred pred, Proj proj = {}); // since C++23
120 constexpr borrowed_subrange_t<R> find_last_if(R&& r, Pred pred, Proj proj = {}); // since C++23
124 constexpr subrange<I> find_last_if_not(I first, S last, Pred pred, Proj proj = {}); // since C++23
128 constexpr borrowed_subrange_t<R> find_last_if_not(R&& r, Pred pred, Proj proj = {}); // since C++23
132 constexpr const T& min(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
136 constexpr T min(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
142 min(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
146 constexpr const T& max(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
150 constexpr T max(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
156 max(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
159 using unary_transform_result = in_out_result<I, O>; // since C++20
162 using binary_transform_result = in_in_out_result<I1, I2, O>; // since C++20
168 transform(I first1, S last1, O result, F op, Proj proj = {}); // since C++20
174 transform(R&& r, 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 count(I first, S last, const T& value, Proj proj = {}); // since C++20
201 count(R&& r, const T& value, Proj proj = {}); // since C++20
206 count_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
211 count_if(R&& r, Pred pred, Proj proj = {}); // since C++20
219 minmax(const T& a, const T& b, Comp comp = {}, Proj proj = {}); // since C++20
224 minmax(initializer_list<T> r, Comp comp = {}, Proj proj = {}); // since C++20
230 minmax(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
238 minmax_element(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
243 minmax_element(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 using copy_result = in_out_result<I, O>; // since C++20
262 using copy_n_result = in_out_result<I, O>; // since C++20
265 using copy_if_result = in_out_result<I, O>; // since C++20
268 using copy_backward_result = in_out_result<I1, I2>; // since C++20
272 constexpr bool ranges::contains(I first, S last, const T& value, Proj proj = {}); // since C++23
276 constexpr bool ranges::contains(R&& r, const T& value, Proj proj = {}); // since C++23
280 constexpr ranges::copy_result<I, O> ranges::copy(I first, S last, O result); // since C++20
284 constexpr ranges::copy_result<borrowed_iterator_t<R>, O> ranges::copy(R&& r, O result); // since C++20
289 ranges::copy_n(I first, iter_difference_t<I> n, O result); // since C++20
295 ranges::copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
301 ranges::copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20
306 ranges::copy_backward(I1 first, S1 last, I2 result); // since C++20
311 ranges::copy_backward(R&& r, I result); // since C++20
314 using for_each_result = in_fun_result<I, F>; // since C++20
319 ranges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20
324 ranges::for_each(R&& r, Fun f, Proj proj = {}); // since C++20
329 ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20
333 constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20
337 constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C++20
343 ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
348 ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
354 ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
359 ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
365 ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
370 ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
376 ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
381 ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
385 constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
389 constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
393 constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
398 is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
402 constexpr I ranges::reverse(I first, S last); // since C++20
406 constexpr borrowed_iterator_t<R> ranges::reverse(R&& r); // since C++20
412 ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
417 ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
422 I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
427 ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
433 ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
438 ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++20
441 constexpr O ranges::fill(O first, S last, const T& value); // since C++20
444 constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value); // since C++20
447 constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value); // since C++20
451 constexpr O generate(O first, S last, F gen); // since C++20
456 Generator gen); // since C++17
460 constexpr borrowed_iterator_t<R> generate(R&& r, F gen); // since C++20
464 constexpr 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 constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
489 constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C++20
493 constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
497 constexpr 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 constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
521 constexpr 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 constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
560 constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
564 constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
569 ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
575 ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++20
580 ranges::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 upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
595 Proj proj = {}); // since C++20
600 lower_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 partition(I first, S last, Pred pred, Proj proj = {}); // since C++20
622 partition(R&& r, Pred pred, Proj proj = {}); // since C++20
627 subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C++20
632 borrowed_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 constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C++20
657 constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); // since C++20
663 ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
669 ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
674 constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
680 ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // since C++20
685 ranges::clamp(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 ranges::move_backward(I1 first, S1 last, I2 result); // since C++20
711 ranges::move_backward(R&& r, I result); // since C++20
716 ranges::move(I first, S last, O result); // since C++20
721 ranges::move(R&& r, O result); // since C++20
724 using partition_copy_result = in_out_out_result<I, O1, O2>; // since C++20
732 Proj proj = {}); // since C++20
740 partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // since C++20
744 constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); // since C++20
749 partition_point(R&& r, Pred pred, Proj proj = {}); // since C++20
752 using merge_result = in_in_out_result<I1, I2, O>; // since C++20
760 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
767 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
771 constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {}); // since C++20
777 ranges::remove(R&& r, const T& value, Proj proj = {}); // since C++20
781 constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
787 ranges::remove_if(R&& r, Pred pred, Proj proj = {}); // since C++20
790 using set_difference_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 using set_intersection_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 using reverse_copy_result = in_out_result<_InIter, _OutIter>; // since C++20
832 ranges::reverse_copy(I first, S last, O result); // since C++20
837 ranges::reverse_copy(R&& r, O result); // since C++20
840 constexpr subrange<I> rotate(I first, I middle, S last); // since C++20
844 constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle); // since C++20
847 using rotate_copy_result = in_out_result<_InIter, _OutIter>; // since C++20
852 ranges::rotate_copy(I first, I middle, S last, O result); // since C++20
857 ranges::rotate_copy(R&& r, iterator_t<R> middle, O result); // since C++20
863 O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g); // since C++20
869 O sample(R&& r, O out, range_difference_t<R> n, Gen&& g); // since C++20
874 I shuffle(I first, S last, Gen&& g); // since C++20
879 borrowed_iterator_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 constexpr auto ranges::fold_left(I first, S last, T init, F f); // since C++23
930 constexpr auto fold_left(R&& r, T init, F f); // since C++23
933 using fold_left_with_iter_result = in_value_result<I, T>; // since C++23
937 constexpr see below fold_left_with_iter(I first, S last, T init, F f); // since C++23
940 constexpr see 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 using set_symmetric_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 equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
985 equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
988 using set_union_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 I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
1028 Proj proj = {}); // since C++20
1032 constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // since C++20
1038 unique(R&& r, C comp = {}, Proj proj = {}); // since C++20
1047 unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); // since C++20
1056 unique_copy(R&& r, O result, C comp = {}, Proj proj = {}); // since C++20
1059 using remove_copy_result = in_out_result<I, O>; // since C++20
1065 remove_copy(I first, S last, O result, const T& value, Proj proj = {}); // since C++20
1072 remove_copy(R&& r, O result, const T& value, Proj proj = {}); // since C++20
1075 using remove_copy_if_result = in_out_result<I, O>; // since C++20
1081 remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
1087 remove_copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20
1090 using replace_copy_result = in_out_result<I, O>; // since C++20
1098 Proj proj = {}); // since C++20
1107 Proj proj = {}); // since C++20
1110 using replace_copy_if_result = in_out_result<I, O>; // since C++20
1117 Proj proj = {}); // since C++20
1124 Proj proj = {}); // since C++20
1127 using prev_permutation_result = in_found_result<I>; // since C++20
1133 ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1139 ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
1142 using next_permutation_result = in_found_result<I>; // since C++20
1148 ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1154 ranges::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