Enum Fsa 

pub enum Fsa {
    Dfa,
}

The type of the Finite State Automaton to be used.

Variants

Dfa

The Deterministic Finite Automaton. It is a deterministic finite automaton that eagerly computes all the state transitions. It is the fastest type of finite automaton, but it is also the most memory-consuming. In particular, construction time and space required could be exponential in the worst case.

Trait Implementations

impl Clone for Fsa

fn clone(&self) -> Fsa

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Fsa

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Fsa

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Hash for Fsa

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Fsa

fn eq(&self, other: &Fsa) -> 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 Serialize for Fsa

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl Copy for Fsa

impl Eq for Fsa

impl StructuralPartialEq for Fsa