Struct fastbloom_rs::CountingBloomFilter

pub struct CountingBloomFilter { /* private fields */ }

A Counting Bloom filter works in a similar manner as a regular Bloom filter; however, it is able to keep track of insertions and deletions. In a counting Bloom filter, each entry in the Bloom filter is a small counter associated with a basic Bloom filter bit.

Reference: F. Bonomi, M. Mitzenmacher, R. Panigrahy, S. Singh, and G. Varghese, “An Improved Construction for Counting Bloom Filters,” in 14th Annual European Symposium on Algorithms, LNCS 4168, 2006

Implementations

impl CountingBloomFilter

pub fn get_u8_array(&self) -> &[u8]

impl CountingBloomFilter

pub fn get_u16_array(&self) -> &[u16]

impl CountingBloomFilter

pub fn get_u32_array(&self) -> &[u32]

impl CountingBloomFilter

pub fn get_u64_array(&self) -> &[u64]

impl CountingBloomFilter

pub fn new(config: FilterBuilder) -> Self

pub fn config(&self) -> FilterBuilder

Returns the configuration/builder of the Bloom filter.

Examples

use fastbloom_rs::{BloomFilter, FilterBuilder};

let bloom = FilterBuilder::new(100_000_000, 0.01).build_bloom_filter();
let builder = bloom.config();

impl CountingBloomFilter

pub fn from_u8_array(
    array: &[u8],
    hashes: u32,
    enable_repeat_insert: bool
) -> Self

impl CountingBloomFilter

pub fn from_u16_array(
    array: &[u16],
    hashes: u32,
    enable_repeat_insert: bool
) -> Self

impl CountingBloomFilter

pub fn from_u32_array(
    array: &[u32],
    hashes: u32,
    enable_repeat_insert: bool
) -> Self

impl CountingBloomFilter

pub fn from_u64_array(
    array: &[u64],
    hashes: u32,
    enable_repeat_insert: bool
) -> Self

Trait Implementations

impl Clone for CountingBloomFilter

fn clone(&self) -> CountingBloomFilter

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for CountingBloomFilter

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Deletable for CountingBloomFilter

fn remove(&mut self, element: &[u8])

remove element from this data structures.

impl Hashes for CountingBloomFilter

fn hashes(&self) -> u32

impl Membership for CountingBloomFilter

fn add(&mut self, element: &[u8])

fn contains(&self, element: &[u8]) -> bool

fn clear(&mut self)