question: public BloomFilter ( int bitSetSize , int expectedNumberOElements ) { this ( bitSetSize / ( double ) expectedNumberOElements , expectedNumberOElements , ( int ) Math . round ( ( bitSetSize / ( double ) expectedNumberOElements ) * Math . log ( 2.0 ) ) ) ; }
target:  Constructs an empty Bloom filter. The optimal number of hash functions (k) is estimated from the total size of the Bloom and the number of expected elements.