We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
For example,
new FilterBuilder(1000000, 1e-5)
when it full (added 1000000 elements)
how much memory it cost. is there any calculation method?
The text was updated successfully, but these errors were encountered:
N (added elements , 1000000 eg.) f (falseProbability, 1e-5 eg.) M (total bit): M = - N * ln(f) / ln2^2. K(hash functions): K = max(1, ln2* M/N)
Sorry, something went wrong.
No branches or pull requests
For example,
when it full (added 1000000 elements)
how much memory it cost. is there any calculation method?
The text was updated successfully, but these errors were encountered: