Bloom Filter Packages

Straightforward fuzzy matching, information retrieval and NLP building blocks for JavaScript.

Fast bloom filter in JavaScript.

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

Bloom Filter using the FNV hash function

A bloom filter with pluggable hashing designed for serialization.

Fast bloom filter in JavaScript.

Probabilistic data structures for large or streaming data sets.

Bloom filter is a space efficient probablistic data-structure. This implementation relies on following non-cryptographic hash functions. - Fowler–Noll–Vo hash function. - Jenkins hash function.

Bloom Filter implementation at the tip of your require.

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

bloom filter testing of tagged words

Fast, efficient and easy to use Bloom filter.

This is a fork of bloomfilter.js to address a couple issues.

Yet another Bloom filter implementation, this one with xxhashjs

bloom filter

Computing and querying HTTP/2 Cache Digest data structures

Yet another Bloom filter implementation, this one with farmhash

Simple and dependency-free Bloom filter implementation

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

JS implementation of Bloom Filter using FastBitSet.js