Insert an entry into the R-tree.
(&mut self, entry: RTreeEntry)
| 11 | impl RTree { |
| 12 | /// Insert an entry into the R-tree. |
| 13 | pub fn insert(&mut self, entry: RTreeEntry) { |
| 14 | let bbox = entry.bbox; |
| 15 | let mut reinserted_levels = Vec::new(); |
| 16 | insert_entry(self, entry, 0, &mut reinserted_levels); |
| 17 | self.len += 1; |
| 18 | self.nodes[self.root].bbox = self.nodes[self.root].bbox.union(&bbox); |
| 19 | } |
| 20 | |
| 21 | /// Insert with reinsert tracking (used internally and by delete). |
| 22 | pub(crate) fn reinsert_entry(&mut self, entry: RTreeEntry) { |