Home
last modified time | relevance | path

Searched refs:numHashFunctions (Results 1 – 2 of 2) sorted by relevance

/external/guava/guava/src/com/google/common/hash/
DBloomFilter.java75 <T> boolean put(T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits); in put() argument
82 T object, Funnel<? super T> funnel, int numHashFunctions, BitArray bits); in mightContain() argument
98 private final int numHashFunctions; field in BloomFilter
111 private BloomFilter(BitArray bits, int numHashFunctions, Funnel<? super T> funnel, in BloomFilter() argument
113 checkArgument(numHashFunctions > 0, in BloomFilter()
114 "numHashFunctions (%s) must be > 0", numHashFunctions); in BloomFilter()
115 checkArgument(numHashFunctions <= 255, in BloomFilter()
116 "numHashFunctions (%s) must be <= 255", numHashFunctions); in BloomFilter()
118 this.numHashFunctions = numHashFunctions; in BloomFilter()
130 return new BloomFilter<T>(bits.copy(), numHashFunctions, funnel, strategy); in copy()
[all …]
DBloomFilterStrategies.java46 int numHashFunctions, BitArray bits) { in MURMUR128_MITZ_32() argument
53 for (int i = 1; i <= numHashFunctions; i++) { in MURMUR128_MITZ_32()
65 int numHashFunctions, BitArray bits) { in MURMUR128_MITZ_32() argument
71 for (int i = 1; i <= numHashFunctions; i++) { in MURMUR128_MITZ_32()
93 int numHashFunctions, BitArray bits) { in MURMUR128_MITZ_64() argument
101 for (int i = 0; i < numHashFunctions; i++) { in MURMUR128_MITZ_64()
111 int numHashFunctions, BitArray bits) { in MURMUR128_MITZ_64() argument
118 for (int i = 0; i < numHashFunctions; i++) { in MURMUR128_MITZ_64()