chickadee
»
bloom-filter
»
optimum-m
Identifier search
optimum-m
K
N
procedure
Optimal count of bits of discrimination for the given population size
N
and
K
number of hashes.