Re:Boost:Unordered_flat_map
by htfy96 on Friday November 18, 2022 @04:26PM
(#33662487)
To anybody unfamiliar with recent progress, boost::unordered_flat_map is the fastest open-addressing hash map implementation in this field for C++. Coming out just several months ago, it outperforms absl::flat_hash_map and various other implementations benchmarked in https://martin.ankerl.com/2022/08/27/hashmap-bench-01/.
[ Parent
| on HN ]
It's a little hard to take seriously some of the top performers in that table, like emhash8, when the implementations are only a couple of weeks old and the commits are things like "fix crash", "fix clear", and "fix overflow".
Re:Boost:Unordered_flat_map
by waynesonfire on Saturday November 19, 2022 @05:37PM
(#33675585)
Uhh.. super irrelevant--being web scale is the most important attribute.
I think I need more context for whet you’re trying to say here. I understand “web scale” in the marketing term Mongo sense but I don’t know how that applies to this
I’m pretty sure they’re being sarcastic.
Re:Boost:Unordered_flat_map
by MauranKilom on Saturday November 19, 2022 @07:16PM
(#33676575)
> I understand “web scale” in the marketing term Mongo sense
That's the joke.
(And for anyone who hasn't seen it: https://www.youtube.com/watch?v=b2F-DItXtZs)