I've been experimenting with high-performance hash table implementations on the JVM and ended up creating *HashSmith*:

HashSmith is a collection of *open-addressing hash tables for Java*, with a focus on: - Robin Hood probing - SwissTable-style layouts / probing strategies - Benchmarkability: it’s meant to be a playground and reference, not just “yet another Map”