Re: BSD license compatible hash algorithm?
- From: Dag-Erling Smørgrav <des@xxxxxx>
- Date: Sat, 29 Dec 2007 12:47:44 +0100
"Aryeh M. Friedman" <aryeh.friedman@xxxxxxxxx> 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
--
Dag-Erling Smørgrav - des@xxxxxx
_______________________________________________
freebsd-hackers@xxxxxxxxxxx mailing list
http://lists.freebsd.org/mailman/listinfo/freebsd-hackers
To unsubscribe, send any mail to "freebsd-hackers-unsubscribe@xxxxxxxxxxx"
- Follow-Ups:
- Re: BSD license compatible hash algorithm?
- From: Aryeh M. Friedman
- Re: BSD license compatible hash algorithm?
- References:
- BSD license compatible hash algorithm?
- From: Garrett Cooper
- Re: BSD license compatible hash algorithm?
- From: Brooks Davis
- Re: BSD license compatible hash algorithm?
- From: Garrett Cooper
- Re: BSD license compatible hash algorithm?
- From: Ivan Voras
- Re: BSD license compatible hash algorithm?
- From: Aryeh M. Friedman
- BSD license compatible hash algorithm?
- Prev by Date: Re: Architectures with strict alignment?
- Next by Date: Re: Architectures with strict alignment?
- Previous by thread: Re: BSD license compatible hash algorithm?
- Next by thread: Re: BSD license compatible hash algorithm?
- Index(es):