2 ms·
The common "Multiply Shift" hash function is exactly what the article calls "Fibonacci Hashing" except for which constant is being multiplied by. That "Shift" p
by thomasahle 3y ago
The common "Multiply Shift" hash function is exactly what the article calls "Fibonacci Hashing" except for which constant is being multiplied by.
That "Shift" part of "Multiply Shift" is what I assume you're referring to with "remapping".
- vidarh 3y agoOnly partially, in that the number of bits to shift needs to change if the hash table is resized. And so if your hash table also controls the hashing of the keys, those steps can be combined. But it's often the case that its not in control of that, and so they're often separate steps.