A C++ implementation of a fast hash map and hash set using hopscotch hashing

mgaunard

How does it compare to boost unordered flat map? Looks like the benchmarks were last updated in 2019.

jll29

google::dense_hash_map is faster than this new implementation according to their benchmark's diagram (google::dense_hash_map has the lowest runtime of all tested methods).

teo_zero

The concept is very similar to robin hood. In fact most of the performance charts show that the curves of hopscotch and robin hood are very close. I think I'd prefer robin hood as it's well known.