pub fn check(&self, item: &T) -> bool
        where
        T: Hash,
        {
            let mut hashes = [0u64, 0u64];
            for k_i in 0..self.k_num {
                let bit_offset = (self.bloom_hash(&mut hashes, &item, k_i) % self.bitmap_bits) as usize;
                if self.bitmap.get(bit_offset).unwrap() == false {
                    return false;
                }
            }
            true
        }
/// Check if an item is present in the set.
/// There can be false positives, but no false negatives.
Check if an item is present in the set.
There can be false positives, but no false negatives.
Check if an item is present in the set . There can be false positives but no false negatives .
pub fn check(&self, item: &T) -> bool
        where
        T: Hash,
        {
            let mut hashes = [0u64, 0u64];
            for k_i in 0..self.k_num {
                let bit_offset = (self.bloom_hash(&mut hashes, &item, k_i) % self.bitmap_bits) as usize;
                if self.bitmap.get(bit_offset).unwrap() == false {
                    return false;
                }
            }
            true
        }
pub fn check ( & self , item : & T ) -> bool where T : Hash , { let mut hashes = [ 0u64 , 0u64 ] ; for k_i in 0 .. self . k_num { let bit_offset = ( self . bloom_hash ( & mut hashes , & item , k_i ) % self . bitmap_bits ) as usize ; if self . bitmap . get ( bit_offset ) . unwrap ( ) == false { return false ; } } true }
Check if an item is present in the set.
Check if an item is present in the set .
&self
item
&T
&self
item
&T