| approximate_count() const noexcept | neforce::bloom_filter< T, Hash > | inline |
| bit_size() const noexcept | neforce::bloom_filter< T, Hash > | inline |
| bloom_filter(const size_t expected_insertions, const double false_positive_prob) | neforce::bloom_filter< T, Hash > | inline |
| bloom_filter(const size_t m, const size_t k) | neforce::bloom_filter< T, Hash > | inline |
| capacity() const noexcept | neforce::bloom_filter< T, Hash > | inline |
| clear() noexcept | neforce::bloom_filter< T, Hash > | inline |
| contains(const T &key) const noexcept | neforce::bloom_filter< T, Hash > | inline |
| empty() const noexcept | neforce::bloom_filter< T, Hash > | inline |
| false_positive_rate() const noexcept | neforce::bloom_filter< T, Hash > | inline |
| from_bytes(const byte_vector &bytes) | neforce::bloom_filter< T, Hash > | inline |
| hash_count() const noexcept | neforce::bloom_filter< T, Hash > | inline |
| insert(const T &key) noexcept | neforce::bloom_filter< T, Hash > | inline |
| intersect(const bloom_filter &other) const | neforce::bloom_filter< T, Hash > | inline |
| merge(const bloom_filter &other) | neforce::bloom_filter< T, Hash > | inline |
| to_bytes() const | neforce::bloom_filter< T, Hash > | inline |
| unite(const bloom_filter &other) const | neforce::bloom_filter< T, Hash > | inline |
| ~bloom_filter()=default | neforce::bloom_filter< T, Hash > | |