Function treat_overflow

nodedb-spatial/src/rtree/insert.rs:129–140

R*-tree overflow: forced reinsert first, then split on second overflow.

(tree: &mut RTree, node_idx: usize, reinserted_levels: &mut Vec<u32>)

/// R*-tree overflow: forced reinsert first, then split on second overflow.
fn treat_overflow(tree: &mut RTree, node_idx: usize, reinserted_levels: &mut Vec<u32>) {
    let level = tree.nodes[node_idx].level;
    if node_idx != tree.root && !reinserted_levels.contains(&level) {
        reinserted_levels.push(level);
        let entries = forced_reinsert(tree, node_idx);
        for entry in entries {
            insert_entry(tree, entry, 0, reinserted_levels);
        }
    } else {
        split_node(tree, node_idx);
    }
}

/// Remove the farthest entries from node center and return for reinsertion.
fn forced_reinsert(tree: &mut RTree, node_idx: usize) -> Vec<RTreeEntry> {