A bloom filter implementation
Flag to specify whether or not a cheaper hash is used.
A bloom filter is a fast and space-efficient probabilistic data structure to test whether an element is member of a set. False positive matches are possible, false negative matches are not. Elements can only be added not removed.
See Source File
Boost License 1.0
© 2013 - $(YEAR) Martin Nowak
Martin Nowak
A bloom filter implementation