insert/insert.rs
1extern crate kd_tree_rs;
2
3use kd_tree_rs::KdNode;
4use kd_tree_rs::KdNode::Empty;
5use kd_tree_rs::point::Point;
6
7fn main() {
8 let mut node: KdNode<i32> = KdNode::new();
9 assert_eq!(node, Empty);
10
11 // Tree Root
12 node.insert(1, 1);
13 node.insert(2, 2);
14 node.insert(2, -12);
15
16 println!("{:?}", node);
17 println!("{:?}", node.nearest_neighbor_x_y(1, 1, 1.0));
18 println!("{:?}", node.nearest_neighbor(Point{x: 1, y: 1}, 1.0));
19}