Bloom filter implementation. Mirror.
JavaScript
0
0
MIT License
This project provides a Bloom filter implementation, a probabilistic data structure used to test whether an element is a member of a set. It is designed for developers who need an efficient way to check for set membership with a small memory footprint, accepting a trade-off of potential false positives.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of intrnl/bloom-filter
Generates bundled Typescript declaration files from ESM source w/ JSDoc.
Next-generation ES module bundler
A list of TLDs.
Top contributors
intrnl
7 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet