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.

Sign up for GitHub

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

Jump to bottom

[Request] Make unordered_map as fast as Dinkumware's implementation #137

Open
e4lam opened this issue Jul 20, 2022 · 0 comments
Open

[Request] Make unordered_map as fast as Dinkumware's implementation #137

e4lam opened this issue Jul 20, 2022 · 0 comments

Comments

@e4lam
Copy link

e4lam commented Jul 20, 2022

Looking at the benchmarks at the beta docs, it looks like the two Erasure With Duplicate elements cases against Visual Studio 2019 + Dinkumware were slower. It would be great if this could be addressed for the v1.80 final release.

Thanks!
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@e4lam