spatial 1.0.1

An N-Dimensional R-tree family spatial tree implementations
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

extern crate spatial;

use spatial::geometry::{Point, Rect};
use spatial::tree::mbr::MbrRectQuery;
use spatial::RTree;

#[test]
fn rlinear_integration() {
    let mut tree_map = RTree::new_linear_with_max(16);
    for i in 0..32 {
        let i_f32 = i as f32;
        tree_map.insert(Point::new([i_f32; 3]), i);
        println!("i: {:?}", i);
    }
    assert_eq!(32, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());
    assert_eq!(tree_map.len(), tree_map.iter_mut().count());

    println!("Remove query");
    let removed = tree_map.remove(MbrRectQuery::ContainedBy(Rect::from_corners(
        [0.0f32, 0.0f32, 0.0f32],
        [9.0f32, 9.0f32, 9.0f32],
    )));
    assert_eq!(10, removed.len());
    assert_eq!(22, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());

    println!("Retain query");
    let removed_retain = tree_map.retain(MbrRectQuery::ContainedBy(Rect::max()), |x| *x >= 20);
    assert_eq!(10, removed_retain.len());
    assert_eq!(12, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());

    println!("Remove all");
    let retain_none = tree_map.remove(MbrRectQuery::ContainedBy(Rect::max()));
    assert_eq!(12, retain_none.len());
    assert_eq!(0, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());

    for i in 0..32 {
        let i_f32 = i as f32;
        tree_map.insert(Point::new([i_f32; 3]), i);
        println!("i: {:?}", i);
    }
    assert_eq!(32, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());
}

#[test]
fn rquadratic_integration() {
    let mut tree_map = RTree::new_quadratic_with_max(16);
    for i in 0..32 {
        let i_f32 = i as f32;
        tree_map.insert(Point::new([i_f32; 3]), i);
        println!("i: {:?}", i);
    }
    assert_eq!(32, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());
    assert_eq!(tree_map.len(), tree_map.iter_mut().count());

    println!("Remove query");
    let removed = tree_map.remove(MbrRectQuery::ContainedBy(Rect::from_corners(
        [0.0f32, 0.0f32, 0.0f32],
        [9.0f32, 9.0f32, 9.0f32],
    )));
    assert_eq!(10, removed.len());
    assert_eq!(22, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());

    println!("Retain query");
    let removed_retain = tree_map.retain(MbrRectQuery::ContainedBy(Rect::max()), |x| *x >= 20);
    assert_eq!(10, removed_retain.len());
    assert_eq!(12, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());

    println!("Remove all");
    let retain_none = tree_map.remove(MbrRectQuery::ContainedBy(Rect::max()));
    assert_eq!(12, retain_none.len());
    assert_eq!(0, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());

    for i in 0..32 {
        let i_f32 = i as f32;
        tree_map.insert(Point::new([i_f32; 3]), i);
        println!("i: {:?}", i);
    }
    assert_eq!(32, tree_map.len());
    assert_eq!(tree_map.len(), tree_map.iter().count());
}