Struct Automaton

pub struct Automaton<F, Q: State, L: Label> { /* private fields */ }

Tree automaton.

Implementations

impl<F: Symbol, Q: State, L: Label> Automaton<F, Q, L>

pub fn new() -> Automaton<F, Q, L>

Create a new empty automaton.

pub fn len(&self) -> usize

Return the number of states in the automaton.

pub fn states(&self) -> States<'_, F, Q, L>

pub fn final_states(&self) -> Iter<'_, Q>

Return an iterator to the final states of the automaton.

pub fn set_final(&mut self, q: Q) -> bool

Set the given state a final state. Return true if the state was not already final. Return false if the state was already a final state.

pub fn includes(&self, q: &Q) -> bool

Checks if the given state is in the automaton. Return true if at least one configuration is attached to the state in the automaton.

pub fn transitions(&self) -> Transifions<'_, F, Q, L>

pub fn configurations_for_state(&self, q: &Q) -> Configurations<'_, F, Q, L>

Return an iterator over the configurations connected to the given state.

pub fn states_for_configuration( &self, conf: &Configuration<F, Q>, ) -> Iter<'_, Labeled<Q, L>>

Return an iterator over the states connected to the given configuration.

pub fn add(&mut self, conf: Configuration<F, Q>, label: L, state: Q)

Add a new transition to the automaton.

pub fn add_normalized<P: PatternLike<F, Q>, N>( &mut self, pattern: &P, normalizer: &mut N, ) -> Q

where N: FnMut(&Configuration<F, Q>) -> Labeled<Q, L>,

Add new transitions in the automaton by adding and normalizing the given configuration, label and state.

pub fn common_configurations<'a>( automata: &'a [&'a Automaton<F, Q, L>], positions: &'a [Q], ) -> CommonConfigurations<'a, F, Q, L>

Automata common configurations.

pub fn representatives(&self) -> Representatives<'_, F, Q, L>

Return an iterator over the representative terms of the automaton. The representatives terms are all the terms recognized by the automaton without cycle. Together they trigger every transition of the automaton.

pub fn complement(&mut self)

Complement the automaton. This will invert the set of final and non-final states. If the automaton is complete, then self becomes its own complement.

pub fn alphabet(&self) -> HashSet<F>

Return the alphabet on which this automaton is defined.

pub fn map_states<R: State, M>(&self, g: M) -> Automaton<F, R, L>

where M: Fn(&Q) -> R,

impl<F: Symbol, Q: State> Automaton<F, Q, NoLabel>

pub fn complete_with<'a, A: Iterator<Item = &'a F>, R>( &mut self, alphabet: A, lang: &Automaton<F, R, NoLabel>, )

where F: 'a + Ranked, R: From<Q> + State, Q: From<R>,

Complete the language with the given automaton. Each state of self must be mappable into a state of lang, and each state of lang must be transformed into a dead state of self.

Trait Implementations

impl<F: Clone, Q: Clone + State, L: Clone + Label> Clone for Automaton<F, Q, L>

fn clone(&self) -> Automaton<F, Q, L>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<F: Symbol + Display, Q: State + Display, L: Label + Display> Display for Automaton<F, Q, L>

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

Formats the value using the given formatter.

impl<'a, F: Symbol, Q: State, L: Label> From<&'a Automaton<F, Q, L>> for Automaton<F, Q, u32>

fn from(bottom_up: &'a Automaton<F, Q, L>) -> Automaton<F, Q, u32>

Converts to this type from the input type.

impl<'a, F: Symbol, E, Q: LanguageState<F, E>> From<(Q, &'a E)> for Automaton<F, Q, NoLabel>

fn from((q, env): (Q, &'a E)) -> Automaton<F, Q, NoLabel>

Converts to this type from the input type.

impl<'a, F: Symbol, Q: LanguageState<F, ()>> From<Q> for Automaton<F, Q, NoLabel>

fn from(q: Q) -> Automaton<F, Q, NoLabel>

Converts to this type from the input type.

impl<F: Symbol, Q: State, L: Label> Language<F> for Automaton<F, Q, L>