double function ( long arg0 , int arg1 ) { int loc0 = optimalNumOfHashFunctions ( arg0 , arg1 ) ; double loc1 = Math . pow ( Math . E , - ( double ) loc0 * arg0 / arg1 ) ; double loc2 = Math . pow ( 1 - loc1 , loc0 ) ; return loc2 ; }
compute the false positive probability based on given input entries and bits size . note : this is just the math expected value , you should not expect the fpp in real case would under the return value for certain . 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 int optimalNumOfHashFunctions concode_elem_sep void addHash 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