From owner-freebsd-hackers Mon Jan 29 14:12:59 2001 Delivered-To: freebsd-hackers@freebsd.org Received: from critter.freebsd.dk (flutter.freebsd.dk [212.242.40.147]) by hub.freebsd.org (Postfix) with ESMTP id D17C737B402 for ; Mon, 29 Jan 2001 14:12:38 -0800 (PST) Received: from critter (localhost [127.0.0.1]) by critter.freebsd.dk (8.11.1/8.11.1) with ESMTP id f0TMCbK24887; Mon, 29 Jan 2001 23:12:37 +0100 (CET) (envelope-from phk@critter.freebsd.dk) To: Bakul Shah Cc: Matt Dillon , hackers@FreeBSD.ORG Subject: Re: [kernel patch] fcntl(...) to close many descriptors In-Reply-To: Your message of "Mon, 29 Jan 2001 14:00:50 PST." <3A75E812.F1182BF6@bitblocks.com> Date: Mon, 29 Jan 2001 23:12:37 +0100 Message-ID: <24885.980806357@critter> From: Poul-Henning Kamp Sender: owner-freebsd-hackers@FreeBSD.ORG Precedence: bulk X-Loop: FreeBSD.ORG In message <3A75E812.F1182BF6@bitblocks.com>, Bakul Shah writes: >> >If you can get to old CACMs see `Minimal Perfect Hash Functions Made Simple' >> >by Richard J. Cichelli, Comm. of ACM, Jan 1980. AFAIK gperf uses some >> >variation of that algorithm and may have some details. A minimal perfect hash >> >function is only worth it (IMHO) when the set of input keys is mostly fixed and >> >the hash function is used many many times (e.g. programming language keywords). >> >> And even then it's seldom worth it according to the people behind the LCC >> compiler... > >I'd be interested in a reference if you have one [I don't doubt you, just >curious). They say so in their book: http://www.amazon.com/exec/obidos/ASIN/0805316701/qid=980806275/sr=1-28/ref=sc_b_28/104-5366240-4220700 -- Poul-Henning Kamp | UNIX since Zilog Zeus 3.20 phk@FreeBSD.ORG | TCP/IP since RFC 956 FreeBSD committer | BSD since 4.3-tahoe Never attribute to malice what can adequately be explained by incompetence. To Unsubscribe: send mail to majordomo@FreeBSD.org with "unsubscribe freebsd-hackers" in the body of the message