[Haskell-cafe] Re: [ANN] bloomfilter 1.0 - Fast immutable and mutable Bloom filters

On 2008-05-30, Achim Schneider wrote:

Bryan O'Sullivan wrote:

...

A Bloom filter is a probabilistic data structure that provides a fast set membership querying capability. It does not give false negatives, but has a tunable false positive rate. (A false positive arises when the filter claims that an element is present, but in fact it is not.)

/me squints.

Please tell me that this isn't reversible.

Tell me what you mean by "reversible". You can't, for instance, extract the items in the set. -- Aaron Denney -><-