Struct liblet::automaton::Transition

pub struct Transition<T> where
    T: Eq + Clone + Ord,  { /* fields omitted */ }

A transition data structure to help abstracting automaton transitions

It is used in the automatons to define a transition between two states:

• from
• to

Transitions are labeled.

States are defined as collections of Symbols. To define a transition between two symbols, simply use singleton collections.

Implementations

impl<T> Transition<T> where
    T: Eq + Clone + Ord, 

pub fn new<IF, IT>(from: IF, label: Symbol, to: IT) -> Transition<T> where
    IF: IntoIterator<Item = T>,
    IT: IntoIterator<Item = T>, 

Constructor for a new transition.

It takes the 3 fundamental details of a transition:

• the from collection
• the label of the transition
• the to collection

Examples

use liblet::automaton::Transition;
use liblet::symbol::symbol;

// here we define a transition of the form {A} --> "label" --> {B}
let t = Transition::new(vec![symbol("A")], symbol("label"), vec![symbol("B")]);

pub fn from(&self) -> BTreeSet<T>

Return the set of symbols which defines the from state of this transition.

Examples

use liblet::automaton::Transition;
use liblet::symbol::symbol;
use std::collections::BTreeSet;
use std::iter::FromIterator;

let t = Transition::new(vec![symbol("A")], symbol("label"), vec![symbol("B")]);

assert_eq!(t.from(), BTreeSet::from_iter(vec![symbol("A")]));

pub fn to(&self) -> BTreeSet<T>

Return the set of symbols which defines the to state of this transition.

Examples

use liblet::automaton::Transition;
use liblet::symbol::symbol;
use std::collections::BTreeSet;
use std::iter::FromIterator;

let t = Transition::new(vec![symbol("A")], symbol("label"), vec![symbol("B")]);

assert_eq!(t.to(), BTreeSet::from_iter(vec![symbol("B")]));

pub fn label(&self) -> Symbol

Return the label of this transition, if present.

Examples

use liblet::automaton::Transition;
use liblet::symbol::symbol;

let t = Transition::new(vec![symbol("A")], symbol("label"), vec![symbol("B")]);

assert_eq!(t.label(), symbol("label"));

impl Transition<Symbol>

pub fn from_string(
    string: &str
) -> Result<Vec<Transition<Symbol>>, TransitionError>

Construct a new transition from a string.

Errors

Can return a TokenizerError

Examples

use liblet::automaton::Transition;

// here we define a transition of the form {A1,A2} --> "label" --> {B1,B2}
let t = Transition::from_string("A1 A2 -> label -> B1 B2");

assert!(t.is_ok());

Trait Implementations

impl<T: Clone> Clone for Transition<T> where
    T: Eq + Clone + Ord, 

fn clone(&self) -> Transition<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for Transition<T> where
    T: Eq + Clone + Ord + Debug, 

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

Formats the value using the given formatter.

impl<'de, T> Deserialize<'de> for Transition<T> where
    T: Eq + Clone + Ord,
    T: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl Display for Transition<Symbol>

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

Formats the value using the given formatter.

impl<T: Eq> Eq for Transition<T> where
    T: Eq + Clone + Ord, 

impl<T: Hash> Hash for Transition<T> where
    T: Eq + Clone + Ord, 

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, 

Feeds a slice of this type into the given [Hasher].

impl<T: Ord> Ord for Transition<T> where
    T: Eq + Clone + Ord, 

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

This method returns an [Ordering] between self and other.

#[must_use]fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]fn clamp(self, min: Self, max: Self) -> Self

🔬 This is a nightly-only experimental API. (clamp)

Restrict a value to a certain interval.

impl<T: PartialEq> PartialEq<Transition<T>> for Transition<T> where
    T: Eq + Clone + Ord, 

fn eq(&self, other: &Transition<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Transition<T>) -> bool

This method tests for !=.

impl<T: PartialOrd> PartialOrd<Transition<T>> for Transition<T> where
    T: Eq + Clone + Ord, 

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

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

fn lt(&self, other: &Transition<T>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Transition<T>) -> bool

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

fn gt(&self, other: &Transition<T>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Transition<T>) -> bool

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

impl<T> Serialize for Transition<T> where
    T: Eq + Clone + Ord,
    T: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<T> StructuralEq for Transition<T> where
    T: Eq + Clone + Ord, 

impl<T> StructuralPartialEq for Transition<T> where
    T: Eq + Clone + Ord, 

impl<'_> TryFrom<&'_ str> for Transition<Symbol>

type Error = TransitionError

The type returned in the event of a conversion error.

fn try_from(value: &str) -> Result<Self, Self::Error>

Performs the conversion.