Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!samsung!think.com!paperboy!hsdndev!spdcc!iecc!compilers-sender
From: degroot@cpsc.ucalgary.ca (Adriaan Degroot)
Newsgroups: comp.compilers
Subject: Hash specifics
Keywords: design
Message-ID: <9012111913.AA07310@cs-sun-fsa.cpsc.ucalgary.ca>
Date: 11 Dec 90 19:13:53 GMT
Sender: compilers-sender@iecc.cambridge.ma.us
Reply-To: degroot@cpsc.ucalgary.ca (Adriaan Degroot)
Organization: Compilers Central
Lines: 16
Approved: compilers@iecc.cambridge.ma.us

How does one build a hash function with minimal table size and minimal
collisions for a known set of hash strings?

i.e. I want to hash the one hundred + opcodes for the Intel 386 processor
into the smallest possible table with the fewest collisions.  Is there any
way of quickly finding a function to do that, or am I stuck with endless
tweaking of the hash parameters? If anyone has done this % before, please
let me know by email degroot@cpsc.ucalgary.ca, before Dec 20th or so
(after that mail 'll bounce)

This is NOT homework.

[See the next message. -John]
-- 
Send compilers articles to compilers@iecc.cambridge.ma.us or
{ima | spdcc | world}!iecc!compilers.  Meta-mail to compilers-request.