- create
- mightContain
Returns true if the element might have been put in this Bloom filter, false if
this is definitely no
- put
Puts an element into this BloomFilter. Ensures that subsequent invocations of
#mightContain(Object)
- <init>
- optimalNumOfBits
Computes m (total bits of Bloom filter) which is expected to achieve, for the
specified expected ins
- optimalNumOfHashFunctions
Computes the optimal k (number of hashes per element inserted in Bloom filter),
given the expected i
- bitSize
Returns the number of bits in the underlying bit array.
- putAll
Combines this bloom filter with another bloom filter by performing a bitwise OR
of the underlying da
- apply
Equivalent to #mightContain; provided only to satisfy the Predicate interface.
When using a referenc
- expectedFpp
Returns the probability that #mightContain(Object) will erroneously return true
for an object that h
- toBloomFilter
Returns a Collector expecting the specified number of insertions, and yielding a
BloomFilter with th
- approximateElementCount
Returns an estimate for the total number of distinct elements that have been
added to this Bloom fil