Cuckoo Filter: Better Than Bloom

Cuckoo Filter: Practically Better Than Bloom

This package provides support for the [RedisBloom](https://redis.io/docs/data-types/probabilistic/) module, which adds additional probabilistic data structures to Redis.

An advanced Cuckoo Filter with auto-persistence, Parquet & JSON support, and dynamic resizing.

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

A Cuckoo filter that stores the top 1,000,000 most compromised passwords from https://haveibeenpwned.com/Passwords.

This package provides support for the [ValkeyBloom](https://valkeybloom.io) module, which adds additional probabilistic data structures to Valkey. It extends the [Node Valkey client](https://github.com/firassziedan/node-valkey) to include functions for e

A Cuckoo filter that stores the top 1,000,000 most compromised passwords from https://haveibeenpwned.com/Passwords.

Filter object keys and values into a new object

Filter out reverted commits parsed by conventional-commits-parser.

Plugin utilities for Rolldown

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash

Yellowstone gRPC Geyser Node.js Client

Filter an array of objects to a specific OS

unist utility to create a new tree with nodes that pass a filter

Provides functionality related to source maps.

Filter promises concurrently

A through2 to create an Array.prototype.filter analog for streams.

Zero-dependency, zero-GC approximate-membership filter family under one LiteFilter<K> surface. Seven members: Bloom (reference), CountingBloom (deletable), BlockedBloom (cache-local), Cuckoo (fingerprint), Quotient (mergeable/resizable), XorFilter (static

broccoli filter but with a persistent cache