Faster and smaller than a hashmap.
Replying to @mhevery
A bloom filter is a probabilistic data structure that can answer if a key is NOT present. bloomFilter.test(KEY): - TRUE: we probably have the KEY => expensive op needed to be sure. - FALSE: 100% sure we don't have KEY => short-circuit expensive work.
5
8
Bloom filters , ever blooming !
1
4
Replying to @realhamed @mboehme_
Much like my waistline.

Feb 23, 2023 · 6:32 AM UTC

1