Struct Dfa

pub struct Dfa<S, T> { /* private fields */ }

A deterministic finite automaton.

Implementations

impl<S: Clone + Ord, T: Clone + Ord> Dfa<S, T>

pub fn new(initial: S) -> Dfa<S, T>

Create a new deterministic finite automaton with the given initial state.

pub fn states_insert(&mut self, state: S) -> StateIndex

Insert the state and return the associated state index.

impl<S: Ord, T: Ord> Dfa<S, T>

pub fn states_contains(&self, state: &S) -> Option<StateIndex>

Return the state index of the state, if it exists.

pub fn states_index(&self, state_index: StateIndex) -> &S

Get the state at the state index.

pub fn states_slice<'a>( &'a self, state_indices: impl IntoIterator<Item = StateIndex> + 'a, ) -> Box<dyn Iterator<Item = &S> + 'a>

Convert the state indices to states.

pub fn state_indices<'a>(&'a self) -> Box<dyn Iterator<Item = StateIndex> + 'a>

Get all the state indices.

impl<S: Clone + Ord, T: Clone + Ord> Dfa<S, T>

pub fn transitions_insert( &mut self, transition: (StateIndex, Segment<T>, StateIndex), ) -> TransitionIndex

Insert the transition and return the associated transition index.

impl<S: Ord, T: Ord> Dfa<S, T>

pub fn transitions_contains( &self, transition: (StateIndex, &T, StateIndex), ) -> Option<TransitionIndex>

Return the transition index of the transition, if it exists.

pub fn transitions_contains_outgoing( &self, transition: (StateIndex, &T), ) -> Option<TransitionIndex>

Return the transition index of the transition with the outgoing data, if it exists.

pub fn transitions_index( &self, transition_index: TransitionIndex, ) -> (StateIndex, &Segment<T>, StateIndex)

Get the transition at the transition index.

pub fn transitions_slice<'a>( &'a self, transition_indices: impl IntoIterator<Item = TransitionIndex> + 'a, ) -> Box<dyn Iterator<Item = (StateIndex, &Segment<T>, StateIndex)> + 'a>

Convert the transition indices to transitions.

pub fn transition_indices<'a>( &'a self, ) -> Box<dyn Iterator<Item = TransitionIndex> + 'a>

Get all the transition indices.

pub fn transition_indices_from<'a>( &'a self, state_index: StateIndex, ) -> Box<dyn Iterator<Item = TransitionIndex> + 'a>

Get the transition indices originating at the state index.

pub fn initial_index(&self) -> StateIndex

Get the index of the initial state.

pub fn is_final(&self, state_index: StateIndex) -> bool

Check if the state at the state index is a final state.

pub fn set_final(&mut self, state_index: StateIndex)

Set the state at the state index as a final state.

pub fn final_indices<'a>(&'a self) -> Box<dyn Iterator<Item = StateIndex> + 'a>

Get all the state indices for final states.

Trait Implementations

impl<S: Clone, T: Clone> Clone for Dfa<S, T>

fn clone(&self) -> Dfa<S, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Debug, T: Debug> Debug for Dfa<S, T>

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

Formats the value using the given formatter.

impl<S: Clone + Ord, T: Clone + Ord> From<&Dfa<S, T>> for Enfa<S, T>

fn from(dfa: &Dfa<S, T>) -> Enfa<S, T>

Create a new nondeterministic finite automaton with epsilon moves from the deterministic finite automaton.

impl<S: Clone + Ord, T: Clone + Ord> From<&Dfa<S, T>> for Nfa<S, T>

fn from(dfa: &Dfa<S, T>) -> Nfa<S, T>

Create a new nondeterministic finite automaton from the deterministic finite automaton.

impl<S: Clone + Ord, T: Clone + Ord> From<&Enfa<S, T>> for Dfa<BTreeSet<S>, T>

fn from(enfa: &Enfa<S, T>) -> Dfa<Set<S>, T>

Create a new deterministic finite automaton from the nondeterministic finite automaton with epsilon moves.

impl<S: Clone + Ord, T: Clone + Ord> From<&Nfa<S, T>> for Dfa<BTreeSet<S>, T>

fn from(nfa: &Nfa<S, T>) -> Dfa<Set<S>, T>

Create a new deterministic finite automaton from the nondeterministic finite automaton.

impl<S: Ord, T: Ord> Ord for Dfa<S, T>

fn cmp(&self, other: &Dfa<S, T>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<S: PartialEq, T: PartialEq> PartialEq for Dfa<S, T>

fn eq(&self, other: &Dfa<S, T>) -> 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<S: PartialOrd, T: PartialOrd> PartialOrd for Dfa<S, T>

fn partial_cmp(&self, other: &Dfa<S, T>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<S: Ord, T: Ord> StatesContains<S> for Dfa<S, T>

fn states_contains(&self, state: &S) -> Option<StateIndex>

Return the state index of the state, if it exists.

impl<S: Ord, T: Ord> StatesIndex<S> for Dfa<S, T>

fn states_index(&self, state_index: StateIndex) -> &S

Get the state at the state index.

impl<S: Ord, T: Ord> StatesSlice<S> for Dfa<S, T>

fn states_slice<'a>( &'a self, state_indices: impl IntoIterator<Item = StateIndex> + 'a, ) -> Box<dyn Iterator<Item = &S> + 'a>

Convert the state indices to states.

impl<S: Clone + Ord, T: Clone + Ord> Subsume<Dfa<S, T>> for Dfa<S, T>

fn subsume(&mut self, dfa: &Dfa<S, T>)

Insert all the states and transitions of the deterministic finite automaton.

impl<S: Clone + Ord, T: Clone + Ord> Subsume<Dfa<S, T>> for Enfa<S, T>

fn subsume(&mut self, dfa: &Dfa<S, T>)

Insert all the states and transitions of the deterministic finite automaton.

impl<S: Clone + Ord, T: Clone + Ord> Subsume<Dfa<S, T>> for Nfa<S, T>

fn subsume(&mut self, dfa: &Dfa<S, T>)

Insert all the states and transitions of the deterministic finite automaton.

impl<S: Clone + Ord, T: Clone + Ord> Subsume<Enfa<S, T>> for Dfa<BTreeSet<S>, T>

fn subsume(&mut self, enfa: &Enfa<S, T>)

Insert all the states and transitions of the nondeterministic finite automaton with epsilon moves.

impl<S: Clone + Ord, T: Clone + Ord> Subsume<Nfa<S, T>> for Dfa<BTreeSet<S>, T>

fn subsume(&mut self, nfa: &Nfa<S, T>)

Insert all the states and transitions of the nondeterministic finite automaton.

impl<S: Eq, T: Eq> Eq for Dfa<S, T>

impl<S, T> StructuralPartialEq for Dfa<S, T>