Hello,
I was looking at bloomfilter implementation and i saw at HashFunction,
basically is a trait for murmurhash but it reduces the collision space to
4G.
public class Murmur128Hash {
/**
* get hashcode of value by seed
*
* @param value value
* @param seed seed
* @return hashcode of value
*/
public static int hash(String value, int seed) {
return (int) innerHash(value.getBytes(), 0, value.getBytes().length,
seed);
}
The cast alone might be not enough since we might lose entropy. What about
doing the cast just after the capping that you're doing in HashFunction. Am
I missing something?
Best Regards,
Giorgio
