Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Hashtable alternatives gwynfa@paradise.net.nz (Gwynfa) (2000-07-27) |
| Re: Hashtable alternatives bediger@teal.sni.net (Bruce Ediger) (2000-07-29) |
| Re: Hashtable alternatives rkrayhawk@aol.com (2000-08-04) |
| perfect hashing preston@tera.com (Preston Briggs) (2000-08-04) |
| Re: perfect hashing ceco@jupiter.com (Tzvetan Mikov) (2000-08-05) |
| Re: perfect hashing jsgray@acm.org (Jan Gray) (2000-08-09) |
| Re: perfect hashing jmochel@foliage.com (2000-08-10) |
| Re: perfect hashing fjh@cs.mu.OZ.AU (2000-08-10) |
| Re: perfect hashing parz@home.com (Parzival) (2000-08-10) |
| [5 later articles] |
| From: | rkrayhawk@aol.com (RKRayhawk) |
| Newsgroups: | comp.compilers |
| Date: | 4 Aug 2000 16:02:17 -0400 |
| Organization: | AOL http://www.aol.com |
| References: | 00-07-064 |
| Keywords: | theory |
There is matter related to selecting hash techniques at
http://burtleburtle.net/bob/hash/perfect.html
entitled "Minimal Perfect Hashing", technical terminlology not empty
claims. The page and its links and downloadables are is very readable
for any experience level.
Some of the stuff was published in ( I think Dr Dobb's), but there are
updates at the site.
Also mention there is GNU gperf.
Robert Rayhawk
RKRayhawk@aol.com
[Perfect hashing is sometimes useful for a fixed table of keywords, but
you can't use it for a normal symbol table. -John]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.