pub fn contains<H: Hash + ?Sized>(&self, key: &H) -> bool {
        let hasher = self.build_hasher(key);

        for hash in hasher.take(self.k) {
            let i = (hash as usize) % self.m;

            if !self.bits[i] {
                return false;
            }
        }

        true
    }
/// Tests whether an element may be in the filter or definitely not in the filter.
///
/// Remember that false positives can occur, meaning that if this returns `true`, there is only
/// a possibility that the element is in the filter. If this returns `false`, the element is
/// definitely not in the filter.
///
/// # Examples
///
/// ```
/// use bbloom::BloomFilter;
///
/// let mut filter = BloomFilter::from_fpp(0.0001, 64);
/// filter.insert("a");
/// filter.insert("b");
///
/// assert!(filter.contains("a"));
/// assert!(filter.contains("b"));
/// assert!(!filter.contains("c"));
/// ```
Tests whether an element may be in the filter or definitely not in the filter.
Remember that false positives can occur, meaning that if this returns `true`, there is only
a possibility that the element is in the filter. If this returns `false`, the element is
definitely not in the filter.
Tests whether an element may be in the filter or definitely not in the filter . Remember that false positives can occur meaning that if this returns ` true ` there is only a possibility that the element is in the filter . If this returns ` false ` the element is definitely not in the filter .
pub fn contains<H: Hash + ?Sized>(&self, key: &H) -> bool {
        let hasher = self.build_hasher(key);
        for hash in hasher.take(self.k) {
            let i = (hash as usize) % self.m;
            if !self.bits[i] {
                return false;
            }
        }
        true
    }
pub fn contains < H : Hash + ? Sized > ( & self , key : & H ) -> bool { let hasher = self . build_hasher ( key ) ; for hash in hasher . take ( self . k ) { let i = ( hash as usize ) % self . m ; if ! self . bits [ i ] { return false ; } } true }
Tests whether an element may be in the filter or definitely not in the filter.
Tests whether an element may be in the filter or definitely not in the filter .
&self
key
&H
&self
key
&H
examples
```
use bbloom::BloomFilter.

let mut filter = BloomFilter::from_fpp(0.0001, 64);
filter.insert("a");
filter.insert("b").

assert!(filter.contains("a"));
assert!(filter.contains("b"));
assert!(!filter.contains("c"));
```
` ` ` use bbloom :: BloomFilter . let mut filter = BloomFilter :: from_fpp ( 0 . 0001 64 ) ; filter . insert ( " a " ) ; filter . insert ( " b " ) . assert! ( filter . contains ( " a " )) ; assert! ( filter . contains ( " b " )) ; assert! ( !filter . contains ( " c " )) ; ` ` `