I Wrote The Fastest Hashtable
Really interesting article, but the title is a bit of a stretch no?
I quickly compared ska::flat_hash_map (with prime and power of two) to the tsl::hopscotch_map I wrote.
The performances are roughly the same (a bit faster for the power of two version on integers but slower on small std::string, no indirection as they are small enough for SSO).
The main difference is that ska::flat_hash_map and ska::flat_hash_map with power of two need, respectively, ~50% and ~100% more memory than tsl::hopscotch_map (raw results:
Benchmark against @Tessil 's hopscotch-map.
/u/rtessil wrote here:
And provided these benchmarks (description):