range-tree-rs 0.2.0

A range tree implement for slab allocator
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

use criterion::{Criterion, Throughput, black_box, criterion_group, criterion_main};
use range_tree_rs::RangeTree;

fn bench_range_tree_insert_fragmented(c: &mut Criterion) {
    let count = 10000;
    let fragment_size = 4096;
    let gap_size = 4096;

    let ranges: Vec<(u64, u64)> =
        (0..count).map(|i| (i as u64 * (fragment_size + gap_size), fragment_size)).collect();

    let mut group = c.benchmark_group("range_tree_fragmented");
    group.throughput(Throughput::Elements(count as u64));
    group.bench_function("insert_10000_fragments", |b| {
        b.iter(|| {
            let mut tree = RangeTree::<u64>::new();
            for &(start, size) in &ranges {
                tree.add(black_box(start), black_box(size)).expect("add");
            }
        })
    });
    group.finish();
}

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