Struct Dfa

pub(crate) struct Dfa<R>
where
    R: Ref,
{
    pub(crate) transitions: FxIndexMap<State, Transitions<R>>,
    pub(crate) start: State,
    pub(crate) accept: State,
}

Fields

transitions: FxIndexMap<State, Transitions<R>>

start: State

accept: State

Implementations

impl<R> Dfa<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

fn from_transitions(f: impl FnOnce(State) -> Transitions<R>) -> Self

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

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

Concatenate two Dfas.

pub(crate) fn union(self, other: Self, new_state: impl FnMut() -> State) -> Self

Compute the union of two Dfas.

pub(crate) fn get_uninit_edge_dst(&self, state: State) -> Option<State>

pub(crate) fn bytes_from( &self, start: State, ) -> impl Iterator<Item = (Byte, State)>

pub(crate) fn refs_from(&self, start: State) -> impl Iterator<Item = (R, State)>

Trait Implementations

impl<R> Debug for Dfa<R>

where R: Ref,

Serialize the DFA using the Graphviz DOT format.

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

Formats the value using the given formatter.

impl<R> PartialEq for Dfa<R>

where R: Ref + PartialEq,

fn eq(&self, other: &Dfa<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 Dfa<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