HashFunction.hash() creates non-distinct hashes

[janrieke]

As stated in this paper (p. 4), one should generade "k distinct random indices into B". However, HashFunction.hash() will generate the same hash for each k if h2 (the Murmur hash) is a multiple of m. This causes the filter to become undecodeable very quickly (after m elements on average).