Struct Nfa

pub(crate) struct Nfa<R>
where
    R: Ref,
{
    pub(crate) transitions: FxIndexMap<State, FxIndexMap<Transition<R>, FxIndexSet<State>>>,
    pub(crate) start: State,
    pub(crate) accepting: State,
}

A non-deterministic finite automaton (NFA) that represents the layout of a type. The transmutability of two given types is computed by comparing their Nfas.

Fields

transitions: FxIndexMap<State, FxIndexMap<Transition<R>, FxIndexSet<State>>>

start: State

accepting: State

Implementations

impl<R> Nfa<R>

where R: Ref,

pub(crate) fn unit() -> Self

pub(crate) fn from_byte(byte: Byte) -> Self

pub(crate) fn from_ref(r: R) -> Self

pub(crate) fn from_tree(tree: Tree<!, R>) -> Result<Self, Uninhabited>

pub(crate) fn concat(self, other: Self) -> Self

Concatenate two Nfas.

pub(crate) fn union(self, other: Self) -> Self

Compute the union of two Nfas.

pub(crate) fn edges_from( &self, start: State, ) -> Option<&Map<Transition<R>, Set<State>>>

Trait Implementations

impl<R> Debug for Nfa<R>

where R: Ref + Debug,

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

Formats the value using the given formatter.

impl<R> PartialEq for Nfa<R>

where R: Ref + PartialEq,

fn eq(&self, other: &Nfa<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> StructuralPartialEq for Nfa<R>

where R: Ref,

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference's “Type Layout” chapter for details on type layout guarantees.

Size: 64 bytes