[lang] already has a HashCodeBuilder that copes with generating fairly ordinary cases. Are specialised hashcodes really that useful? Stephen
----- Original Message ----- From: "Ola Berg" <[EMAIL PROTECTED]> It is difficult with good hashing. But I am into giving a static utility hashing class a try, since I think it is justified in lang. I experiment with two approaches: bit mangling functions (a la Thomas Wang http://www.concentric.net/~Ttwang/tech/inthash.htm ) and lookup-tables ("buztables") like Robert Uzgalis (http://www.serve.net/buz/hash.adt/java.008.html). The buztable that Robert provides contains 256 long values, unbiased at the bitlevel and collision free. But I would like buztables for bytes, shorts/chars, and ints too. Do any of you know a good method for generating them? /O -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]> -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
