Struct Dfa 

pub struct Dfa {
    pub states: Vec<State>,
    pub composition_to_state: HashMap<Box<[Transformation]>, u32>,
}

The DFA (Deterministic Finite Automaton) core that manages states and transitions.

This DFA supports a Lazy JIT mechanism, allowing the Engine to learn new states during execution to optimize performance.

Fields

states: Vec<State>

List of states in the DFA.

composition_to_state: HashMap<Box<[Transformation]>, u32>

Hash map mapping transformation stacks to state IDs to avoid duplicates.

Implementations

impl Dfa

pub fn new() -> Self

Creates a new DFA with an initial empty state (empty syllable).

pub fn get_state(&self, id: u32) -> &State

Retrieves a reference to a state by its ID.

pub fn add_state(&mut self, composition: &[Transformation]) -> u32

Adds a new state to the DFA from a transformation stack. If the state already exists, it returns the existing state ID.

pub fn find_state(&self, composition: &[Transformation]) -> Option<u32>

Finds the state ID corresponding to a transformation stack.

Trait Implementations

impl Default for Dfa

fn default() -> Self

Returns the “default value” for a type.