Enum rustc_data_structures::graph::scc::NodeState
source · enum NodeState<N, S, A> {
NotVisited,
BeingVisited {
depth: usize,
annotation: A,
},
InCycle {
scc_index: S,
annotation: A,
},
InCycleWith {
parent: N,
},
}
Variants§
NotVisited
This node has not yet been visited as part of the DFS.
After SCC construction is complete, this state ought to be impossible.
BeingVisited
This node is currently being walked as part of our DFS. It is on
the stack at the depth depth
and its current annotation is
annotation
.
After SCC construction is complete, this state ought to be impossible.
InCycle
Indicates that this node is a member of the given cycle where
the merged annotation is annotation
.
Note that an SCC can have several cycles, so its final annotation
is the merged value of all its member annotations.
InCycleWith
Indicates that this node is a member of whatever cycle
parent
is a member of. This state is transient: whenever we
see it, we try to overwrite it with the current state of
parent
(this is the “path compression” step of a union-find
algorithm).
Fields
parent: N
Trait Implementations§
impl<N: Copy, S: Copy, A: Copy> Copy for NodeState<N, S, A>
Auto Trait Implementations§
impl<N, S, A> DynSend for NodeState<N, S, A>
impl<N, S, A> DynSync for NodeState<N, S, A>
impl<N, S, A> Freeze for NodeState<N, S, A>
impl<N, S, A> RefUnwindSafe for NodeState<N, S, A>
impl<N, S, A> Send for NodeState<N, S, A>
impl<N, S, A> Sync for NodeState<N, S, A>
impl<N, S, A> Unpin for NodeState<N, S, A>
impl<N, S, A> UnwindSafe for NodeState<N, S, A>
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
source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
clone_to_uninit
)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>
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>
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<T> Pointable for T
impl<T> Pointable for 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<'a, T> Captures<'a> for Twhere
T: ?Sized,
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.