public BloomFilter(double c,int n,int k){
  this.expectedNumberOfFilterElements=n;
  this.k=k;
  this.bitsPerElement=c;
  this.bitSetSize=(int)Math.ceil(c * n);
  numberOfAddedElements=0;
  this.bitset=new BitSet(bitSetSize);
}

public BloomFilter ( double c , int n , int k ) { this . expectedNumberOfFilterElements = n ; this . k = k ; this . bitsPerElement = c ; this . bitSetSize = ( int ) Math . ceil ( c * n ) ; numberOfAddedElements = 0 ; this . bitset = new BitSet ( bitSetSize ) ; }
constructs an empty bloom filter . the total length of the bloom filter will be c * n .
