Struct TreeShape 

pub struct TreeShape {
    pub counts: Vec<u8>,
}

Fields

counts: Vec<u8>

2026-09-25: counts[d-1] is the number of nodes at depth d; 1 means the spine node only.

Implementations

impl TreeShape

pub fn parse(s: &str) -> Result<Self>

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

pub fn spine_len(&self) -> usize

pub fn nodes(&self) -> usize

2026-09-25: Total tree nodes (spine and hedges), excluding the root row.

pub fn verify_width(&self) -> usize

2026-09-25: Verify width: the root row plus the nodes.

pub fn shape_id(&self) -> u64

2026-09-25: The counts packed 4 bits per depth. Distinct for distinct valid shapes: every count is in 1..=4, so no nibble is zero.

pub fn is_chain(&self) -> bool

2026-09-25: True when no depth holds a hedge.

Trait Implementations

impl Clone for TreeShape

fn clone(&self) -> TreeShape

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TreeShape

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

Formats the value using the given formatter.

impl PartialEq for TreeShape

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

impl StructuralPartialEq for TreeShape