https://gcc.gnu.org/bugzilla/show_bug.cgi?id=127690
--- Comment #8 from Jonathan Wakely <redi at gcc dot gnu.org> --- (In reply to Oleksandr Kulkov from comment #5) > One especially useful feature of pb_ds is tree_order_statistics_node_update, > which adds order_of_key() and find_by_order() functions to the regular > std::set. It is not covered by the standard library, and it probably can't > be, because it would require to keep subtree size metadata in std::set, > which would significantly increase its size. You should be able to build that on top of std::flat_set. > Other parts of pb_ds may not have standard library coverage either, but I > can't readily tell how significant they are. I saw a blog that gp_hash_table > performs "orders of magnitude" better than std::unordered_set: > https://codeforces.com/blog/entry/60737. Abseil and Boost have faster hash containers, which use state of the art techniques rather than 25 year old ones.
