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
12

//! Space-efficient probabilistic data structure for approximate membership queries in a set with
//! the ability to remove items.

mod cuckoo_filter;
mod scalable_cuckoo_filter;

const DEFAULT_ENTRIES_PER_INDEX: usize = 4;
const DEFAULT_FINGERPRINT_BIT_COUNT: usize = 8;
const DEFAULT_MAX_KICKS: usize = 512;

pub use self::cuckoo_filter::CuckooFilter;
pub use self::scalable_cuckoo_filter::ScalableCuckooFilter;