Struct GrammarDecomposition 

pub struct GrammarDecomposition { /* private fields */ }

The result of the WGRAMMAR static/dynamic decomposition pass over a whole grammar — one RuleDecomposition per rule, indexed by rule_id.

This is the compile-time “index of the scaffolding”: it records, before any decode step, which byte spans of which rule bodies are fixed literals and what those literals are. It composes with Tier 3b — every Static segment is exactly a forced-token chain — and with Tier 2 — the JIT cache still owns the actual AdaptiveTokenMasks. It adds no parallel masking path; it is a classification + byte precompute.

Implementations

impl GrammarDecomposition

pub fn rule_region(&self, rule_id: i32) -> &RuleDecomposition

The decomposition of rule rule_id’s body.

pub fn regions(&self) -> &[RuleDecomposition]

Every rule’s decomposition, in rule_id order.

pub fn fully_static_rule_count(&self) -> usize

Number of rules whose body is entirely fixed scaffolding.

pub fn static_segment_count(&self) -> usize

Number of static segments across every rule body — the count of distinct scaffolding spans WGRAMMAR precomputes. Recurses into Segment::Choice branches.

pub fn dynamic_segment_count(&self) -> usize

Number of dynamic segments across every rule body — the count of genuine value slots. Recurses into Segment::Choice branches.

pub fn total_static_bytes(&self) -> usize

Total precomputed static scaffolding bytes across the grammar — the byte count the matcher never has to discover at decode.

pub fn static_segment_fraction(&self) -> f64

The fraction of segments that are static scaffolding, in [0.0, 1.0]. WGRAMMAR’s premise is that the bytes are overwhelmingly scaffolding; the segment count is a coarser proxy. Returns 0.0 for a grammar with no segments.

Trait Implementations

impl Clone for GrammarDecomposition

fn clone(&self) -> GrammarDecomposition

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GrammarDecomposition

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

Formats the value using the given formatter.

impl PartialEq for GrammarDecomposition

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

impl StructuralPartialEq for GrammarDecomposition