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

Add boost::unordered_flat_map to the benchmark #36

Open
atyuwen opened this issue Jul 4, 2023 · 1 comment
Open

Add boost::unordered_flat_map to the benchmark #36

atyuwen opened this issue Jul 4, 2023 · 1 comment

Comments

@atyuwen
Copy link

atyuwen commented Jul 4, 2023

Boost 1.81 released its own unordered_flat_map implementation, it will be appreciated if you could add that to the benchmark as well.

@atyuwen atyuwen changed the title Add boost::unordered_flat_map to benchmark Add boost::unordered_flat_map to the benchmark Jul 4, 2023
@ktprime
Copy link
Contributor

ktprime commented Jul 4, 2023

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.

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

2 participants