enum NodeState<N, S> {
    NotVisited,
    BeingVisited {
        depth: usize,
    },
    InCycle {
        scc_index: S,
    },
    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

Fields

§depth: usize

This node is currently being walk as part of our DFS. It is on the stack at the depth depth.

After SCC construction is complete, this state ought to be impossible.

§

InCycle

Fields

§scc_index: S

Indicates that this node is a member of the given cycle.

§

InCycleWith

Fields

§parent: N

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).

Trait Implementations§

source§

impl<N: Clone, S: Clone> Clone for NodeState<N, S>

source§

fn clone(&self) -> NodeState<N, S>

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl<N: Debug, S: Debug> Debug for NodeState<N, S>

source§

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

Formats the value using the given formatter. Read more
source§

impl<N: Copy, S: Copy> Copy for NodeState<N, S>

Auto Trait Implementations§

§

impl<N, S> RefUnwindSafe for NodeState<N, S>where N: RefUnwindSafe, S: RefUnwindSafe,

§

impl<N, S> Send for NodeState<N, S>where N: Send, S: Send,

§

impl<N, S> Sync for NodeState<N, S>where N: Sync, S: Sync,

§

impl<N, S> Unpin for NodeState<N, S>where N: Unpin, S: Unpin,

§

impl<N, S> UnwindSafe for NodeState<N, S>where N: UnwindSafe, S: UnwindSafe,

Blanket Implementations§

source§

impl<T> Aligned for T

source§

const ALIGN: Alignment = const ALIGN: Alignment = Alignment::of::<Self>();

Alignment of Self.
source§

impl<T> Any for Twhere T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for Twhere T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for Twhere T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for Twhere U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> ToOwned for Twhere T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for Twhere U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for Twhere U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
source§

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.