|
The ideal hash function |
|
| depends on every argument bit |
| produces a random integer |
| is fast |
|
|
For example (4-byte integers): |
#define HF(x) (h0 + ((x) * 2838338383U & m1))
|
h0 | beginning of hash table | |
2838338383U | a prime number |
m1 = m - 1 | m hash table size, a power of 2 |
| |