Struct Dfa 

pub struct Dfa<'a, Σ: Eq + Hash + Copy, S: State<Σ>> { /* private fields */ }

Provides an API for construction and simulation of a DFA structure. Symbol type Σ must be hashable and implement display (not asking for alot here..)

Implementations

impl<'a, Σ: Eq + Hash + Copy> Dfa<'a, Σ, PartialState<Σ>>

pub fn new(start_node: &'a PartialState<Σ>) -> Self

Creates a new DFA with no vertices, but an Arena ready for pushing verts.

pub fn simulate_slice(&self, input: &[Σ]) -> bool

Tests the provided input sequence, returning true if the DFA ends at an accept state.

pub fn simulate_iter(&self, input: impl Iterator<Item = Σ>) -> bool

Tests the provided input sequence on an iterator, returning true if the DFA ends at an accept state.

impl<'a, Σ: Eq + Hash + Copy + Indexable> Dfa<'a, Σ, CompleteState<Σ>>

pub fn new(start_node: &'a CompleteState<Σ>) -> Self

Creates a new DFA with no vertices, but an Arena ready for pushing verts.

pub fn simulate_iter(&self, input: impl Iterator<Item = Σ>) -> bool

Tests the provided input sequence, returning true if the DFA ends at an accept state.

pub fn simulate_slice(&self, input: &[Σ]) -> bool

Tests the provided input sequence, returning true if the DFA ends at an accept state.