pub fn contains(&self, hash: u64) -> bool {
        let h = hash >> self.shift;
        let l = (hash << self.shift) >> self.shift;
        for i in 0..self.set_locs {
            if !self.is_set(((h + i * l) & self.size) as usize) {
                return false;
            }
        }
        true
    }
/// `contains` checks if bit(s) for entry hash is/are set,
/// returns true if the hash was added to the Bloom Filter.
`contains` checks if bit(s) for entry hash is/are set,
returns true if the hash was added to the Bloom Filter.
` contains ` checks if bit ( s ) for entry hash is / are set returns true if the hash was added to the Bloom Filter .
pub fn contains(&self, hash: u64) -> bool {
        let h = hash >> self.shift;
        let l = (hash << self.shift) >> self.shift;
        for i in 0..self.set_locs {
            if !self.is_set(((h + i * l) & self.size) as usize) {
                return false;
            }
        }
        true
    }
pub fn contains ( & self , hash : u64 ) -> bool { let h = hash >> self . shift ; let l = ( hash << self . shift ) >> self . shift ; for i in 0 .. self . set_locs { if ! self . is_set ( ( ( h + i * l ) & self . size ) as usize ) { return false ; } } true }
`contains` checks if bit(s) for entry hash is/are set,
returns true if the hash was added to the Bloom Filter.
` contains ` checks if bit ( s ) for entry hash is / are set returns true if the hash was added to the Bloom Filter .
&self
hash
u64
&self
hash
u64