Struct automata::dfa::DFA

pub struct DFA<S = usize, I = char> { /* fields omitted */ }

Methods

impl<S, I> DFA<S, I>

fn new(
    start: S,
    accept_states: HashSet<S>,
    transitions: HashMap<(S, I), S>
) -> DFA<S, I>

impl<S, I> DFA<S, I>

fn iter(&self, input: Vec<I>) -> DFAIter<S, I>

Trait Implementations

impl<S, I> Automaton for DFA<S, I> where
    S: Hash + Eq + Copy,
    I: Hash + Eq + Copy, 

type State = S

type Alphabet = I

fn run(&self, s: Vec<I>) -> Option<S>

fn output_graphviz(&self, filename: &str) where
    S: Display,
    I: Display,