Struct dfa::Automaton

pub struct Automaton<T>where
    T: Eq,{ /* private fields */ }

Implementations

impl<T> Automaton<T>where
    T: Eq,

pub fn new() -> Self

Creates a new automaton with 1 state and no edges.

pub fn add_state(&mut self) -> StateIndex

Adds a state in the automaton and return it’s StateIndex.

pub fn add_edge(&mut self, source: StateIndex, target: StateIndex, value: T)

Adds an edge to the automaton, requires the starting state, the ending state and a value of type T representing the transition value.

pub fn set_start(&mut self, new_start: StateIndex)

Sets the starting state of the automaton.

pub fn add_end(&mut self, new_end: StateIndex)

Adds an accepting state to the automaton.

pub fn consume(&mut self, val: T)

Consumes a value and advances, if the value is not present in some transition then it stays in the same state.

pub fn restart(&mut self)

Restarts the automaton, setting the current state to start.

pub fn accepted(&self) -> bool

Returns a boolean value telling if the current state is an accepting state.

pub fn current(&self) -> StateIndex

Returns StateIndex of the current value.

Trait Implementations

impl<T: Debug> Debug for Automaton<T>where
    T: Eq,

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

Formats the value using the given formatter.