public BloomFilter(int bitSetSize,int expectedNumberOElements){
  this(bitSetSize / (double)expectedNumberOElements,expectedNumberOElements,(int)Math.round((bitSetSize / (double)expectedNumberOElements) * Math.log(2.0)));
}

public BloomFilter ( int bitSetSize , int expectedNumberOElements ) { this ( bitSetSize / ( double ) expectedNumberOElements , expectedNumberOElements , ( int ) Math . round ( ( bitSetSize / ( double ) expectedNumberOElements ) * Math . log ( 2.0 ) ) ) ; }
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 .
