Enum State 

pub enum State {
    Nfa(State),
    IbMatcher {
        matcher: IbMatcher<'static>,
        next: StateID,
    },
    Callback {
        callback: Callback,
        next: StateID,
    },
}

Available on crate features regex-automata and regex-nfa only.

A state in an NFA.

In theory, it can help to conceptualize an NFA as a graph consisting of States. Each State contains its complete set of outgoing transitions.

In practice, it can help to conceptualize an NFA as a sequence of instructions for a virtual machine. Each State says what to do and where to go next.

Strictly speaking, the practical interpretation is the most correct one, because of the Capture state. Namely, a Capture state always forwards execution to another state unconditionally. Its only purpose is to cause a side effect: the recording of the current input position at a particular location in memory. In this sense, an NFA has more power than a theoretical non-deterministic finite automaton.

For most uses of this crate, it is likely that one may never even need to be aware of this type at all. The main use cases for looking at States directly are if you need to write your own search implementation or if you need to do some kind of analysis on the NFA.

Variants

Nfa(State)

IbMatcher

Fields

matcher: IbMatcher<'static>

next: StateID

Callback

Available on crate feature regex-callback only.

Fields

callback: Callback

next: StateID

Trait Implementations

impl Debug for State

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

Formats the value using the given formatter.

impl From<State> for State

fn from(state: State) -> Self

Converts to this type from the input type.