Struct PaneTree 

pub struct PaneTree { /* private fields */ }

Validated pane tree model for runtime usage.

Implementations

impl PaneTree

pub fn singleton(surface_key: impl Into<String>) -> Self

Build a singleton tree with one root leaf.

pub fn from_snapshot(snapshot: PaneTreeSnapshot) -> Result<Self, PaneModelError>

Construct and validate from a serial snapshot.

pub fn to_snapshot(&self) -> PaneTreeSnapshot

Export to canonical snapshot form.

pub const fn root(&self) -> PaneId

Root node ID.

pub const fn next_id(&self) -> PaneId

Next deterministic ID value.

pub const fn schema_version(&self) -> u16

Current schema version.

pub fn node(&self, id: PaneId) -> Option<&PaneNodeRecord>

Lookup a node by ID.

pub fn nodes(&self) -> impl Iterator<Item = &PaneNodeRecord>

Iterate nodes in canonical ID order.

pub fn validate(&self) -> Result<(), PaneModelError>

Validate internal invariants.

pub fn invariant_report(&self) -> PaneInvariantReport

Structured invariant diagnostics for the current tree snapshot.

pub fn state_hash(&self) -> u64

Deterministic structural hash of the current tree state.

This is intended for operation logs and replay diagnostics.

pub fn begin_transaction(&self, transaction_id: u64) -> PaneTransaction

Start a transaction boundary for one or more structural operations.

Transactions stage mutations on a cloned working tree and provide a deterministic operation journal for replay, undo/redo, and auditing.

pub fn apply_operation( &mut self, operation_id: u64, operation: PaneOperation, ) -> Result<PaneOperationOutcome, PaneOperationError>

Apply one structural operation atomically.

The operation is executed on a cloned working tree. On success, the mutated clone replaces self; on failure, self is unchanged.

pub fn solve_layout(&self, area: Rect) -> Result<PaneLayout, PaneModelError>

Solve the split-tree into concrete rectangles for the provided viewport.

Deterministic tie-break rule:

• Desired split size is floor(available * ratio).
• If clamping is required by constraints, we clamp into the feasible interval for the first child; remainder goes to the second child.

Complexity:

• Time: O(node_count) (single DFS over split tree)
• Space: O(node_count) (output rectangle map)

Trait Implementations

impl Clone for PaneTree

fn clone(&self) -> PaneTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PaneTree

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

Formats the value using the given formatter.

impl PartialEq for PaneTree

fn eq(&self, other: &PaneTree) -> 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 PaneTree

impl StructuralPartialEq for PaneTree