Struct rustc_data_structures::graph::scc::VisitingNodeFrame
source · struct VisitingNodeFrame<G: DirectedGraph, Successors> {
node: G::Node,
iter: Option<Successors>,
depth: usize,
min_depth: usize,
successors_len: usize,
min_cycle_root: G::Node,
successor_node: G::Node,
}Fields§
§node: G::Node§iter: Option<Successors>§depth: usize§min_depth: usize§successors_len: usize§min_cycle_root: G::Node§successor_node: G::NodeAuto Trait Implementations§
impl<G, Successors> RefUnwindSafe for VisitingNodeFrame<G, Successors>where
Successors: RefUnwindSafe,
<G as DirectedGraph>::Node: RefUnwindSafe,
impl<G, Successors> Send for VisitingNodeFrame<G, Successors>where
Successors: Send,
<G as DirectedGraph>::Node: Send,
impl<G, Successors> Sync for VisitingNodeFrame<G, Successors>where
Successors: Sync,
<G as DirectedGraph>::Node: Sync,
impl<G, Successors> Unpin for VisitingNodeFrame<G, Successors>where
Successors: Unpin,
<G as DirectedGraph>::Node: Unpin,
impl<G, Successors> UnwindSafe for VisitingNodeFrame<G, Successors>where
Successors: UnwindSafe,
<G as DirectedGraph>::Node: UnwindSafe,
Blanket Implementations§
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> Erased 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.