__proj));
> > > - return {std::move(__middle), std::move(__lasti)};
> > > + auto __pred_proj = __detail::__make_pred_proj(__pred, __proj);
> > > + __first = ranges::find_if_not(__first, __last, __pred_proj);
> >
> > Does this end up going through another
d::move(__middle), std::move(__lasti)};
> > + auto __pred_proj = __detail::__make_pred_proj(__pred, __proj);
> > + __first = ranges::find_if_not(__first, __last, __pred_proj);
>
> Does this end up going through another layer of
> invoke(pred, invoke(proj, *i)) inside ranges::fi
On 26/06/25 22:25 -0400, Patrick Palka wrote:
PR libstdc++/100795
libstdc++-v3/ChangeLog:
* include/bits/ranges_algo.h (__detail::__find_if_not_n): New,
based on the stl_algo.h implementation.
(__detail::__stable_partition_adaptive): Likewise.
(__stable_p
On 26/06/25 22:25 -0400, Patrick Palka wrote:
PR libstdc++/100795
libstdc++-v3/ChangeLog:
* include/bits/ranges_algo.h (__detail::__find_if_not_n): New,
based on the stl_algo.h implementation.
(__detail::__stable_partition_adaptive): Likewise.
(__stable_p
PR libstdc++/100795
libstdc++-v3/ChangeLog:
* include/bits/ranges_algo.h (__detail::__find_if_not_n): New,
based on the stl_algo.h implementation.
(__detail::__stable_partition_adaptive): Likewise.
(__stable_partition_fn::operator()): Reimplement in terms o
