Struct Dfa 

pub struct Dfa {
    pub state_count: u32,
    pub transitions: Vec<u32>,
    pub start: u32,
    pub accept: Vec<bool>,
}

Deterministic finite automaton with a dense transition table.

Fields

state_count: u32

Total state count.

transitions: Vec<u32>

Transitions laid out row-major: transitions[state * 256 + byte]. Values equal to INVALID_STATE mean “no transition.”

start: u32

Start state id.

accept: Vec<bool>

Accept-state bitmap.

Implementations

impl Dfa

pub fn go(&self, state: u32, byte: u8) -> u32

Read the transition for (state, byte).

Returns INVALID_STATE when no transition is defined.

pub fn set(&mut self, state: u32, byte: u8, next: u32)

Write a transition for (state, byte).

Trait Implementations

impl Clone for Dfa

fn clone(&self) -> Dfa

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Dfa

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

Formats the value using the given formatter.

impl PartialEq for Dfa

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

impl StructuralPartialEq for Dfa