Struct InnerAutomata 

pub struct InnerAutomata<'a, T, V>
where
    T: Eq + Hash + Clone,
{ /* private fields */ }

Internal data structure for automaton management

Implementations

impl<'a, T, V> InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone,

pub fn dfs( &self, order: Vec<RefState<'a, T, V>>, backward: bool, ) -> DFSInfo<RefState<'a, T, V>>

Returns the depth first search information. This route is done with the follows if “backward” is false and otherwise with the previous

impl<'a, T, V> InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone,

pub fn get_door(&self) -> Vec<Vec<(RefState<'a, T, V>, DoorType)>>

Returns the result of the kosaraju algorithm on the automaton, i.e. the set of strongly connected components. Where each element of the strongly connected components is a pair between the reference of the state and the type of gate it is.

impl<'a, T, V> InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone + Display, V: Display,

pub fn to_dot(&self, inverse: bool) -> Result<String, Error>

Returns the DOT representation of the automaton with inverted colors if “inverse” is true

impl<'a, T, V> InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone,

pub fn is_standard(&self) -> bool

Returns if the automaton is standard

pub fn is_deterministic(&self) -> bool

Returns if the automaton is deterministic

pub fn is_fully_deterministic(&self) -> bool

Returns if the automaton is fully deterministic

pub fn is_homogeneous(&self) -> bool

Returns if the automaton is homogeneous

pub fn is_accessible(&self) -> bool

Returns if the automaton is accessible

pub fn is_coaccessible(&self) -> bool

Returns if the automaton is coaccessible

pub fn is_strongly_connected(&self) -> bool

Returns whether the automaton is strongly connected

pub fn is_orbit(&self) -> bool

Returns whether the automaton is a orbit

pub fn is_stable(&self) -> bool

Returns whether the orbit is stable

pub fn is_strongly_stable(&self) -> bool

where V: Clone + Eq,

Returns whether the orbit is strongly stable

pub fn is_transverse(&self) -> bool

Returns whether the orbit is transverse

pub fn is_strongly_transverse(&self) -> bool

where V: Clone + Eq,

Returns whether the orbit is strongly transverse

impl<'a, T, V> InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone,

pub fn kosaraju(&self) -> Vec<Vec<RefState<'a, T, V>>>

Returns the result of the kosaraju algorithm on the graph, the set of strongly connected components.

pub fn extract_scc(&self) -> Vec<InnerAutomata<'a, T, V>>

Returns the automata representing the strongly connected components of the automaton

impl<'a, T, V> InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone, V: Eq + Clone,

pub fn homogenize(&self) -> InnerAutomata<'a, T, Couple<Union<T, Epsilon>, V>>

Creates a homogeneous automaton that recognizes the same language as the current automaton

impl<'a, T, V> InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone,

pub fn new() -> Self

Returns an empty automaton

pub fn create( states: HashSet<RefState<'a, T, V>>, inputs: HashSet<RefState<'a, T, V>>, outputs: HashSet<RefState<'a, T, V>>, ) -> Self

Return the automate composed of “state”“ states with “inputs”“ and “outputs” as inputs and outputs, respectively

pub fn states_count(&self) -> usize

Returns the number of states

pub fn inputs_count(&self) -> usize

Returns the number of inputs

pub fn is_input(&self, value: &RefState<'a, T, V>) -> bool

Returns if the state referenced by “value” is an input

pub fn outputs_count(&self) -> usize

Returns the number of outputs

pub fn is_output(&self, value: &RefState<'a, T, V>) -> bool

Returns if the state referenced by “value” is an output

pub fn states(&self) -> impl Iterator<Item = &RefState<'a, T, V>>

An iterator visiting all states in arbitrary order. The iterator element type is &RefState<T, V>

pub fn inputs(&self) -> impl Iterator<Item = &RefState<'a, T, V>>

An iterator visiting all inputs in arbitrary order. The iterator element type is &RefState<T, V>

pub fn outputs(&self) -> impl Iterator<Item = &RefState<'a, T, V>>

An iterator visiting all outputs in arbitrary order. The iterator element type is &RefState<T, V>

pub fn add_state(&mut self, value: RefState<'a, T, V>) -> bool

Adds a state to the set of states.

Returns whether the value was newly inserted. That is:

• If the set did not previously contain this state, true is returned
• If the set already contained this state, false is returned, and the set is not modified: original state is not replaced, and the state passed as argument is dropped

pub fn add_input(&mut self, value: RefState<'a, T, V>) -> bool

Adds a state to the set of inputs.

Returns whether the value was newly inserted. That is:

• If the set did not previously contain this state, true is returned
• If the set already contained this state, false is returned, and the set is not modified: original state is not replaced, and the state passed as argument is dropped

pub fn add_output(&mut self, value: RefState<'a, T, V>) -> bool

Adds a state to the set of outputs.

Returns whether the value was newly inserted. That is:

• If the set did not previously contain this state, true is returned
• If the set already contained this state, false is returned, and the set is not modified: original state is not replaced, and the state passed as argument is dropped

pub fn remove_state(&mut self, value: &RefState<'a, T, V>) -> bool

Removes a state from the set of states. Returns whether the state was present in the set.

pub fn remove_input(&mut self, value: &RefState<'a, T, V>) -> bool

Removes a input from the set of states. Returns whether the input was present in the set.

pub fn remove_output(&mut self, value: &RefState<'a, T, V>) -> bool

Removes a output from the set of states. Returns whether the output was present in the set.

pub fn mirror(&mut self)

Transform the automaton into its mirror

impl<'a, T, V> InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone, V: Eq,

pub fn get_state(&self, value: &V) -> Option<RefState<'a, T, V>>

Returns the state reference with the value “value”.

pub fn get_input(&self, value: &V) -> Option<RefState<'a, T, V>>

Returns the input reference with the value “value”.

pub fn get_output(&self, value: &V) -> Option<RefState<'a, T, V>>

Returns the output reference with the value “value”.

Trait Implementations

impl<'a, T, V> Clone for InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone, V: Eq + Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<'a, T, V: Debug> Debug for InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone + Debug,

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

Formats the value using the given formatter.

impl<'a, T, V> Default for InnerAutomata<'a, T, V>

where T: Eq + Hash + Clone,

fn default() -> Self

Returns the “default value” for a type.

impl<'de, 'a, T, V> Deserialize<'de> for InnerAutomata<'a, T, V>

where T: Deserialize<'de> + Eq + Hash + Clone + 'a, V: Deserialize<'de> + Eq + 'a,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<'a, T, V> Serialize for InnerAutomata<'a, T, V>

where T: Serialize + Eq + Hash + Clone, V: Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.