https://gcc.gnu.org/bugzilla/show_bug.cgi?id=127690
--- Comment #10 from Oleksandr Kulkov <adamant.pwn at gmail dot com> --- > You should be able to build that on top of std::flat_set. Not at all, tree_order_statistics_node_update allows insertions/erasure in O(log n) time, while flat_set makes them O(n), which is completely impractical for a large dynamic use case.
