Jelle Raaijmakers c08d137fcd AK: Reimplement HashTable with smart linear probing ...

Instead of rehashing on collisions, we use Robin Hood hashing: a simple
linear probe where we keep track of the distance between the bucket and
its ideal position. On insertion, we allow a new bucket to "steal" the
position of "rich" buckets (those near their ideal position) and move
them further down.

On removal, we shift buckets back up into the freed slot, decrementing
their distance while doing so.

This behavior automatically optimizes the number of required probes for
any value, and removes the need for periodic rehashing (except when
expanding the capacity).

2023-02-17 22:29:51 -07:00

9.6 KiB

Raw Blame History

View Raw