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
317 using for_each_n_result = in_fun_result<I, F>; // since C++20
322 ranges::for_each(I first, S last, Fun f, Proj proj = {}); // since C++20
327 ranges::for_each(R&& r, Fun f, Proj proj = {}); // since C++20
332 ranges::for_each_n(I first, iter_difference_t<I> n, Fun f, Proj proj = {}); // since C++20
336 constexpr bool ranges::is_partitioned(I first, S last, Pred pred, Proj proj = {}); // since C++20
340 constexpr bool ranges::is_partitioned(R&& r, Pred pred, Proj proj = {}); // since C++20
346 ranges::push_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
351 ranges::push_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
357 ranges::pop_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
362 ranges::pop_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
368 ranges::make_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
373 ranges::make_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
379 ranges::sort_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
384 ranges::sort_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
388 constexpr bool is_heap(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
392 constexpr bool is_heap(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
396 constexpr I is_heap_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
401 is_heap_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
405 constexpr I ranges::reverse(I first, S last); // since C++20
409 constexpr borrowed_iterator_t<R> ranges::reverse(R&& r); // since C++20
415 ranges::sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
420 ranges::sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
425 I ranges::stable_sort(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
430 ranges::stable_sort(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
436 ranges::partial_sort(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
441 ranges::partial_sort(R&& r, iterator_t<R> middle, Comp comp = {}, Proj proj = {}); // since C++20
444 constexpr O ranges::fill(O first, S last, const T& value); // since C++20
447 constexpr borrowed_iterator_t<R> ranges::fill(R&& r, const T& value); // since C++20
450 constexpr O ranges::fill_n(O first, iter_difference_t<O> n, const T& value); // since C++20
454 constexpr O generate(O first, S last, F gen); // since C++20
459 Generator gen); // since C++17
463 constexpr borrowed_iterator_t<R> generate(R&& r, F gen); // since C++20
467 constexpr O generate_n(O first, iter_difference_t<O> n, F gen); // since C++20
471 ForwardIterator first, Size n, Generator gen); // since C++17
478 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
484 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
488 constexpr bool ranges::all_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
492 constexpr bool ranges::all_of(R&& r, Pred pred, Proj proj = {}); // since C++20
496 constexpr bool ranges::any_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
500 constexpr bool ranges::any_of(R&& r, Pred pred, Proj proj = {}); // since C++20
508 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
516 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
520 constexpr bool ranges::none_of(I first, S last, Pred pred, Proj proj = {}); // since C++20
524 constexpr bool ranges::none_of(R&& r, Pred pred, Proj proj = {}); // since C++20
530 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
536 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++23
545 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
555 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
559 constexpr bool ranges::is_sorted(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
563 constexpr bool ranges::is_sorted(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
567 constexpr I ranges::is_sorted_until(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
572 ranges::is_sorted_until(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
578 ranges::nth_element(I first, I nth, S last, Comp comp = {}, Proj proj = {}); // since C++20
583 ranges::nth_element(R&& r, iterator_t<R> nth, Comp comp = {}, Proj proj = {}); // since C++20
586 indirect_strict_weak_order<const T*, projected<I, Proj>> Comp = ranges::less> // since C++20
593 upper_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
598 Proj proj = {}); // since C++20
603 lower_bound(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
608 Proj proj = {}); // since C++20
614 Proj proj = {}); // since C++20
619 partition(I first, S last, Pred pred, Proj proj = {}); // since C++20
625 partition(R&& r, Pred pred, Proj proj = {}); // since C++20
630 subrange<I> stable_partition(I first, S last, Pred pred, Proj proj = {}); // since C++20
635 borrowed_subrange_t<R> stable_partition(R&& r, Pred pred, Proj proj = {}); // since C++20
642 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
650 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
655 constexpr I ranges::adjacent_find(I first, S last, Pred pred = {}, Proj proj = {}); // since C++20
660 constexpr borrowed_iterator_t<R> ranges::adjacent_find(R&& r, Pred pred = {}, Proj proj = {}); // since C++20
666 ranges::replace(I first, S last, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
672 ranges::replace(R&& r, const T1& old_value, const T2& new_value, Proj proj = {}); // since C++20
677 constexpr I ranges::replace_if(I first, S last, Pred pred, const T& new_value, Proj proj = {}); // since C++20
683 ranges::replace_if(R&& r, Pred pred, const T& new_value, Proj proj = {}); // since C++20
688 ranges::clamp(const T& v, const T& lo, const T& hi, Comp comp = {}, Proj proj = {}); // since C++20
696 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
704 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
707 using move_result = in_out_result<I, O>; // since C++20
710 using move_backward_result = in_out_result<I, O>; // since C++20
715 ranges::move_backward(I1 first, S1 last, I2 result); // since C++20
720 ranges::move_backward(R&& r, I result); // since C++20
725 ranges::move(I first, S last, O result); // since C++20
730 ranges::move(R&& r, O result); // since C++20
733 using partition_copy_result = in_out_out_result<I, O1, O2>; // since C++20
741 Proj proj = {}); // since C++20
749 partition_copy(R&& r, O1 out_true, O2 out_false, Pred pred, Proj proj = {}); // since C++20
753 constexpr I partition_point(I first, S last, Pred pred, Proj proj = {}); // since C++20
758 partition_point(R&& r, Pred pred, Proj proj = {}); // since C++20
761 using merge_result = in_in_out_result<I1, I2, O>; // since C++20
769 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
776 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
780 constexpr subrange<I> ranges::remove(I first, S last, const T& value, Proj proj = {}); // since C++20
786 ranges::remove(R&& r, const T& value, Proj proj = {}); // since C++20
790 constexpr subrange<I> ranges::remove_if(I first, S last, Pred pred, Proj proj = {}); // since C++20
796 ranges::remove_if(R&& r, Pred pred, Proj proj = {}); // since C++20
799 using set_difference_result = in_out_result<I, O>; // since C++20
807 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
814 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
817 using set_intersection_result = in_in_out_result<I1, I2, O>; // since C++20
825 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
833 Comp comp = {}, Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
836 using reverse_copy_result = in_out_result<_InIter, _OutIter>; // since C++20
841 ranges::reverse_copy(I first, S last, O result); // since C++20
846 ranges::reverse_copy(R&& r, O result); // since C++20
849 constexpr subrange<I> rotate(I first, I middle, S last); // since C++20
853 constexpr borrowed_subrange_t<R> rotate(R&& r, iterator_t<R> middle); // since C++20
856 using rotate_copy_result = in_out_result<_InIter, _OutIter>; // since C++20
861 ranges::rotate_copy(I first, I middle, S last, O result); // since C++20
866 ranges::rotate_copy(R&& r, iterator_t<R> middle, O result); // since C++20
872 O sample(I first, S last, O out, iter_difference_t<I> n, Gen&& g); // since C++20
878 O sample(R&& r, O out, range_difference_t<R> n, Gen&& g); // since C++20
883 I shuffle(I first, S last, Gen&& g); // since C++20
888 borrowed_iterator_t<R> shuffle(R&& r, Gen&& g); // since C++20
896 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
903 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
911 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
918 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
925 const T& value, Pred pred = {}, Proj proj = {}); // since C++20
932 const T& value, Pred pred = {}, Proj proj = {}); // since C++20
936 constexpr auto ranges::fold_left(I first, S last, T init, F f); // since C++23
939 constexpr auto fold_left(R&& r, T init, F f); // since C++23
942 using fold_left_with_iter_result = in_value_result<I, T>; // since C++23
946 constexpr see below fold_left_with_iter(I first, S last, T init, F f); // since C++23
949 constexpr see below fold_left_with_iter(R&& r, T init, F f); // since C++23
956 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
963 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
966 using set_symmetric_difference_result = in_in_out_result<I1, I2, O>; // since C++20
975 Proj2 proj2 = {}); // since C++20
983 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
988 equal_range(I first, S last, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
994 equal_range(R&& r, const T& value, Comp comp = {}, Proj proj = {}); // since C++20
997 using set_union_result = in_in_out_result<I1, I2, O>; // since C++20
1005 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1012 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1019 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1026 Proj1 proj1 = {}, Proj2 proj2 = {}); // since C++20
1031 I inplace_merge(I first, I middle, S last, Comp comp = {}, Proj proj = {}); // since C++20
1037 Proj proj = {}); // since C++20
1041 constexpr subrange<I> unique(I first, S last, C comp = {}, Proj proj = {}); // since C++20
1047 unique(R&& r, C comp = {}, Proj proj = {}); // since C++20
1056 unique_copy(I first, S last, O result, C comp = {}, Proj proj = {}); // since C++20
1065 unique_copy(R&& r, O result, C comp = {}, Proj proj = {}); // since C++20
1068 using remove_copy_result = in_out_result<I, O>; // since C++20
1074 remove_copy(I first, S last, O result, const T& value, Proj proj = {}); // since C++20
1081 remove_copy(R&& r, O result, const T& value, Proj proj = {}); // since C++20
1084 using remove_copy_if_result = in_out_result<I, O>; // since C++20
1090 remove_copy_if(I first, S last, O result, Pred pred, Proj proj = {}); // since C++20
1096 remove_copy_if(R&& r, O result, Pred pred, Proj proj = {}); // since C++20
1099 using replace_copy_result = in_out_result<I, O>; // since C++20
1107 Proj proj = {}); // since C++20
1116 Proj proj = {}); // since C++20
1119 using replace_copy_if_result = in_out_result<I, O>; // since C++20
1126 Proj proj = {}); // since C++20
1133 Proj proj = {}); // since C++20
1136 using prev_permutation_result = in_found_result<I>; // since C++20
1142 ranges::prev_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1148 ranges::prev_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
1151 using next_permutation_result = in_found_result<I>; // since C++20
1157 ranges::next_permutation(I first, S last, Comp comp = {}, Proj proj = {}); // since C++20
1163 ranges::next_permutation(R&& r, Comp comp = {}, Proj proj = {}); // since C++20
1242 InputIterator2 first2, InputIterator2 last2); // since C++14, constexpr in C++20
1253 BinaryPredicate pred); // since C++14, constexpr in C++20
1262 InputIterator2 first2, InputIterator2 last2); // since C++14, constexpr in C++20
1273 BinaryPredicate pred); // since C++14, constexpr in C++20
1283 ForwardIterator2 first2, ForwardIterator2 last2); // since C++14, constexpr in C++20
1294 BinaryPredicate pred); // since C++14, constexpr in C++20
1804 -> decltype(comp(*b1, *b2)); // since C++20
1809 InputIterator2 first2, InputIterator2 last2); // since C++20