pub fn insert<H: Hash + ?Sized>(&mut self, key: &H) -> bool {
        if self.n >= self.total_capacity {
            self.grow();
        }

        let i = self.filters.len() - 1;
        let filter = &mut self.filters[i];
        let inserted = filter.insert(key);

        if inserted {
            self.n += 1;
        }

        inserted
    }
/// Adds a value to the bloom filter.
///
/// Returns whether the value is already (maybe) in the _last_ filter or not. Duplicate values
/// may be present in the scalable Bloom filter but not in the last filter. When a duplicate
/// value is in the last filter, it does not affect the load factor.
///
/// # Examples
///
/// ```
/// use bbloom::ScalableBloomFilter;
///
/// let mut filter = ScalableBloomFilter::new(0.0001, 64);
/// assert!(filter.insert("a"));
/// assert!(filter.insert("b"));
/// assert!(!filter.insert("b"));
/// ```
Adds a value to the bloom filter.
Returns whether the value is already (maybe) in the _last_ filter or not. Duplicate values
may be present in the scalable Bloom filter but not in the last filter. When a duplicate
value is in the last filter, it does not affect the load factor.
Adds a value to the bloom filter . Returns whether the value is already ( maybe ) in the _last_ filter or not . Duplicate values may be present in the scalable Bloom filter but not in the last filter . When a duplicate value is in the last filter it does not affect the load factor .
pub fn insert<H: Hash + ?Sized>(&mut self, key: &H) -> bool {
        if self.n >= self.total_capacity {
            self.grow();
        }
        let i = self.filters.len() - 1;
        let filter = &mut self.filters[i];
        let inserted = filter.insert(key);
        if inserted {
            self.n += 1;
        }
        inserted
    }
pub fn insert < H : Hash + ? Sized > ( & mut self , key : & H ) -> bool { if self . n >= self . total_capacity { self . grow ( ) ; } let i = self . filters . len ( ) - 1 ; let filter = & mut self . filters [ i ] ; let inserted = filter . insert ( key ) ; if inserted { self . n += 1 ; } inserted }
Adds a value to the bloom filter.
Adds a value to the bloom filter .
&mut self
key
&H
&mut self
key
&H
examples
```
use bbloom::ScalableBloomFilter.

let mut filter = ScalableBloomFilter::new(0.0001, 64);
assert!(filter.insert("a"));
assert!(filter.insert("b"));
assert!(!filter.insert("b"));
```
` ` ` use bbloom :: ScalableBloomFilter . let mut filter = ScalableBloomFilter :: new ( 0 . 0001 64 ) ; assert! ( filter . insert ( " a " )) ; assert! ( filter . insert ( " b " )) ; assert! ( !filter . insert ( " b " )) ; ` ` `