From owner-freebsd-chat@FreeBSD.ORG Sun Mar 7 11:54:35 2004 Return-Path: Delivered-To: freebsd-chat@freebsd.org Received: from mx1.FreeBSD.org (mx1.freebsd.org [216.136.204.125]) by hub.freebsd.org (Postfix) with ESMTP id 7206E16A4CE for ; Sun, 7 Mar 2004 11:54:35 -0800 (PST) Received: from haldjas.folklore.ee (Haldjas.folklore.ee [193.40.6.121]) by mx1.FreeBSD.org (Postfix) with ESMTP id C4FF743D1D for ; Sun, 7 Mar 2004 11:54:34 -0800 (PST) (envelope-from narvi@haldjas.folklore.ee) Received: from haldjas.folklore.ee (localhost [127.0.0.1]) by haldjas.folklore.ee (8.12.10/8.12.10) with ESMTP id i27JsSUA070477; Sun, 7 Mar 2004 21:54:28 +0200 (EET) (envelope-from narvi@haldjas.folklore.ee) Received: from localhost (narvi@localhost)i27JsSsl070474; Sun, 7 Mar 2004 21:54:28 +0200 (EET) (envelope-from narvi@haldjas.folklore.ee) Date: Sun, 7 Mar 2004 21:54:28 +0200 (EET) From: Narvi To: Colin Percival In-Reply-To: <6.0.1.1.1.20040307194055.08e83008@imap.sfu.ca> Message-ID: <20040307214622.Y68396@haldjas.folklore.ee> References: <20040306013914.D38020@haldjas.folklore.ee> <20040306141742.4f41ba27.cpressey@catseye.mine.nu> <20040306155513.6a75e264.cpressey@catseye.mine.nu> <20040307210125.Y68396@haldjas.folklore.ee> <6.0.1.1.1.20040307194055.08e83008@imap.sfu.ca> MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Spam-Status: No, hits=0.0 required=8.0 tests=none autolearn=no version=2.63 X-Spam-Checker-Version: SpamAssassin 2.63 (2004-01-11) on haldjas.folklore.ee cc: freebsd-chat@freebsd.org Subject: Re: FreeBSD Most wanted X-BeenThere: freebsd-chat@freebsd.org X-Mailman-Version: 2.1.1 Precedence: list List-Id: Non technical items related to the community List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Sun, 07 Mar 2004 19:54:35 -0000 On Sun, 7 Mar 2004, Colin Percival wrote: > 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 It is still around. It plays *exteremely* nicely with cache, for example. Sure, it takes some extra care to make sure you don't run into nastiness, but it can give you a very fast and efficent hash. > table, I normally use double hashing and gradual rehashing. But maybe > that's just a personal quirk. > Have you looked at cuckoo hashing? > Colin Percival > >