Space-efficient probabilistic data structure. More...
#include <userver/utils/filter_bloom.hpp>
Space-efficient probabilistic data structure.
Used to test whether a count number of a given element is smaller than a given threshold when a sequence of elements is given. As a generalized form of Bloom filter, false positive matches are possible, but false negatives are not.
Example:
Definition at line 38 of file filter_bloom.hpp.
256
Hash1{}
Hash2{}
Constructs filter Bloom with the specified number of counters.
Definition at line 43 of file filter_bloom.hpp.
Resets all counters.
Definition at line 141 of file filter_bloom.hpp.
Returns the value of the smallest item counter.
Definition at line 129 of file filter_bloom.hpp.
Checks that all counters of the item have been incremented.
Definition at line 136 of file filter_bloom.hpp.
Increments the smallest item counters.
Definition at line 113 of file filter_bloom.hpp.