Re: Switch statement code generation

Pertti Kellomaki <pertti.kellomaki@tut.fi>
Mon, 16 Nov 2009 09:45:39 +0200

          From comp.compilers
Related articles
[12 earlier articles]
Re: Switch statement code generation bear@sonic.net (Ray) (2009-11-09)
Re: Switch statement code generation DrDiettrich1@aol.com (Hans-Peter Diettrich) (2009-11-11)
Re: Switch statement code generation derek@knosof.co.uk (Derek M. Jones) (2009-11-11)
Re: Switch statement code generation anton@mips.complang.tuwien.ac.at (2009-11-11)
Re: Switch statement code generation idbaxter@semdesigns.com (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 pertti.kellomaki@tut.fi (Pertti Kellomaki) (2009-11-16)
Re: Switch statement code generation haberg_20080406@math.su.se (Hans Aberg) (2009-11-17)
| List of all articles for this month |
From: Pertti Kellomaki <pertti.kellomaki@tut.fi>
Newsgroups: comp.compilers
Date: Mon, 16 Nov 2009 09:45:39 +0200
Organization: Compilers Central
References: 09-11-046
Keywords: code, theory
Posted-Date: 17 Nov 2009 00:59:29 EST

John 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.
--
Pertti


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.