Struct State 

pub struct State { /* private fields */ }

A state in a nondeterministic finite automaton. A state is merely a collection of transitions to other states. In a nondeterministic automaton, a state can have multiple transitions with the same input leading to different states. If the state has no transitions, it is a dead end state. If the state is a final state, it accepts the input.

Implementations

impl State

pub fn is_det(&self) -> bool

Checks if the state is deterministic. A state is deterministic if it has at most one transition for each input character. A state is not deterministic if it has multiple transitions for the same input character or an epsilon transition.

Trait Implementations

impl Clone for State

fn clone(&self) -> State

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for State

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

Formats the value using the given formatter.

impl Hash for State

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for State

fn eq(&self, other: &State) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for State

impl StructuralPartialEq for State