Struct regex_automata::nfa::thompson::Transition

pub struct Transition {
    pub start: u8,
    pub end: u8,
    pub next: StateID,
}

A single transition to another state.

This transition may only be followed if the current byte in the haystack falls in the inclusive range of bytes specified.

Fields

start: u8

The inclusive start of the byte range.

end: u8

The inclusive end of the byte range.

next: StateID

The identifier of the state to transition to.

Implementations

impl Transition

pub fn matches(&self, haystack: &[u8], at: usize) -> bool

Returns true if the position at in haystack falls in this transition’s range of bytes.

If at >= haystack.len(), then this returns false.

pub fn matches_unit(&self, unit: Unit) -> bool

Returns true if the given alphabet unit falls in this transition’s range of bytes. If the given unit is EOI, then this returns false.

pub fn matches_byte(&self, byte: u8) -> bool

Returns true if the given byte falls in this transition’s range of bytes.

Trait Implementations

impl Clone for Transition

fn clone(&self) -> Transition

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Transition

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

Formats the value using the given formatter.

impl Hash for Transition

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

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

impl Eq for Transition

impl StructuralPartialEq for Transition