bloom

Members

Aliases

CheapHash

alias CheapHash = Flag!"cheapHash"

Flag to specify whether or not a cheaper hash is used.

Structs

BloomFilter

struct BloomFilter(size_t BitsPerEntry = 4, CheapHash cheapHash = CheapHash.yes)

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.

Templates

BloomFilter

deprecated template BloomFilter(size_t BitsPerEntry = 4, bool cheapHash = true)

Undocumented in source.

• bloom
• dawg