Struct Layout 

pub struct Layout {
    pub external: BTreeSet<EdgeIdx>,
    pub aliases: Vec<(EdgeIdx, EdgeIdx)>,
    pub packs: Vec<Vec<EdgeIdx>>,
    pub row_packs: Vec<RowPack>,
}

2026-09-28: Storage constraints an executor puts on a plan’s materialised edges.

Fields

external: BTreeSet<EdgeIdx>

2026-09-28: Edges bound to the executor’s own buffers; the planner places none of them.

aliases: Vec<(EdgeIdx, EdgeIdx)>

2026-09-28: (output, input): a kernel writes output in place over input, so the two share storage. They must have the same size.

packs: Vec<Vec<EdgeIdx>>

2026-09-28: Edges a kernel writes back to back, in this order, from one pointer.

row_packs: Vec<RowPack>

2026-09-28: Edges a kernel writes side by side within each row.

Trait Implementations

impl Clone for Layout

fn clone(&self) -> Layout

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Layout

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Layout

fn default() -> Layout

Returns the “default value” for a type.

impl PartialEq for Layout

fn eq(&self, other: &Layout) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Layout

impl StructuralPartialEq for Layout