()
| 219 | |
| 220 | #[test] |
| 221 | fn nearest_neighbor() { |
| 222 | let mut tree = RTree::new(); |
| 223 | tree.insert(make_entry(1, 0.0, 0.0)); |
| 224 | tree.insert(make_entry(2, 10.0, 10.0)); |
| 225 | tree.insert(make_entry(3, 5.0, 5.0)); |
| 226 | let nn = tree.nearest(4.0, 4.0, 2); |
| 227 | assert_eq!(nn.len(), 2); |
| 228 | assert_eq!(nn[0].entry_id, 3); |
| 229 | assert_eq!(nn[1].entry_id, 1); |
| 230 | } |
| 231 | |
| 232 | #[test] |
| 233 | fn nearest_empty() { |
nothing calls this directly
no test coverage detected