|
1444 | 1444 | template<@\libconcept{bidirectional_iterator}@ I, @\libconcept{sentinel_for}@<I> S, |
1445 | 1445 | @\exposconcept{indirectly-binary-right-foldable}@<iter_value_t<I>, I> F> |
1446 | 1446 | requires @\libconcept{constructible_from}@<iter_value_t<I>, iter_reference_t<I>> |
1447 | | - constexpr auto fold_right_last(I first, S last, F f); |
| 1447 | + constexpr auto fold_right_last(I first, S last, F f); |
1448 | 1448 |
|
1449 | 1449 | template<@\libconcept{bidirectional_range}@ R, |
1450 | 1450 | @\exposconcept{indirectly-binary-right-foldable}@<range_value_t<R>, iterator_t<R>> F> |
|
2200 | 2200 | constexpr void stable_sort(RandomAccessIterator first, RandomAccessIterator last); |
2201 | 2201 | template<class RandomAccessIterator, class Compare> |
2202 | 2202 | constexpr void stable_sort(RandomAccessIterator first, RandomAccessIterator last, |
2203 | | - Compare comp); |
| 2203 | + Compare comp); |
2204 | 2204 | template<class ExecutionPolicy, class RandomAccessIterator> |
2205 | 2205 | void stable_sort(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads} |
2206 | 2206 | RandomAccessIterator first, RandomAccessIterator last); |
|
2696 | 2696 | OutputIterator result); |
2697 | 2697 | template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare> |
2698 | 2698 | constexpr OutputIterator |
2699 | | - set_union(InputIterator1 first1, InputIterator1 last1, |
| 2699 | + set_union(InputIterator1 first1, InputIterator1 last1, |
2700 | 2700 | InputIterator2 first2, InputIterator2 last2, |
2701 | 2701 | OutputIterator result, Compare comp); |
2702 | 2702 | template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2, |
|
0 commit comments