Asino is a small, fast‑implementation of a Bloom filter for Node.js, providing a simple API to add items, test for membership and reset the filter while exposing parameters such as expected population, hash count and false‑positive rate. It’s aimed at JavaScript developers who need a lightweight probabilistic set data structure for deduplication or membership testing in server‑side or tooling code.
Total donated
Undistributed
Share with your subscribers:
Recipients
How the donated funds are distributed
Support the dependencies of rootslab/asino
Bolgia an helper module for the config hell. It recursively clones mixes updates and improves configuration objects/hashes with nested properties. '..non ragioniam di lor ma guarda e passa..'
Hazz, a pseudo-random-data-filled-table to generate k indipendent and uniform, very fast (non-cryptographic) hash functions.
Mazz, the fast way of the tonto, to simulate 16 indipendent hash functions, using a crypto digest.
Toni, a simple and efficient bitmap implementation for positive integer sets (max 32 bits), with no element repetition, using bitwise operations and a Buffer. Modifying a single bit instead of an enti
Dado, a simple and dirty test runner.
Bop, an ultra fast Boyer-Moore parser/matcher, optimized for string and buffer patterns (<= 255 bytes).
Support the repos that depend on this repository
Top contributors
rootslab
23 contributions
Recent events
Kivach works on the Obyte network, and therefore you can track all donations.
No events yet