spart 0.5.1

A collection of space partitioning tree data structures for Rust
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130

mod helpers;

#[cfg(test)]
mod tests {
    use super::helpers::Anyhow;
    use spart::geometry::{Cube, Point2D, Point3D, Rectangle};
    use spart::kdtree::KdTree;
    use spart::octree::Octree;
    use spart::quadtree::Quadtree;
    use spart::rstar_tree::RStarTree;
    use spart::rtree::RTree;

    #[test]
    fn test_quadtree_serialization() -> Anyhow {
        let boundary = Rectangle {
            x: 0.0,
            y: 0.0,
            width: 100.0,
            height: 100.0,
        };
        let mut qt = Quadtree::new(&boundary, 4).unwrap();
        qt.insert(Point2D::new(10.0, 20.0, Some("point1".to_string())));
        qt.insert(Point2D::new(50.0, 50.0, Some("point2".to_string())));

        let encoded: Vec<u8> = bincode::serialize(&qt)?;
        let decoded: Quadtree<String> = bincode::deserialize(&encoded[..])?;

        assert_eq!(
            qt.knn_search::<spart::geometry::EuclideanDistance>(&Point2D::new(12.0, 22.0, None), 1),
            decoded.knn_search::<spart::geometry::EuclideanDistance>(
                &Point2D::new(12.0, 22.0, None),
                1
            )
        );
        Ok(())
    }

    #[test]
    fn test_octree_serialization() -> Anyhow {
        let boundary = Cube {
            x: 0.0,
            y: 0.0,
            z: 0.0,
            width: 100.0,
            height: 100.0,
            depth: 100.0,
        };
        let mut octree = Octree::new(&boundary, 4).unwrap();
        octree.insert(Point3D::new(10.0, 20.0, 30.0, Some("point1".to_string())));
        octree.insert(Point3D::new(50.0, 50.0, 50.0, Some("point2".to_string())));

        let encoded: Vec<u8> = bincode::serialize(&octree)?;
        let decoded: Octree<String> = bincode::deserialize(&encoded[..])?;

        assert_eq!(
            octree.knn_search::<spart::geometry::EuclideanDistance>(
                &Point3D::new(12.0, 22.0, 32.0, None),
                1
            ),
            decoded.knn_search::<spart::geometry::EuclideanDistance>(
                &Point3D::new(12.0, 22.0, 32.0, None),
                1
            )
        );
        Ok(())
    }

    #[test]
    fn test_kdtree_serialization() -> Anyhow {
        let mut tree: KdTree<Point2D<String>> = KdTree::new();
        tree.insert(Point2D::new(1.0, 2.0, Some("A".to_string())))
            .unwrap();
        tree.insert(Point2D::new(3.0, 4.0, Some("B".to_string())))
            .unwrap();

        let encoded: Vec<u8> = bincode::serialize(&tree)?;
        let decoded: KdTree<Point2D<String>> = bincode::deserialize(&encoded[..])?;

        assert_eq!(
            tree.knn_search::<spart::geometry::EuclideanDistance>(&Point2D::new(2.0, 3.0, None), 1),
            decoded
                .knn_search::<spart::geometry::EuclideanDistance>(&Point2D::new(2.0, 3.0, None), 1)
        );
        Ok(())
    }

    #[test]
    fn test_rtree_serialization() -> Anyhow {
        let mut tree: RTree<Point2D<String>> = RTree::new(4).unwrap();
        tree.insert(Point2D::new(10.0, 20.0, Some("point1".to_string())));
        tree.insert(Point2D::new(50.0, 50.0, Some("point2".to_string())));

        let encoded: Vec<u8> = bincode::serialize(&tree)?;
        let decoded: RTree<Point2D<String>> = bincode::deserialize(&encoded[..])?;

        let query_rect = Rectangle {
            x: 5.0,
            y: 15.0,
            width: 10.0,
            height: 10.0,
        };
        assert_eq!(
            tree.range_search_bbox(&query_rect).len(),
            decoded.range_search_bbox(&query_rect).len()
        );
        Ok(())
    }

    #[test]
    fn test_rstartree_serialization() -> Anyhow {
        let mut tree: RStarTree<Point2D<String>> = RStarTree::new(4).unwrap();
        tree.insert(Point2D::new(10.0, 20.0, Some("point1".to_string())));
        tree.insert(Point2D::new(50.0, 50.0, Some("point2".to_string())));

        let encoded: Vec<u8> = bincode::serialize(&tree)?;
        let decoded: RStarTree<Point2D<String>> = bincode::deserialize(&encoded[..])?;

        let query_rect = Rectangle {
            x: 5.0,
            y: 15.0,
            width: 10.0,
            height: 10.0,
        };
        assert_eq!(
            tree.range_search_bbox(&query_rect).len(),
            decoded.range_search_bbox(&query_rect).len()
        );
        Ok(())
    }
}