Date: Sat, 29 Dec 2007 12:47:44 +0100 From: =?utf-8?Q?Dag-Erling_Sm=C3=B8rgrav?= <des@des.no> To: "Aryeh M. Friedman" <aryeh.friedman@gmail.com> Cc: freebsd-hackers@freebsd.org, Ivan Voras <ivoras@freebsd.org> Subject: Re: BSD license compatible hash algorithm? Message-ID: <86r6h5zpr3.fsf@ds4.des.no> In-Reply-To: <4774EF27.90307@gmail.com> (Aryeh M. Friedman's message of "Fri\, 28 Dec 2007 07\:42\:15 -0500") References: <5950EE0C-383D-4D6B-9991-A0DEABD2ADE4@u.washington.edu> <20071228003716.GB48997@lor.one-eyed-alien.net> <B8D4C3C6-B867-4550-9F17-4DC6930D10E2@u.washington.edu> <fl2qiv$qoh$1@ger.gmane.org> <4774EF27.90307@gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
"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
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?86r6h5zpr3.fsf>