[Haskell-cafe] Re: [ANN] bloomfilter 1.0 - Fast immutable and
mutable Bloom filters
wnoise at ofb.net
Sat May 31 13:45:20 EDT 2008
On 2008-05-30, Achim Schneider <barsoap at web.de> wrote:
> Bryan O'Sullivan <bos at serpentine.com> 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.
More information about the Haskell-Cafe