public BloomFilter(long expectedEntries, double fpp) { checkArgument(expectedEntries > 0, "expectedEntries should be > 0"); checkArgument(fpp > 0.0 && fpp < 1.0, "False positive probability should be > 0.0 & < 1.0"); int nb = optimalNumOfBits(expectedEntries, fpp); // make 'm' multiple of 64 this.numBits = nb + (Long.SIZE - (nb % Long.SIZE)); this.numHashFunctions = optimalNumOfHashFunctions(expectedEntries, numBits); this.bitSet = new BitSet(numBits); }
public BloomFilter(long expectedEntries, double fpp) { checkArgument(expectedEntries > 0, "expectedEntries should be > 0"); checkArgument(fpp > 0.0 && fpp < 1.0, "False positive probability should be > 0.0 & < 1.0"); int nb = optimalNumOfBits(expectedEntries, fpp); // make 'm' multiple of 64 this.numBits = nb + (Long.SIZE - (nb % Long.SIZE)); this.numHashFunctions = optimalNumOfHashFunctions(expectedEntries, numBits); this.bitSet = new BitSet(numBits); }
public BloomFilter(long expectedEntries, double fpp) { checkArgument(expectedEntries > 0, "expectedEntries should be > 0"); checkArgument(fpp > 0.0 && fpp < 1.0, "False positive probability should be > 0.0 & < 1.0"); int nb = optimalNumOfBits(expectedEntries, fpp); // make 'm' multiple of 64 this.numBits = nb + (Long.SIZE - (nb % Long.SIZE)); this.numHashFunctions = optimalNumOfHashFunctions(expectedEntries, numBits); this.bitSet = new BitSet(numBits); }