Improving/Measure performance of hashmap

[EinfachAndy]

There exists different algorithm to handle collisions for the linear probing strategy. One interesting an practicable way is the Robin Hood hashing.

good illustration: https://programming.guide/robin-hood-hashing.html

c++ implementation: https://github.com/Tessil/robin-map/blob/master/include/tsl/robin_hash.h

I created a pull request as a first draft: https://github.com/zyedidia/generic/pull/41

What do you think about such performance issues? It is still an open task to measure it. What do you think about to create a performance measure tooling like: https://tessil.github.io/2016/08/29/benchmark-hopscotch-map.html in golang? Or do you know good tools?