Date: Sun, 07 Mar 2004 19:45:35 +0000 From: Colin Percival <colin.percival@wadham.ox.ac.uk> To: Narvi <narvi@haldjas.folklore.ee> Cc: freebsd-chat@freebsd.org Subject: Re: FreeBSD Most wanted Message-ID: <6.0.1.1.1.20040307194055.08e83008@imap.sfu.ca> In-Reply-To: <20040307210125.Y68396@haldjas.folklore.ee> References: <Pine.LNX.4.43.0403011839470.3269-100000@pilchuck.reedmedia.net> <20040306005744.T38020@haldjas.folklore.ee> <20040306013914.D38020@haldjas.folklore.ee> <6.0.1.1.1.20040306214526.08c5ed70@imap.sfu.ca> <20040306141742.4f41ba27.cpressey@catseye.mine.nu> <20040306155513.6a75e264.cpressey@catseye.mine.nu> <20040307110427.67a4394e.cpressey@catseye.mine.nu> <20040307210125.Y68396@haldjas.folklore.ee>
next in thread | previous in thread | raw e-mail | index | archive | help
At 19:31 07/03/2004, Narvi wrote: >The *traditional* hash table is one that uses linear probing, that is, it >converts a list to a nice cache friendly array and provides you with a >hint where you should start looking. Does anyone actually do that any more? When I absolutely need a hash table, I normally use double hashing and gradual rehashing. But maybe that's just a personal quirk. Colin Percival
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?6.0.1.1.1.20040307194055.08e83008>