computes the optimal k number of hashes per item inserted in bloom filter , given the expected insertions and total number of bits in the bloom filter . see http://en.wikipedia.org/wiki/file:bloom_filter_fp_probability.svg for the formula . concode_field_sep double DEFAULT_FPP concode_elem_sep int versionNumber concode_field_sep int getVersionNumber concode_elem_sep boolean mightContainString concode_elem_sep BloomFilter readFrom concode_elem_sep boolean putString concode_elem_sep double expectedFpp concode_elem_sep boolean putLong concode_elem_sep BloomFilter mergeInPlace concode_elem_sep boolean put concode_elem_sep boolean isCompatible concode_elem_sep void writeTo concode_elem_sep boolean mightContainBinary concode_elem_sep long optimalNumOfBits concode_elem_sep long bitSize concode_elem_sep boolean putBinary concode_elem_sep boolean mightContainLong concode_elem_sep BloomFilter create concode_elem_sep BloomFilter create concode_elem_sep BloomFilter create concode_elem_sep boolean mightContain
int function ( long arg0 , long arg1 ) { return Math . max ( 1 , ( int ) Math . round ( ( double ) arg1 / arg0 * Math . log ( 2 ) ) ) ; }