|Hash specifics email@example.com (1990-12-11)|
|Re: Hash specifics firstname.lastname@example.org (1990-12-11)|
|Re: Hash specifics chased@Eng.Sun.COM (1990-12-11)|
|Re: Hash specifics email@example.com (1990-12-11)|
|Re: Hash specifics firstname.lastname@example.org (1990-12-12)|
|Re: Hash specifics baxter@zola.ICS.UCI.EDU (Ira Baxter) (1990-12-13)|
|Re: Hash specifics lupine!rfg@uunet.UU.NET (1990-12-13)|
|[11 later articles]|
|From:||email@example.com (Adriaan Degroot)|
|Date:||Tue, 11 Dec 90 12:13:53 MST|
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 firstname.lastname@example.org, before Dec 20th or so
(after that mail 'll bounce)
This is NOT homework.
[See the next message. -John]
Return to the
Search the comp.compilers archives again.