Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

missing a fast_hash_map::merge #15

Open
yvdriess opened this issue Jul 6, 2018 · 0 comments
Open

missing a fast_hash_map::merge #15

yvdriess opened this issue Jul 6, 2018 · 0 comments

Comments

@yvdriess
Copy link

yvdriess commented Jul 6, 2018

The merge() function in part of the std::unordered_map interface since C++17. https://en.cppreference.com/w/cpp/container/unordered_map/merge

Is there an implementation-specific trick that can speed up merging two fast_hash_map tables, compared to the iteration+insertion loop? This operation can be destructive to the source container.

Some context: I am dealing with a large amount of relatively small (~ 4kb, page size) tables that regularly get merged and cleared (without dealloc). This happens enough that the performance of the merge is critical.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant