This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Hashing of "switch/case" selections
- To: gcc at gcc dot gnu dot org, jawalker at stl dot quik dot com
- Subject: Re: Hashing of "switch/case" selections
- From: dewar at gnat dot com (Robert Dewar)
- Date: Thu, 28 Dec 2000 10:15:08 -0500 (EST)
unique hashes are not even desirable, note that in particular the
original input meets the definition of a unique hash. I don't find
the concept at all useful in this context.
What you are loking for is of course a near-minimal perfect hash, that
is what BCPL compilers used for case statements. Quite a bit was published
in the BCPL context about this approach, so I recommend looking into the
literature (it is quite old, you might have to go to a library - GASP :-)