quickbloom 0.2.0

An industry-grade, highly scalable Bloom filter with lock-free concurrency, blocked layout, and automatic persistence.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116

use quickbloom::{AtomicBloomFilter, BloomFilter, BloomMode, BloomConfig, ScalableBloomFilter};
use std::path::Path;
use std::sync::Arc;

#[test]
fn test_standard_insert_contains() {
    let mut filter = BloomFilter::new(5000, 5);
    filter.insert(&"hello");
    assert!(filter.contains(&"hello"));
    assert!(!filter.contains(&"world"));
}

#[test]
fn test_blocked_insert_contains() {
    let mut filter = BloomFilter::with_mode(5000, 5, BloomMode::Blocked);
    filter.insert(&"blocked_item");
    assert!(filter.contains(&"blocked_item"));
    assert!(!filter.contains(&"missing_item"));
}

#[test]
fn test_atomic_insert_contains() {
    let filter = AtomicBloomFilter::new(10_000, 7);
    filter.insert(&"atomic_item");
    assert!(filter.contains(&"atomic_item"));
    assert!(!filter.contains(&"not_here"));
}

#[test]
fn test_atomic_concurrent_insert() {
    let filter = Arc::new(AtomicBloomFilter::new(100_000, 7));
    let handles: Vec<_> = (0..8)
        .map(|i| {
            let f = Arc::clone(&filter);
            std::thread::spawn(move || {
                f.insert(&format!("item_{}", i));
            })
        })
        .collect();
    for h in handles {
        h.join().unwrap();
    }
    for i in 0..8 {
        assert!(filter.contains(&format!("item_{}", i)));
    }
}

#[test]
fn test_standard_persistence() {
    let path = Path::new("it_standard_persist.bin");
    if path.exists() {
        std::fs::remove_file(path).unwrap();
    }

    {
        let mut filter = BloomFilter::new(5000, 5).with_persistence(path);
        filter.insert(&"persist_me");
        filter.save().unwrap();
    }

    {
        let filter = BloomFilter::load_or_new(path, 5000, 5);
        assert!(filter.contains(&"persist_me"));
        assert!(!filter.contains(&"other"));
    }

    let _ = std::fs::remove_file(path);
}

#[test]
fn test_blocked_persistence() {
    let path = Path::new("it_blocked_persist.bin");
    if path.exists() {
        std::fs::remove_file(path).unwrap();
    }

    {
        let mut filter = BloomFilter::with_mode(5000, 5, BloomMode::Blocked)
            .with_persistence(path);
        filter.insert(&"blocked_persist");
        filter.save().unwrap();
    }

    {
        let filter = BloomFilter::load_or_new(path, 5000, 5);
        assert!(filter.contains(&"blocked_persist"));
    }

    let _ = std::fs::remove_file(path);
}

#[test]
fn test_scalable_persistence() {
    let path = Path::new("it_scalable_persist.bin");
    if path.exists() {
        std::fs::remove_file(path).unwrap();
    }

    {
        let config = BloomConfig::new(500, 0.01);
        let mut filter = ScalableBloomFilter::new(config).with_persistence(path);
        for i in 0..600u64 {
            filter.insert(&i);
        }
        filter.save().unwrap();
    }

    {
        let config = BloomConfig::new(500, 0.01);
        let filter = ScalableBloomFilter::load_or_new(path, config);
        assert!(filter.contains(&0u64));
        assert!(filter.contains(&599u64));
    }

    let _ = std::fs::remove_file(path);
}