26-Jul-2013 23:17, Walter Bright пишет:
On 7/26/2013 5:11 AM, Dmitry Olshansky wrote:
26-Jul-2013 14:47, Dmitry Olshansky пишет:
26-Jul-2013 01:25, Walter Bright пишет:
The slowness was in the frackin' "convert the hash to an index in the
bucket", which is a modulus operation.
Then it's past due to finally stop the madness of modulo prime table and
use a power of 2 size. In essence what modulo prime does is simply
enhancing the quality of your hash function w.r.t. collisions (it helps
to distribute values more evenly).
Any of new decent hashes are good enough to work with plain slice the
lower bits approach.
To be more concrete:
http://burtleburtle.net/bob/hash/spooky.html (Public domain)
http://home.comcast.net/~bretm/hash/10.html (Published paper)
Or even a good ol' FNV (Public domain)
How about a pull request so we can try it out?
Thought as much.
I'll be away at the weekends but I'll surely try my hand at it afterwards.