compute the optimal hash function number with given input entries and bits size , which would make the false positive probability lowest . concode_field_sep int expectedEntries concode_elem_sep int offset concode_elem_sep int LONG_POSITION_MASK concode_elem_sep int numHashFunctions concode_elem_sep int length concode_elem_sep BitSet bitSet concode_elem_sep MemorySegment memorySegment concode_field_sep MemorySegment getMemorySegment concode_elem_sep void setMemorySegment concode_elem_sep void set concode_elem_sep void setBitsLocation concode_elem_sep void clear concode_elem_sep void addHash concode_elem_sep double estimateFalsePositiveProbability concode_elem_sep int optimalNumOfBits concode_elem_sep boolean get concode_elem_sep int bitSize concode_elem_sep void reset concode_elem_sep String toString concode_elem_sep String toString concode_elem_sep boolean testHash
int function ( long arg0 , long arg1 ) { return Math . max ( 1 , ( int ) Math . round ( ( double ) arg1 / arg0 * Math . log ( 2 ) ) ) ; }