Struct typestate_automata::NonDeterministicFiniteAutomata[][src]

pub struct NonDeterministicFiniteAutomata<State, Transition> where
    State: Eq + Hash + Clone,
    Transition: Eq + Hash + Clone
{ pub states: HashSet<State>, pub initial_states: HashMap<State, HashSet<Transition>>, pub final_states: HashMap<State, HashSet<Transition>>, // some fields omitted }

A representation for non-deterministic finite automata.

Fields

states: HashSet<State>

Deterministic finite automata states.

initial_states: HashMap<State, HashSet<Transition>>

Deterministic finite automata initial state-indexes.

final_states: HashMap<State, HashSet<Transition>>

Deterministic finite automata final state-indexes.

Implementations

impl<State, Transition> NonDeterministicFiniteAutomata<State, Transition> where
    State: Eq + Hash + Clone,
    Transition: Eq + Hash + Clone
[src]

#[must_use]
pub fn new() -> Self
[src]

Construct a new non-deterministic finite automata.

pub fn add_state(&mut self, state: State)[src]

Add a state to the automata.

pub fn add_initial(&mut self, state: State, symbol: Transition)[src]

Add an initial state to the automata.

pub fn add_final(&mut self, state: State, symbol: Transition)[src]

Add a final state to the automata.

pub fn add_sigma(&mut self, sigma: Transition)[src]

Add a new symbol to the automata alphabet.

pub fn add_transition(
    &mut self,
    source: State,
    symbol: Transition,
    destination: State
)
[src]

pub fn add_non_deterministic_transitions(
    &mut self,
    source: &State,
    symbol: &Transition,
    destinations: impl Iterator<Item = State>
)
[src]

#[must_use]
pub fn productive_states(&self) -> HashSet<State>
[src]

Compute the automata productive states.

#[must_use]
pub fn non_productive_states(&self) -> HashSet<State>
[src]

Compute the automata non-productive states.

This is done by calling NonDeterministicFiniteAutomata::productive_states and performing a diference against the full state set.

#[must_use]
pub fn useful_states(&self) -> HashSet<State>
[src]

Compute the automata useful states.

#[must_use]
pub fn non_useful_states(&self) -> HashSet<State>
[src]

Compute the automata non-useful states.

This is done by calling NonDeterministicFiniteAutomata::useful_states and performing a diference against the full state set.

Trait Implementations

impl<State: Clone, Transition: Clone> Clone for NonDeterministicFiniteAutomata<State, Transition> where
    State: Eq + Hash + Clone,
    Transition: Eq + Hash + Clone
[src]

impl<State: Debug, Transition: Debug> Debug for NonDeterministicFiniteAutomata<State, Transition> where
    State: Eq + Hash + Clone,
    Transition: Eq + Hash + Clone
[src]

impl<State, Transition> Default for NonDeterministicFiniteAutomata<State, Transition> where
    State: Eq + Hash + Clone,
    Transition: Eq + Hash + Clone
[src]

Implementation of the Default trait for a NonDeterministicFiniteAutomata.

fn default() -> Self[src]

This function is equivalent to NonDeterministicFiniteAutomata::new.

Auto Trait Implementations

impl<State, Transition> RefUnwindSafe for NonDeterministicFiniteAutomata<State, Transition> where
    State: RefUnwindSafe,
    Transition: RefUnwindSafe

impl<State, Transition> Send for NonDeterministicFiniteAutomata<State, Transition> where
    State: Send,
    Transition: Send

impl<State, Transition> Sync for NonDeterministicFiniteAutomata<State, Transition> where
    State: Sync,
    Transition: Sync

impl<State, Transition> Unpin for NonDeterministicFiniteAutomata<State, Transition> where
    State: Unpin,
    Transition: Unpin

impl<State, Transition> UnwindSafe for NonDeterministicFiniteAutomata<State, Transition> where
    State: UnwindSafe,
    Transition: UnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.