compt 1.10.2

A complete binary tree visitor library
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

#![feature(test)]

extern crate test;
extern crate compt;
use compt::*;
use test::*;

#[bench]
fn bench_bfs_dfs(bench: &mut Bencher) {
    let mut k = compt::bfs_order::CompleteTreeContainer::from_vec(vec![0; 16383]).unwrap();
    bench.iter(|| {
        for a in k.vistr_mut().dfs_preorder_iter() {
            *a += 1;
        }
    });

    black_box(k);
}

#[bench]
fn bench_dfs_dfs(bench: &mut Bencher) {
    let mut k = compt::dfs_order::CompleteTreeContainer::from_preorder(vec![0; 16383]).unwrap();
    bench.iter(|| {
        for a in k.vistr_mut().dfs_preorder_iter() {
            *a += 1;
        }
    });

    black_box(k);
}
/*
#[bench]
fn bench_bfs_bfs(bench: &mut Bencher) {
    let mut k = compt::bfs_order::CompleteTreeContainer::from_vec(vec![0; 16383]).unwrap();
    bench.iter(|| {
        for a in k.vistr_mut().bfs_iter() {
            *a += 1;
        }
    });

    black_box(k);
}
*/
/*
#[bench]
fn bench_dfs_bfs(bench: &mut Bencher) {
    let mut k = compt::dfs_order::CompleteTreeContainer::from_preorder(vec![0; 16383]).unwrap();
    bench.iter(|| {
        for a in k.vistr_mut().bfs_iter() {
            *a += 1;
        }
    });

    black_box(k);
}
*/