Module bloom

A bloom filter implementation

Structs

NameDescription
BloomFilterA 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.

Aliases

NameTypeDescription
CheapHashstd.typecons.Flag!("cheapHash")Flag to specify whether or not a cheaper hash is used.