Space-efficient probabilistic data structure.
Definition in file filter_bloom.hpp.
Go to the source code of this file.
#include <array>#include <functional>#include <optional>#include <type_traits>#include <utility>#include <boost/container_hash/hash.hpp>#include <userver/utils/assert.hpp>#include <userver/utils/fixed_array.hpp>
Include dependency graph for filter_bloom.hpp:Classes | |
| class | utils::FilterBloom< T, Counter, Hash1, Hash2 > |
| Space-efficient probabilistic data structure. More... | |
Namespaces | |
| namespace | utils |
| Utilities. | |