()
| 206 | |
| 207 | #[test] |
| 208 | fn delete_entry() { |
| 209 | let mut tree = RTree::new(); |
| 210 | for i in 0..50 { |
| 211 | tree.insert(make_entry(i, i as f64, i as f64)); |
| 212 | } |
| 213 | assert!(tree.delete(25)); |
| 214 | assert_eq!(tree.len(), 49); |
| 215 | let all = tree.search(&BoundingBox::new(-1.0, -1.0, 100.0, 100.0)); |
| 216 | assert!(all.iter().all(|e| e.id != 25)); |
| 217 | assert!(!tree.delete(999)); |
| 218 | } |
| 219 | |
| 220 | #[test] |
| 221 | fn nearest_neighbor() { |
nothing calls this directly
no test coverage detected