Module bloom
A bloom filter implementation
Structs
Name | Description |
---|---|
BloomFilter
|
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. |
Aliases
Name | Type | Description |
---|---|---|
CheapHash
|
std
|
Flag to specify whether or not a cheaper hash is used. |