BSD-3-Clause licensed by Bryan O'Sullivan
Maintained by Joey Hess
This version can be pinned in stack with:bloomfilter-2.0.1.2@sha256:d0e89d4ab73f95a036921619904243b9118016f4e7e3ab9e81265358f99025f6,1965

A fast, space efficient Bloom filter implementation

Copyright 2008, 2009, 2010, 2011 Bryan O’Sullivan [email protected].

This package provides both mutable and immutable Bloom filter data types, along with a family of hash function and an easy-to-use interface.

To build:

cabal install bloomfilter

For examples of usage, see the Haddock documentation and the files in the examples directory.

Get involved!

Please report bugs via the github issue tracker.

Master git repository:

  • git clone git://github.com/haskell-pkg-janitors/bloomfilter.git

Authors

This library is written by Bryan O’Sullivan, [email protected].

Changes

2.0.1.2

  • Fix Data.BloomFilter.Easy on 32 bit to not incorrectly fail with “capacity too large to represent”.

2.0.1.1