Struct TreeShape 

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

Static tree shape: per-depth node counts.

Fields

counts: Vec<u8>

counts[d-1] = number of candidate nodes at depth d (1 = spine 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

Total tree nodes (spine + hedges), excluding the root row.

pub fn verify_width(&self) -> usize

Verify width M = root row + nodes.

pub fn shape_id(&self) -> u64

Stable id for CUDA-graph keying: counts packed 4 bits per depth.

pub fn is_chain(&self) -> bool

A pure chain (no hedges) — must reproduce the chain drafter exactly.

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