https://gcc.gnu.org/bugzilla/show_bug.cgi?id=103621
François Dumont <fdumont at gcc dot gnu.org> changed: What |Removed |Added ---------------------------------------------------------------------------- Target Milestone|--- |13.0 Status|UNCONFIRMED |RESOLVED CC| |fdumont at gcc dot gnu.org Resolution|--- |FIXED --- Comment #1 from François Dumont <fdumont at gcc dot gnu.org> --- I think it has been fixed by: commit 63d182fb86e47323ac50d9368845d712e1f7da89 Author: François Dumont <fdum...@gcc.gnu.org> Date: Thu Jan 21 19:30:47 2021 +0100 libstdc++: Enhance branching in std::inplace_merge and std::stable_sort When we manage to allocate a buffer of the expected size we can simplify the code to perform the expected algorithm. libstdc++-v3/ChangeLog: * include/bits/stl_algo.h (__merge_adaptive): Adapt to merge only when buffer is large enough.. (__merge_adaptive_resize): New, adapt merge when buffer is too small. (__inplace_merge): Adapt, use latter. (__stable_sort_adaptive): Adapt to sort only when buffer is large enough. (__stable_sort_adaptive_resize): New, adapt sort when buffer is too small. (__stable_sort): Adapt, use latter. Let us know otherwise.