quorum-set 0.1.0

Hierarchical quorum trees with deterministic canonical IDs
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

extern crate test;

use maplit::btreeset;
use test::Bencher;
use test::black_box;

use crate::progress::VecProgress;

#[bench]
fn progress_update_progress_01234_567(b: &mut Bencher) {
    let quorum_set = vec![btreeset! {0, 1, 2, 3, 4}, btreeset! {5, 6, 7}];
    let mut progress = VecProgress::<(u64, u64), _>::new(quorum_set, [], |id| (id, 0));

    let mut id = 0u64;
    let mut values = [0, 1, 2, 3, 4, 5, 6, 7];
    b.iter(|| {
        id = (id + 1) & 7;
        values[id as usize] += 1;
        let v = values[id as usize];

        progress.update_progress(&black_box(id), black_box(v));
    });

    // It shows that is_quorum() is called at a rate of about 1/4 of update_progress()
    // `Stat { update_count: 42997501, move_count: 10749381, is_quorum_count: 10749399 }`
    // println!("progress stat: {:?}", progress.stat());
}