6 ms·
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 j
by htfy96 4y ago
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/ https://martin.ankerl.com/2022/08/27/hashmap-bench-01/.
- jeffbee 4y agoIt'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".
- waynesonfire 4y agoUhh.. super irrelevant--being web scale is the most important attribute.
- no_wizard 4y agoI 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
- layer8 4y agoI’m pretty sure they’re being sarcastic.
- MauranKilom 4y ago> 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 https://www.youtube.com/watch?v=b2F-DItXtZs)
- tubs 4y agoThat link does not have boost unordered_flat_map?