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

Achim Schneider barsoap at web.de
Fri May 30 18:51:27 EDT 2008

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.

(c) this sig last receiving data processing entity. Inspect headers for
past copyright information. All rights reserved. Unauthorised copying,
hiring, renting, public performance and/or broadcasting of this
signature prohibited. 

More information about the Haskell-Cafe mailing list