queue-file 2.0.0

queue-file is a lightning-fast, transactional, file-based FIFO
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

use auto_delete_path::AutoDeletePath;
use criterion::{Bencher, BenchmarkId, Criterion, Throughput, criterion_group, criterion_main};
use queue_file::QueueFile;

const BATCH_SIZE: usize = 1000;
const SIZES: &[usize] = &[64, 1024, 10240];

fn bench_write_macro(c: &mut Criterion) {
    let mut group = c.benchmark_group("write_macro");
    for &size in SIZES {
        let data = vec![0u8; size];
        group.throughput(Throughput::Elements(BATCH_SIZE as u64));
        group.bench_with_input(
            BenchmarkId::from_parameter(size),
            &size,
            |b: &mut Bencher, &_size| {
                b.iter_batched(
                    || {
                        let path = AutoDeletePath::temp();
                        let qf = QueueFile::open(path.as_ref()).unwrap();
                        (path, qf)
                    },
                    |(_path, mut qf): (AutoDeletePath, QueueFile)| {
                        for _ in 0..BATCH_SIZE {
                            qf.add(&data).unwrap();
                        }
                    },
                    criterion::BatchSize::SmallInput,
                );
            },
        );
    }
    group.finish();
}

fn bench_read_iter_macro(c: &mut Criterion) {
    let mut group = c.benchmark_group("read_iter_macro");
    for &size in SIZES {
        let data = vec![0u8; size];
        group.throughput(Throughput::Elements(BATCH_SIZE as u64));
        group.bench_with_input(
            BenchmarkId::from_parameter(size),
            &size,
            |b: &mut Bencher, &_size| {
                b.iter_batched(
                    || {
                        let path = AutoDeletePath::temp();
                        let mut qf = QueueFile::open(path.as_ref()).unwrap();
                        for _ in 0..BATCH_SIZE {
                            qf.add(&data).unwrap();
                        }
                        (path, qf)
                    },
                    |(_path, qf): (AutoDeletePath, QueueFile)| {
                        for item in qf.iter() {
                            criterion::black_box(item);
                        }
                    },
                    criterion::BatchSize::SmallInput,
                );
            },
        );
    }
    group.finish();
}

fn bench_read_remove_macro(c: &mut Criterion) {
    let mut group = c.benchmark_group("read_remove_macro");
    for &size in SIZES {
        let data = vec![0u8; size];
        group.throughput(Throughput::Elements(BATCH_SIZE as u64));
        group.bench_with_input(
            BenchmarkId::from_parameter(size),
            &size,
            |b: &mut Bencher, &_size| {
                b.iter_batched(
                    || {
                        let path = AutoDeletePath::temp();
                        let mut qf = QueueFile::open(path.as_ref()).unwrap();
                        for _ in 0..BATCH_SIZE {
                            qf.add(&data).unwrap();
                        }
                        (path, qf)
                    },
                    |(_path, mut qf): (AutoDeletePath, QueueFile)| {
                        for _ in 0..BATCH_SIZE {
                            qf.remove().unwrap();
                        }
                    },
                    criterion::BatchSize::SmallInput,
                );
            },
        );
    }
    group.finish();
}

criterion_group!(benches, bench_write_macro, bench_read_iter_macro, bench_read_remove_macro);
criterion_main!(benches);