This is the mail archive of the binutils@sourceware.org mailing list for the binutils project.
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
Other format: | [Raw text] |
>> I have always thought that using prime numbers as the hash table >> size was necessary in order to get an efficient use of all the >> buckets. Of course this may just be an urban myth, I do not know >> of any actual theoretical work to back this up.
Doug> Knuth Volume 3, 6.4 Hashing ?
If you use "add the hash" rehashing as the way to resolve hash collisions, then you need a prime size. For other schemes, like linked list buckets, sequential probe, etc., any table size works, assuming of course that the hash function itself is good.
Cheers Nick
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |