Delete an entry by ID. Returns true if found and removed.
(&mut self, id: EntryId)
| 8 | impl RTree { |
| 9 | /// Delete an entry by ID. Returns true if found and removed. |
| 10 | pub fn delete(&mut self, id: EntryId) -> bool { |
| 11 | let removed = delete_entry(&mut self.nodes, self.root, id); |
| 12 | if let Some(orphans) = removed { |
| 13 | self.len -= 1; |
| 14 | for entry in orphans { |
| 15 | self.reinsert_entry(entry); |
| 16 | } |
| 17 | self.condense_root(); |
| 18 | true |
| 19 | } else { |
| 20 | false |
| 21 | } |
| 22 | } |
| 23 | } |
| 24 | |
| 25 | /// Recursively delete entry, returning orphaned entries on underflow. |
no test coverage detected