this post was submitted on 30 May 2024
16 points (100.0% liked)
C++
1708 readers
1 users here now
The center for all discussion and news regarding C++.
Rules
- Respect instance rules.
- Don't be a jerk.
- Please keep all posts related to C++.
founded 1 year ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
tl;dr:
std::unordered_map is one of the worst ones, boost::unordered_flat_map and absl::flat_hash_map are one of the best.
It should be noted that the benchmark focused on the
std::unordered_map
implementation from GCC 13.2.0. I'm not sure if/how this conclusion can be extended to other implementations such as msvc or clang.Well the author claims that it's not possible for std::unordered_map to get close to other implementations because of constraints that the standard imposes on it. I.e. faster implementations simply behave slightly differently (in ways that are not important to most users).