Struct fastbloom::Builder

Sets the seed for this builder. The later constructed BloomFilter will use this seed when hashing items.

§Examples

use fastbloom::BloomFilter;

let bloom = BloomFilter::builder(1024).seed(&1).hashes(4);

Sets the hasher for this builder. The later constructed BloomFilter will use this hasher when inserting and checking items.

§Examples

use fastbloom::BloomFilter;
use ahash::RandomState;

let bloom = BloomFilter::builder(1024).hasher(RandomState::default()).hashes(4);

“Consumes” this builder, using the provided num_hashes to return an empty BloomFilter.

§Examples

use fastbloom::BloomFilter;

let bloom = BloomFilter::builder(1024).hashes(4);

“Consumes” this builder, using the provided expected_num_items to return an empty BloomFilter. The number of hashes is optimized based on expected_num_items to maximize bloom filter accuracy (minimize false positives chance on BloomFilter::contains). More or less than expected_num_items may be inserted into BloomFilter.

§Examples

use fastbloom::BloomFilter;

let bloom = BloomFilter::builder(1024).expected_items(500);

“Consumes” this builder and constructs a BloomFilter containing all values in items. Like Builder::expected_items, the number of hashes per item is optimized based on items.len() to maximize bloom filter accuracy (minimize false positives chance on BloomFilter::contains).

§Examples

use fastbloom::BloomFilter;

let bloom = BloomFilter::builder(1024).items([1, 2, 3]);

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.