probabilistic-collections 0.7.0

Various implementations of collections that use approximations to improve on running time or memory, but introduce a certain amount of error.
Documentation 
1
2
3
4
5
6
7
8
9
10
11

//! Space-efficient probabilistic data structure for approximate membership queries in a set.

mod bloom_filter;
mod dd_bloom_filter;
mod partitioned_bloom_filter;
mod scalable_bloom_filter;

pub use self::bloom_filter::BloomFilter;
pub use self::dd_bloom_filter::{BSBloomFilter, BSSDBloomFilter, RLBSBloomFilter};
pub use self::partitioned_bloom_filter::PartitionedBloomFilter;
pub use self::scalable_bloom_filter::ScalableBloomFilter;