In message <[EMAIL PROTECTED]>, 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
[EMAIL PROTECTED] | 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 [EMAIL PROTECTED]
with "unsubscribe freebsd-hackers" in the body of the message
