Date: Fri, 28 Dec 2007 09:56:55 -0600 (CST) From: "Sean C. Farley" <scf@FreeBSD.org> To: Ivan Voras <ivoras@FreeBSD.org> Cc: freebsd-hackers@FreeBSD.org, "Aryeh M. Friedman" <aryeh.friedman@gmail.com> Subject: Re: BSD license compatible hash algorithm? Message-ID: <alpine.BSF.1.00.0712280949060.52963@thor.farley.org> In-Reply-To: <9bbcef730712280454w6b6f5e17s33631223d5571f83@mail.gmail.com> 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> <9bbcef730712280454w6b6f5e17s33631223d5571f83@mail.gmail.com>
next in thread | previous in thread | raw e-mail | index | archive | help
On Fri, 28 Dec 2007, Ivan Voras wrote: > On 28/12/2007, Aryeh M. Friedman <aryeh.friedman@gmail.com> wrote: > >> All hashs have issues with pooling.... see >> http://www.burtleburtle.net/bob/hash/index.html... > > Here's a more direct link: > http://www.burtleburtle.net/bob/hash/doobs.html > > This one is much better according to > http://en.wikipedia.org/wiki/Hash_table#Choosing_a_good_hash_function That is the "one" :) I used for a string-based key. I used Knuth's Multiplicative Method[1] for hashing an address along with detection of the compilation platform (32 or 64 bits) to determine the shift. Sean 1. http://www.concentric.net/~Ttwang/tech/addrhash.htm -- scf@FreeBSD.org
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?alpine.BSF.1.00.0712280949060.52963>