Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

bf
bitvector	A vector of bits
reference	An lvalue proxy for single bits
basic_bloom_filter	The basic Bloom filter
bitwise_bloom_filter	The bitwise Bloom filter
counting_bloom_filter	The counting Bloom filter
spectral_mi_bloom_filter	A spectral Bloom filter with minimum increase (MI) policy
spectral_rm_bloom_filter	A spectral Bloom filter with recurring minimum (RM) policy
stable_bloom_filter	A stable Bloom filter
bloom_filter	The abstract Bloom filter interface
counter_vector	The fixed width storage policy implements a bit vector where each cell represents a counter having a fixed number of bits
h3	An implementation of the H3 hash function family
default_hash_function
default_hasher	A hasher which hashes an object k times
double_hasher	A hasher which hashes an object two times and generates k digests through a linear combinations of the two digests
object	Wraps sequential data to be used in hashing