search

Callidon / bloom-filters

JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
https://callidon.github.io/bloom-filters/
MIT License
369 stars 42 forks source link

Counting bloom filter #7

Closed simegger closed 5 years ago

simegger commented 5 years ago

Hello,

is there any chance that you could implement a counting bloom filter? Would be great!

Thanks in advance!

Callidon commented 5 years ago

Hello

Yes, we could definitively implement a counting bloom filter. I could be a great addition to this library. I will put this on our todo list, so we should have implemented it under a few weeks.

I will keep you updated!

Callidon commented 5 years ago

Hello again

Counting Bloom Filters have been implemented and released in v0.7.1 🎉 The documentation is up to date and the README has been updated. Feel free to report any bug/implementation mistakes if you find some!

Have fun :octocat: