@hackage bloomfilter1.2.6.6

Pure and impure Bloom Filter implementations.

Categories
License
BSD-3-Clause
Maintainer
Bryan O'Sullivan <bos@serpentine.com>
Links
Versions
- 2.0.1.3 Tue, 18 Nov 2025
- 2.0.1.2 Fri, 4 Aug 2023
- 2.0.1.1 Fri, 4 Aug 2023
- 2.0.1.0 Mon, 2 May 2022
- 2.0.0.0 Sat, 16 May 2015
- 1.2.6.10 Sat, 16 May 2015

Installation
In your cabal file:
Dependencies (4)
- array
- base >=4
- bytestring >=0.9 && <0.10
- deepseq >=1.1
Dependents (6)
@hackage/git-annex, @hackage/acme-everything, @hackage/subhask, @hackage/dfinity-radix-tree, @hackage/keysafe, @hackage/sloane

A fast, space efficient Bloom filter implementation

Copyright 2008 Bryan O'Sullivan bos@serpentine.com.

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:

runhaskell Setup.lhs configure
runhaskell Setup.lhs build
runhaskell Setup.lhs install

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

To get the latest sources:

darcs get http://darcs.serpentine.com/bloomfilter