JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Typescript port of https://github.com/yangl1996/riblt. Warning, this is a toy implementation & shouldn't be used in production.
JS implementation of Bloom Filter using FastBitSet.js