Enum Transition

pub(crate) enum Transition<R>
where
    R: Ref,
{
    Byte(Byte),
    Ref(R),
}

The transitions between states in a Nfa reflect bit validity.

Variants

Byte(Byte)

Ref(R)

Trait Implementations

impl<R> Clone for Transition<R>

where R: Ref + Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<R> Debug for Transition<R>

where R: Ref,

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

Formats the value using the given formatter.

impl<R> From<Transition<R>> for Transition<R>

where R: Ref,

fn from(nfa_transition: Transition<R>) -> Self

Converts to this type from the input type.

impl<R> Hash for Transition<R>

where R: Ref + Hash,

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<R> PartialEq for Transition<R>

where R: Ref + PartialEq,

fn eq(&self, other: &Transition<R>) -> 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<R> Copy for Transition<R>

where R: Ref + Copy,

impl<R> Eq for Transition<R>

where R: Ref + Eq,

impl<R> StructuralPartialEq for Transition<R>

where R: Ref,

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.