treez 0.7.0

A collection of useful tree data structures.
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

use std::collections::HashSet;

extern crate treez;

#[test]
fn init() {
    
    let mut segments = vec![];
    for i in 0..10 {
        let n = (i*5, 5*i+5, i);
        segments.push( n );
    }
    let t : treez::seg::TreeSeg = treez::seg::TreeSeg::init( segments.as_slice() );
    assert!( t.len_nodes() == 21 );

    {
        let check: HashSet<_> = [ 1, 2, 3 ].iter().cloned().collect();
        let query_segs: HashSet<_> = t.get_segs_from_bound( (10,15) ).iter().cloned().collect();
        println!( "query segs: {:?}", query_segs );
        assert!( check.intersection(&query_segs).count() == check.len() );
    }
    {
        let check: HashSet<_> = [ 2, 3, 4 ].iter().cloned().collect();
        let query_segs: HashSet<_> = t.get_segs_from_bound( (15,20) ).iter().cloned().collect();
        println!( "query segs: {:?}", query_segs );
        assert!( check.intersection(&query_segs).count() == check.len() );
    }
    {
        //point query
        let check: HashSet<_> = [ 2 ].iter().cloned().collect();
        let query_segs: HashSet<_> = t.get_segs_from_bound( (12,12) ).iter().cloned().collect();
        println!( "query segs: {:?}", query_segs );
        assert!( check.intersection(&query_segs).count() == check.len() );
    }
    {
        //out of bound query
        let check: HashSet<_> = [ ].iter().cloned().collect();
        let query_segs: HashSet<_> = t.get_segs_from_bound( (-99,-5) ).iter().cloned().collect();
        println!( "query segs: {:?}", query_segs );
        assert!( check.intersection(&query_segs).count() == check.len() );
    }
    {
        //out of bound query
        let check: HashSet<_> = [ ].iter().cloned().collect();
        let query_segs: HashSet<_> = t.get_segs_from_bound( (100,200) ).iter().cloned().collect();
        println!( "query segs: {:?}", query_segs );
        assert!( check.intersection(&query_segs).count() == check.len() );
    }
    {
        //collect all segs
        let check: HashSet<_> = (0..10).collect();
        let query_segs: HashSet<_> = t.get_segs_from_bound( (0,50) ).iter().cloned().collect();
        println!( "query segs: {:?}", query_segs );
        assert!( check.intersection(&query_segs).count() == check.len() );
    }
    {
        //collect all segs
        let check: HashSet<_> = (0..10).collect();
        let query_segs: HashSet<_> = t.get_segs_from_bound( (-9,100) ).iter().cloned().collect();
        println!( "query segs: {:?}", query_segs );
        assert!( check.intersection(&query_segs).count() == check.len() );
    }
}