gst 0.1.3

Generalised Search Tree
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

extern crate gst;
use gst::rtree::{RTree, Rect};

#[test]
fn test_rtree_basic_insert_get() {
    let mut tree = RTree::new();
    tree.insert(Rect::from_float(0., 0., 0., 0.), String::from("Origin"));
    assert_eq!(tree.get(&Rect::from_float(0., 0., 0., 0.))[0].1, "Origin");
}

#[test]
fn test_rtree_inserts_triggering_splits() {
    let mut rtree = RTree::new();
    for i in -10..10 {
        for j in -10..10 {
            let r = Rect::from_float(i as f32, i as f32, j as f32, j as f32);
            let s = format!("{}^2 + {}", i, j);
            rtree.insert(r, s);
        }
    }

    assert_eq!(rtree.get(&Rect::from_float(-10., 10., -10., 10.)).len(), 400);
}


#[test]
fn test_gst_get_rect() {
    let mut rtree = RTree::new();
    rtree.insert(Rect::from_float(0., 0., 0., 0.), String::from("Origin"));
    rtree.insert(Rect::from_float(1., 1., 0., 0.), String::from("X1"));
    rtree.insert(Rect::from_float(0., 0., 1., 1.), String::from("Y1"));
    rtree.insert(Rect::from_float(1., 1., 1., 1.), String::from("X1Y1"));
    assert_eq!(rtree.get(&Rect::from_float(0.0,  0.5,  0.0,  0.5 )).len(), 1);
    assert_eq!(rtree.get(&Rect::from_float(0.0,  1.0,  0.0,  1.0 )).len(), 4);
    assert_eq!(rtree.get(&Rect::from_float(0.25, 0.75, 0.25, 0.75)).len(), 0);
}

#[test]
fn test_insert_with_overlap() {
    let mut rtree = RTree::new();
    rtree.insert(Rect::from_float(0., 0., 5., 5.), "first");
    rtree.insert(Rect::from_float(1., 7., 1., 7.), "second");
    let mut res = rtree.get(&Rect::from_float(6., 6., 6., 6.)).into_iter();

    assert_eq!(res.next().map(|(_, s)| s), Some(&"second"));
    assert_eq!(res.next(), None);
}