priority_container 0.1.1

Datastructure to find n biggest/smallest items within a large set
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

use criterion::{criterion_group, criterion_main, Criterion};
use priority_container::UniquePrioContainerMax;
use rand::prelude::*;

fn overlapping(c: &mut Criterion) {
    let mut rng = StdRng::seed_from_u64(1000);

    let mut prio_queue = UniquePrioContainerMax::<u64>::new(1000);

    for _ in 0..10000 {
        prio_queue.insert(rng.next_u64());
    }

    c.bench_function("similarity", |b| {
        let nr = rng.next_u64();
        b.iter(|| {
            prio_queue.insert(nr);
        })
    });
}

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