On Sat, Feb 28, 2015 at 1:53 PM, Thomas Helland
wrote:
> This should give better cache locality, less memory consumption,
> less code, and should also be faster since we avoid a modulo operation.
>
> This is not the quadratic probing function you see most places.
> They do not accumulate, so you t
This should give better cache locality, less memory consumption,
less code, and should also be faster since we avoid a modulo operation.
This is not the quadratic probing function you see most places.
They do not accumulate, so you try hash +1, +4, +9, etc.
My code accumulates; so it becomes hash
