"Aryeh M. Friedman" <aryeh.friedman@gmail.com> writes:
> All hashs have issues with pooling.... see
> http://www.burtleburtle.net/bob/hash/index.html... btw it is a old
> wives tale that the number of buckets should be prime (mostly based on
> the very weak implementation Knuth offered)
Not an "old wives' tale", but rather an easy way to implement a hash
algorithm that is good enough for most simple uses: metric modulo table
size, where metric is a number derived from the item in such a manner as
to give a good spread.
DES
--=20
Dag-Erling Sm=C3=B8rgrav - des@des.no
_______________________________________________
freebsd-hackers@freebsd.org mailing list
http://lists.freebsd.org/mailman/listinfo/freebsd-hackers
To unsubscribe, send any mail to "freebsd-hackers-unsubscribe@freebsd.org"