We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Inserting in "hash order" can dramatically degrade the performance of insertion. This can be easily triggered by:
unordered_flat_map<int, int> map1(...); unordered_flat_map<int, int> map2; for (auto const& kv: map1) { map2.insert(kv); }
For users, this can be circumvented easily by either using the copy constructor or by calling reserve() prior to insertion.
reserve()
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Inserting in "hash order" can dramatically degrade the performance of insertion. This can be easily triggered by:
For users, this can be circumvented easily by either using the copy constructor or by calling
reserve()
prior to insertion.The text was updated successfully, but these errors were encountered: