radixt 0.1.0

A fast, memory-efficient radix tree implementation in Rust
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

use criterion::{black_box, criterion_group, criterion_main, Criterion};
use rand::Rng;

use radixt::RadixMap;

const SIZES: &[usize] = &[10000, 100000, 1000000];
const KEY_LENS: &[usize] = &[8, 32, 128];

fn generate_kv<R: Rng>(size: usize, rng: &mut R) -> Vec<(Vec<u8>, u64)> {
    let max_key_len = *KEY_LENS.iter().max().unwrap();
    (0..size)
        .map(|_| {
            let key = (0..max_key_len).map(|_| rng.gen::<u8>()).collect();
            let value = rng.gen::<u64>();
            (key, value)
        })
        .collect()
}

fn bench_insert(c: &mut Criterion) {
    let mut rng = rand::thread_rng();

    for &size in SIZES {
        let kv = generate_kv(size, &mut rng);

        for &key_len in KEY_LENS {
            let mut map = RadixMap::new();

            let mut kv_it = kv.iter().cycle();
            c.bench_function(&format!("insert_n={},key_len={}", size, key_len), |bench| {
                bench.iter(|| {
                    let (key, value) = kv_it.next().unwrap();
                    map.insert(&key[..key_len], *value);
                })
            });
        }
    }
}

fn bench_get(c: &mut Criterion) {
    let mut rng = rand::thread_rng();
    for &size in SIZES {
        let kv = generate_kv(size, &mut rng);

        for &key_len in KEY_LENS {
            let mut map = RadixMap::new();
            for (k, v) in kv.iter() {
                map.insert(&k[..key_len], *v);
            }

            c.bench_function(&format!("get_n={},key_len={}", size, key_len), |bench| {
                bench.iter(|| {
                    let (key, _) = &kv[rng.gen::<usize>() % kv.len()];
                    black_box(map.get(&key[..key_len]))
                })
            });
        }
    }
}

fn bench_remove(c: &mut Criterion) {
    let mut rng = rand::thread_rng();
    for &size in SIZES {
        let kv = generate_kv(size, &mut rng);

        for &key_len in KEY_LENS {
            let mut map = RadixMap::new();
            for (k, v) in kv.iter() {
                map.insert(&k[..key_len], *v);
            }

            c.bench_function(&format!("remove_n={},key_len={}", size, key_len), |bench| {
                bench.iter(|| {
                    let (key, _) = &kv[rng.gen::<usize>() % kv.len()];
                    black_box(map.remove(&key[..key_len]))
                })
            });
        }
    }
}

criterion_group!(
    name = benches;
    config = Criterion::default().significance_level(0.01).sample_size(1000);
    targets = bench_get, bench_insert, bench_remove
);
criterion_main!(benches);