1. Changelog

R0

First submission

2. Motivation and scope
In the Tokyo 2024 meeting [P2248R8] was adopted. Due to an oversight
(which is entirely our fault)
was accidentally
excluded from the algorithms for which a default template type
parameter for the "value" argument was provided.
We propose to modify
’s specification, so that it matches
the postP2248 one for the rest of the algorithms (especially
).
3. Proposed Wording
All the proposed changes are relative to [N4971], assuming that [P2248R8]'s wording has been merged already.
Modify [alg.find.last] as shown:
template < forward_iterator I , sentinel_for < I > S , class T , class Proj = identity , class T = projected_value_t < I , Proj > > requires indirect_binary_predicate < ranges :: equal_to , projected < I , Proj > , const T *> constexpr subrange < I > ranges :: find_last ( I first , S last , const T & value , Proj proj = {}); template < forward_range R , class T , class Proj = identity , class T = projected_value_t < iterator_t < R > , Proj > > requires indirect_binary_predicate < ranges :: equal_to , projected < iterator_t < R > , Proj > , const T *> constexpr borrowed_subrange_t < R > ranges :: find_last ( R && r , const T & value , Proj proj = {});
4. Acknowledgements
Thanks to Jens Maurer for pointing out this oversight of [P2248R8].
Thanks to KDAB for supporting this work.
All remaining errors are ours and ours only.