Messages in this thread | | | Subject | Re: more on hash functions | Date | Tue, 13 Apr 1999 09:14:10 -0400 | From | Horst von Brand <> |
| |
Chuck Lever <cel@monkey.org> said:
[...]
> actually, this was my first implementation choice. i found that the hash > function didn't work very well with 3 8-bit tables -- it had poor > bucket size distribution characteristics. how does one combine 3 8-bit > values appropriately to get, say, a 14-bit table index?
a ^ (b << 3) ^ (c << 6) -- Dr. Horst H. von Brand mailto:vonbrand@inf.utfsm.cl Departamento de Informatica Fono: +56 32 654431 Universidad Tecnica Federico Santa Maria +56 32 654239 Casilla 110-V, Valparaiso, Chile Fax: +56 32 797513
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
| |