Re: Bob Jenkins' hashing implementation in Ruby
From:
ts <decoux@...>
Date:
2003-03-01 13:03:47 UTC
List:
ruby-core #894
>>>>> "M" == Mauricio Fern疣dez <Mauricio> writes: M> The strange thing is that, even though the new hash function was not M> being used (and BTW, it turned out it's not Jenkins but "one-at-a-time"), M> I got some speed increase in simple benchmarks. I believe it's because M> I got rid of the primes and modulus calculations and replaced it with M> bitwise and... Yes, I think this is the replacement of '%' by '&' which make it faster (the difference is in st_lookup()) M> I'm changing string.c and benchmarking again. I will try the M> "one-at-a-time" hash and Jenkins (it's possible here as we know the M> length of the string) to see what's better. Stay tuned :) Probably wrong but it's slower for me. Guy Decoux