dawg.bloom

Contains a bloom filter implementation

Members

Structs

BloomFilter
struct BloomFilter(size_t BitsPerEntry = 4)

Basic bloom filter. This is a very fast data structure to test set membership of a key. It might give false positive results but never false negative.

Meta

License

<a href="http://www.boost.org/LICENSE_1_0.txt">Boost License 1.0</a>.

Authors

Martin Nowak