goossaert / hashmap Goto Github PK

The implementation of Hopscotch lacks a technique to make a wrap around, the current algorithm is not correct in such a case. First, there should be a certain condition to check if Bucket[j] is in neighborhood of Bucket[i] when j < i (For instance bucket[0] is in neighborhood of Bucket[MapSize - 1]).

I've written an implementation in C that has a wrap around functionality. You can check it out at :https://github.com/karim-manaouil/Hashmaps

I was curious how others handled updating MaxProbeDistance after a Backshift remove op, and I noticed you don't update it at all.

AFAIK the only way is to iterate through all the buckets to find it.

What's the purpose of DELETED_BUCKET ? It's value is assigned on the constructor to a special value and then it is used on several comparisons, but as far as I can see all those comparisons make no sense because no other variable or data member is ever assigned that same special value.