Description
A Haskell library with pure and mutable Bloom filter implementations. Bloom filters can quickly test whether an item is probably present in a set while using much less memory than storing every item directly.
Developers use it for caches, deduplication, indexing, and probabilistic membership checks. False positives are expected, so applications must not treat a positive match as absolute proof.