subms-merge-iterator 0.5.2

submillisecond.com cookbook recipe - storage: subms-merge-iterator. N-way merge of sorted streams via min-heap.
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

//! `SubMsRecipe` impl.

use subms::{SubMsBenchParams, SubMsPerfHarness, SubMsRecipe, SubMsStageKind, SubMsTimer};

use crate::MergeIterator;

pub struct MergeIteratorRecipe;

impl SubMsRecipe for MergeIteratorRecipe {
    fn name(&self) -> &str {
        "merge-iterator"
    }

    fn run(&self, h: &mut SubMsPerfHarness, params: &SubMsBenchParams) {
        let n_streams = 16usize;
        let per_stream = params.entries / n_streams;

        // Build N sorted ascending streams. stream s has values s, s+N, s+2N, ...
        let streams: Vec<std::vec::IntoIter<u64>> = (0..n_streams)
            .map(|s| {
                (0..per_stream)
                    .map(move |i| (s + i * n_streams) as u64)
                    .collect::<Vec<_>>()
                    .into_iter()
            })
            .collect();

        let mut iter = MergeIterator::new(streams);
        let total = n_streams * per_stream;
        let s_next = h.stage("next", total).with_kind(SubMsStageKind::HotPath);
        for _ in 0..total {
            let t0 = SubMsTimer::tick();
            let _ = iter.next();
            s_next.record(t0.elapsed_ns());
        }

        h.add_meta("streams", &n_streams.to_string());
        h.add_meta("per_stream", &per_stream.to_string());
    }
}