question: public BloomFilter ( final Hasher hash , double falsePositiveProbability , int expectedNumberOfElements , int metric ) { this ( hash , Math . ceil ( - ( Math . log ( falsePositiveProbability ) / Math . log ( 2 ) ) ) / Math . log ( 2 ) , expectedNumberOfElements , ( int ) Math . ceil ( - ( Math . log ( falsePositiveProbability ) / Math . log ( 2 ) ) ) , metric ) ; }
target:  Constructs an empty Bloom filter with a given false positive probability. The number of bits per element and the number of hash functions is estimated to match the false positive probability.