long function ( long arg0 , double arg1 , int arg2 ) { return ( long ) ( - arg0 * 1.0 / arg2 * Math . log ( 1 - Math . exp ( Math . log ( arg1 ) / arg2 ) ) ) ; }
the maximum number of keys we can put into a bloom filter of a certain size to get the given error rate , with the given number of hash functions . concode_field_sep Random randomGeneratorForTest concode_elem_sep String STATS_RECORD_SEP concode_elem_sep double LOG2_SQUARED concode_elem_sep byte[] bitvals concode_field_sep int computeFoldableByteSize concode_elem_sep int optimalFunctionCount concode_elem_sep boolean contains concode_elem_sep BloomFilterChunk createBySize concode_elem_sep long computeBitSize concode_elem_sep double actualErrorRate concode_elem_sep String toString concode_elem_sep void setFakeLookupMode concode_elem_sep long idealMaxKeys concode_elem_sep boolean checkBit concode_elem_sep String formatStats