Lines Matching defs:numHashFunctions
44 * A strategy to translate T instances, to {@code numHashFunctions} bit indexes.
48 * Sets {@code numHashFunctions} bits of the given bit array, by hashing a user element.
50 <T> void put(T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits);
53 * Queries {@code numHashFunctions} bits of the given bit array, by hashing a user element;
57 T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits);
64 private final int numHashFunctions;
70 * The strategy we employ to map an element T to {@code numHashFunctions} bit indexes.
77 private BloomFilter(BitArray bits, int numHashFunctions, Funnel<T> funnel,
79 Preconditions.checkArgument(numHashFunctions > 0, "numHashFunctions zero or negative");
81 this.numHashFunctions = numHashFunctions;
91 return strategy.mightContain(object, funnel, numHashFunctions, bits);
99 strategy.put(object, funnel, numHashFunctions, bits);
103 return numHashFunctions;
108 1 - Math.exp(-numHashFunctions * ((double) insertions / (bits.size()))),
109 numHashFunctions);
143 int numHashFunctions = optimalNumOfHashFunctions(expectedInsertions, numBits);
144 return new BloomFilter<T>(new BitArray(numBits), numHashFunctions, funnel,
218 final int numHashFunctions;
224 this.numHashFunctions = bf.numHashFunctions;
229 return new BloomFilter<T>(new BitArray(data), numHashFunctions, funnel, strategy);
