pub(super) struct EdgeSet<S = State> {
runs: SmallVec<[(Byte, S); 1]>,
}
Expand description
The set of outbound byte edges associated with a DFA node.
Fields§
§runs: SmallVec<[(Byte, S); 1]>
Implementations§
Source§impl<S> EdgeSet<S>
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>
Sourcepub(crate) fn union(
&self,
other: &Self,
join: impl FnMut(Option<S>, Option<S>) -> S,
) -> EdgeSet<S>
pub(crate) fn union( &self, other: &Self, join: impl FnMut(Option<S>, Option<S>) -> S, ) -> EdgeSet<S>
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: Eq> Eq for EdgeSet<S>
impl<S> StructuralPartialEq for EdgeSet<S>
Auto Trait Implementations§
impl<S> DynSend for EdgeSet<S>where
S: DynSend,
impl<S> DynSync for EdgeSet<S>where
S: DynSync,
impl<S> Freeze for EdgeSet<S>where
S: Freeze,
impl<S> RefUnwindSafe for EdgeSet<S>where
S: RefUnwindSafe,
impl<S> Send for EdgeSet<S>where
S: Send,
impl<S> Sync for EdgeSet<S>where
S: Sync,
impl<S> Unpin for EdgeSet<S>where
S: Unpin,
impl<S> UnwindSafe for EdgeSet<S>where
S: RefUnwindSafe + UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T, R> CollectAndApply<T, R> for T
impl<T, R> CollectAndApply<T, R> for T
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.Source§impl<T> Filterable for T
impl<T> Filterable for T
Source§fn filterable(
self,
filter_name: &'static str,
) -> RequestFilterDataProvider<T, fn(DataRequest<'_>) -> bool>
fn filterable( self, filter_name: &'static str, ) -> RequestFilterDataProvider<T, fn(DataRequest<'_>) -> bool>
Creates a filterable data provider with the given name for debugging. Read more
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§impl<P> IntoQueryParam<P> for P
impl<P> IntoQueryParam<P> for P
fn into_query_param(self) -> P
Source§impl<T> MaybeResult<T> for T
impl<T> MaybeResult<T> for T
Source§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
impl<I, T, U> Upcast<I, U> for Twhere
U: UpcastFrom<I, T>,
Source§impl<I, T> UpcastFrom<I, T> for T
impl<I, T> UpcastFrom<I, T> for T
fn upcast_from(from: T, _tcx: I) -> T
Source§impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
impl<Tcx, T> Value<Tcx> for Twhere
Tcx: DepContext,
default fn from_cycle_error( tcx: Tcx, cycle_error: &CycleError, _guar: ErrorGuaranteed, ) -> T
Source§impl<T> WithSubscriber for T
impl<T> WithSubscriber for T
Source§fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
Source§fn with_current_subscriber(self) -> WithDispatch<Self>
fn with_current_subscriber(self) -> WithDispatch<Self>
impl<T> ErasedDestructor for Twhere
T: 'static,
impl<T> MaybeSendSync for T
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.