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
Boost 1.81 released its own unordered_flat_map implementation, it will be appreciated if you could add that to the benchmark as well.
unordered_flat_map
The text was updated successfully, but these errors were encountered:
from my benchmark( https://github.com/ktprime/emhash/blob/master/bench/martinus_bench.cpp ), unordered_flat_map seems to be the fastest in most cases.
Sorry, something went wrong.
No branches or pull requests
Boost 1.81 released its own
unordered_flat_map
implementation, it will be appreciated if you could add that to the benchmark as well.The text was updated successfully, but these errors were encountered: