|
3305 | 3305 | requires indirectly_comparable<I1, I2, Pred, Proj1, Proj2>
|
3306 | 3306 | constexpr subrange<I1>
|
3307 | 3307 | ranges::find_end(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
|
3308 |
| - Proj1 proj1 = {}, Proj2 proj2 = {}); |
| 3308 | + Proj1 proj1 = {}, Proj2 proj2 = {}); |
3309 | 3309 | template<forward_range R1, forward_range R2,
|
3310 | 3310 | class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
|
3311 | 3311 | requires indirectly_comparable<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
|
3312 | 3312 | constexpr safe_subrange_t<R1>
|
3313 | 3313 | ranges::find_end(R1&& r1, R2&& r2, Pred pred = {},
|
3314 |
| - Proj1 proj1 = {}, Proj2 proj2 = {}); |
| 3314 | + Proj1 proj1 = {}, Proj2 proj2 = {}); |
3315 | 3315 | \end{itemdecl}
|
3316 | 3316 |
|
3317 | 3317 | \begin{itemdescr}
|
|
6767 | 6767 | requires indirectly_copyable<I, O1> && indirectly_copyable<I, O2>
|
6768 | 6768 | constexpr ranges::partition_copy_result<I, O1, O2>
|
6769 | 6769 | ranges::partition_copy(I first, S last, O1 out_true, O2 out_false, Pred pred,
|
6770 |
| - Proj proj = {}); |
| 6770 | + Proj proj = {}); |
6771 | 6771 | template<input_range R, weakly_incrementable O1, weakly_incrementable O2,
|
6772 | 6772 | class Proj = identity,
|
6773 | 6773 | indirect_unary_predicate<projected<iterator_t<R>, Proj>> Pred>
|
|
0 commit comments