|[13 earlier articles]|
|Re: Switch statement code generation DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-11-11)|
|Re: Switch statement code generation firstname.lastname@example.org (Derek M. Jones) (2009-11-11)|
|Re: Switch statement code generation email@example.com (2009-11-11)|
|Re: Switch statement code generation firstname.lastname@example.org (Ira Baxter) (2009-11-14)|
|Re: Switch statement code generation cfc@shell01.TheWorld.com (Chris F Clark) (2009-11-15)|
|Re: Switch statement code generation email@example.com (Pertti Kellomaki) (2009-11-16)|
|Re: Switch statement code generation firstname.lastname@example.org (Hans Aberg) (2009-11-17)|
|From:||Hans Aberg <email@example.com>|
|Date:||Tue, 17 Nov 2009 10:16:59 +0100|
|Organization:||A noiseless patient Spider|
|Posted-Date:||17 Nov 2009 11:26:11 EST|
Pertti Kellomaki wrote:
>> [I gather that finding a perfect hash function that runs quickly is
>> not always easy, and that a slightly imperfect hash, e.g., into a
>> hash table with no collisions but a few empty slots can often be
>> a lot faster. -John]
> Is there a technical term for such slightly imperfect hashes?
> Mathematically it would be an injection I suppose, but I have
> not seen that term used in connection with hashing.
The Wikipedia perfect hash function page says this is the definition of
a perfect hash function. It is called a minimal perfect function if the
image is an interval.
It also mentions some libraries implementing minimal perfect hash functions:
The latter also implements monotone minimal perfect hash functions, that
is, the order of the keys are preserved.
Return to the
Search the comp.compilers archives again.