dawg.bloom

Members

Structs

BloomFilter

struct BloomFilter(size_t BitsPerEntry = 4, bool CheapHash = true)

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 ones. So if a key was inserted testing for the same key is guaranteed to be true, but testing might also be true even though a key was never inserted.

• bloom