On Thu, Jan 30, 2025 at 2:34 PM Ted Lyngmo via Std-Proposals <
std-proposals_at_[hidden]> wrote:

> Hi!
>
> I have an idea for a set of "unstable" erase/remove algorithms that will
> move at most as many elements for which the predicate returns true.
>

https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/p0041r0.html
"Unstable remove algorithms" (2015). I know this was in front of SG14 many
years ago, but I don't know what happened to it; it predates the modern
GitHub-issue workflow for tracking papers (https://wg21.link/p0041/github
is a 404). Personally, I think it would be plausible to revive — I doubt it
failed for any particular technical reason.

You might like to compare/contrast your
https://github.com/TedLyngmo/liblyncpp/blob/main/include/lyn/algorithm.hpp
with
https://github.com/Quuxplusone/SG14/blob/master/include/sg14/algorithm_ext.h#L68-L130

–Arthur