Struct Dfa 

pub struct Dfa { /* private fields */ }

Lazily built deterministic automaton over symbol classes.

Implementations

impl Dfa

pub fn new( store: &mut TermStore, start: TermId, alphabet: &'static str, budget: &mut Budget, ) -> Result<Dfa, ErrorCode>

Start an automaton at start. The symbol classes are those of start.

pub fn num_states(&self) -> usize

Number of states created so far.

pub fn num_classes(&self) -> usize

Number of symbol classes.

pub fn class_of(&self, c: u32) -> Option<usize>

Class index of a symbol, or None when outside the universe.

pub fn step( &mut self, store: &mut TermStore, s: u32, class: usize, budget: &mut Budget, ) -> Result<u32, ErrorCode>

Transition from s on class, computed once and cached.

pub fn matches( &mut self, store: &mut TermStore, input: &[u32], budget: &mut Budget, ) -> Result<bool, ErrorCode>

Full-match test: does the whole input belong to the language?

pub fn explore( &mut self, store: &mut TermStore, budget: &mut Budget, ) -> Result<(), ErrorCode>

Build every reachable state and transition.

pub fn minimize( &mut self, store: &mut TermStore, budget: &mut Budget, ) -> Result<MinDfa, ErrorCode>

Minimal complete automaton in canonical numbering.