fn search_nearest(
nodes: &[FlatNode],
node: &FlatNode,
target: &[i64; 7],
best_dist: &mut i64,
best_idx: &mut Option<u32>,
)Expand description
Search the flat R-Tree for the nearest leaf to the target.
Matches vanilla’s SubTree.search() which passes the candidate through
recursion and checks the returned leaf distance against the local best.