Struct Bloom

pub struct Bloom { /* private fields */ }

Implementations

impl Bloom

pub fn new(num_entries: f64, wrongs: f64) -> Self

returns a new bloom filter.

pub fn add(&mut self, hash: u64)

<— http://www.cse.yorku.ca/~oz/hash.html modified Berkeley DB Hash (32bit) hash is casted to l, h = 16bit fragments func (bl Bloom) absdbm(b *[]byte) (l, h uint64) { hash := uint64(len(*b)) for _, c := range *b { hash = uint64(c) + (hash << 6) + (hash << bl.sizeExp) - hash } h = hash >> bl.shift l = hash << bl.shift >> bl.shift return l, h }

pub fn add_if_not_has(&mut self, hash: u64) -> bool

AddIfNotHas only Adds hash, if it’s not present in the bloomfilter. Returns true if hash was added. Returns false if hash was already registered in the bloomfilter.

pub fn clear(&mut self)

Clear resets the Bloom filter.

pub fn set(&mut self, idx: u64)

Set sets the bit[idx] of bitset.

pub fn size(&mut self, sz: u64)

Size makes Bloom filter with as bitset of size sz.

pub fn has(&mut self, hash: u64) -> bool

Has checks if bit(s) for entry hash is/are set, returns true if the hash was added to the Bloom Filter.

pub fn isset(&mut self, idx: u64) -> bool

IsSet checks if bit[idx] of bitset is set, returns true/false.