fastset 0.5.1

Fast set implementation for dense, bounded integer collections, optimized for quick updates and access.
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

use criterion::{black_box, criterion_group, criterion_main, Criterion};
use fastset::Set;
use hashbrown::HashSet as HashBrownSet;
use nanorand::{Rng, WyRand};
use std::collections::HashSet;

fn bench_set(c: &mut Criterion) {
    let mut group = c.benchmark_group("fastset");
    let mut set = Set::with_capacity(100_000);
    let mut hashset: HashSet<usize> = HashSet::with_capacity(100_000);
    let mut hashbrownset: HashBrownSet<usize> = HashBrownSet::with_capacity(100_000);
    let mut rng = WyRand::new();
    let data: Vec<usize> = (0..1000)
        .map(|_| rng.generate_range(0usize..=10000))
        .collect();

    group.bench_function("insert (Set)", |b| {
        b.iter(|| {
            set.insert(black_box(data[rng.generate_range(0usize..1000)]));
        })
    });

    group.bench_function("insert (HashSet)", |b| {
        b.iter(|| {
            hashset.insert(black_box(data[rng.generate_range(0usize..1000)]));
        })
    });

    group.bench_function("insert (hashbrown HashSet)", |b| {
        b.iter(|| {
            hashbrownset.insert(black_box(data[rng.generate_range(0usize..1000)]));
        })
    });

    set.clear();
    data.iter().for_each(|&x| {
        set.insert(x);
    });
    group.bench_function("remove (Set)", |b| {
        b.iter(|| {
            set.remove(black_box(&data[rng.generate_range(0usize..1000)]));
        })
    });

    hashset.clear();
    data.iter().for_each(|&x| {
        hashset.insert(x);
    });
    group.bench_function("remove (HashSet)", |b| {
        b.iter(|| {
            hashset.remove(black_box(&data[rng.generate_range(0usize..1000)]));
        })
    });

    hashbrownset.clear();
    data.iter().for_each(|&x| {
        hashset.insert(x);
    });
    group.bench_function("remove (hashbrown HashSet)", |b| {
        b.iter(|| {
            hashbrownset.remove(black_box(&data[rng.generate_range(0usize..1000)]));
        })
    });

    set.clear();
    data.iter().for_each(|&x| {
        set.insert(x);
    });
    group.bench_function("contains (Set)", |b| {
        b.iter(|| {
            set.contains(black_box(&data[rng.generate_range(0usize..1000)]));
        })
    });

    hashset.clear();
    data.iter().for_each(|&x| {
        hashset.insert(x);
    });
    group.bench_function("contains (HashSet)", |b| {
        b.iter(|| {
            hashset.contains(black_box(&data[rng.generate_range(0usize..1000)]));
        })
    });

    hashbrownset.clear();
    data.iter().for_each(|&x| {
        hashset.insert(x);
    });
    group.bench_function("contains (hashbrown HashSet)", |b| {
        b.iter(|| {
            hashbrownset.contains(black_box(&data[rng.generate_range(0usize..1000)]));
        })
    });

    set.clear();
    data.iter().for_each(|&x| {
        set.insert(x);
    });
    group.bench_function("random (Set)", |b| {
        b.iter(|| {
            set.random(&mut rng);
        })
    });

    group.finish();
}

criterion_group!(benches, bench_set);
criterion_main!(benches);