Struct EdgeSet

pub(super) struct EdgeSet<S = State> {
    runs: SmallVec<[(Byte, S); 1]>,
}

The set of outbound byte edges associated with a DFA node.

Fields

runs: SmallVec<[(Byte, S); 1]>

Implementations

impl<S> EdgeSet<S>

pub(crate) fn new(range: Byte, dst: S) -> Self

pub(crate) fn empty() -> Self

pub(crate) fn iter(&self) -> impl Iterator<Item = (Byte, S)>

where S: Copy,

pub(crate) fn get_uninit_edge_dst(&self) -> Option<S>

where S: Copy,

pub(crate) fn map_states<SS>(self, f: impl FnMut(S) -> SS) -> EdgeSet<SS>

pub(crate) fn union( &self, other: &Self, join: impl FnMut(Option<S>, Option<S>) -> S, ) -> EdgeSet<S>

where S: Copy + Eq,

Unions two edge sets together.

If u = a.union(b), then for each byte value, u will have an edge with that byte value and with the destination join(Some(_), None), join(None, Some(_)), or join(Some(_), Some(_)) depending on whether a, b, or both have an edge with that byte value.

If neither a nor b have an edge with a particular byte value, then no edge with that value will be present in u.

Trait Implementations

impl<S: Clone> Clone for EdgeSet<S>

fn clone(&self) -> EdgeSet<S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<S: Debug> Debug for EdgeSet<S>

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

Formats the value using the given formatter.

impl<S: PartialEq> PartialEq for EdgeSet<S>

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

impl<S> StructuralPartialEq for EdgeSet<S>

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.