Function ADS::bloomBestHashes

Function Documentation

inline int ADS::bloomBestHashes(double m, double n)

the number of hashes, floor or ceiling of ( m / n ) ln 2, of the least false positives; past the largest int (m / n above about 3 10^9) the floor is cut to the largest int less one

Pre:

m >= 1 and n >= 1