pub fn is_in_set(bitset: &[u8], hash: u64) -> bool {
    let block_index = hash_to_block_index(hash, bitset.len());
    let key = hash as u32;

    let mask = new_mask(key);
    let slice = &bitset[block_index * 32..(block_index + 1) * 32];
    let block_mask = load_block(slice);

    for i in 0..8 {
        if mask[i] & block_mask[i] == 0 {
            return false;
        }
    }
    true
}
/// Returns whether the `hash` is in the set
Returns whether the `hash` is in the set
Returns whether the ` hash ` is in the set
pub fn is_in_set(bitset: &[u8], hash: u64) -> bool {
    let block_index = hash_to_block_index(hash, bitset.len());
    let key = hash as u32;
    let mask = new_mask(key);
    let slice = &bitset[block_index * 32..(block_index + 1) * 32];
    let block_mask = load_block(slice);
    for i in 0..8 {
        if mask[i] & block_mask[i] == 0 {
            return false;
        }
    }
    true
}
pub fn is_in_set ( bitset : & [ u8 ] , hash : u64 ) -> bool { let block_index = hash_to_block_index ( hash , bitset . len ( ) ) ; let key = hash as u32 ; let mask = new_mask ( key ) ; let slice = & bitset [ block_index * 32 .. ( block_index + 1 ) * 32 ] ; let block_mask = load_block ( slice ) ; for i in 0 .. 8 { if mask [ i ] & block_mask [ i ] == 0 { return false ; } } true }
Returns whether the `hash` is in the set
Returns whether the ` hash ` is in the set
bitset
&[u8]
hash
u64