Struct FlatNode 

struct FlatNode {
    mins: [i64; 7],
    maxs: [i64; 7],
    value_index: u32,
    children_start: u32,
    children_count: u8,
}

Compact node for the flattened R-Tree.

Children of the same parent are stored at contiguous indices in a single Vec<FlatNode>, enabling cache-efficient iteration during search. The BFS-order layout also means that nodes accessed together during a search tend to be near each other in memory.

Fields

mins: [i64; 7]

Bounding box minimum values for each parameter dimension.

maxs: [i64; 7]

Bounding box maximum values for each parameter dimension.

value_index: u32

For leaf nodes: index into the values array. For subtree nodes: u32::MAX (sentinel).

children_start: u32

Start index of children in the nodes array (subtree only).

children_count: u8

Number of children (0 = leaf, 1..=6 = subtree).

Implementations

impl FlatNode

fn distance(&self, target: &[i64; 7]) -> i64

Compute the squared distance from a target point to this node’s bounding box.

Uses branchless max operations (compiles to cmov) to avoid branch mispredictions in the hot inner loop.

const fn is_leaf(&self) -> bool