computes m total bits of bloom filter which is expected to achieve , for the specified expected insertions , the required false positive probability . see http://en.wikipedia.org/wiki/bloom_filter#probability_of_false_positives 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 int optimalNumOfHashFunctions 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 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
long function ( long arg0 , double arg1 ) { return ( long ) ( - arg0 * Math . log ( arg1 ) / ( Math . log ( 2 ) * Math . log ( 2 ) ) ) ; }