Struct rustc_data_structures::graph::iterate::CycleDetector
source · [−]pub struct CycleDetector;Expand description
This TriColorVisitor looks for back edges in a graph, which indicate that a cycle exists.
Trait Implementations
sourceimpl<G> TriColorVisitor<G> for CycleDetectorwhere
G: ?Sized + DirectedGraph,
impl<G> TriColorVisitor<G> for CycleDetectorwhere
G: ?Sized + DirectedGraph,
sourcefn node_examined(
&mut self,
_node: G::Node,
prior_status: Option<NodeStatus>
) -> ControlFlow<Self::BreakVal>
fn node_examined(
&mut self,
_node: G::Node,
prior_status: Option<NodeStatus>
) -> ControlFlow<Self::BreakVal>
Called when a node is examined by the depth-first search. Read more
sourcefn node_settled(&mut self, _node: G::Node) -> ControlFlow<Self::BreakVal>
fn node_settled(&mut self, _node: G::Node) -> ControlFlow<Self::BreakVal>
Called after all nodes reachable from this one have been examined.
sourcefn ignore_edge(&mut self, _source: G::Node, _target: G::Node) -> bool
fn ignore_edge(&mut self, _source: G::Node, _target: G::Node) -> bool
Behave as if no edges exist from
source to target.Auto Trait Implementations
impl RefUnwindSafe for CycleDetector
impl Send for CycleDetector
impl Sync for CycleDetector
impl Unpin for CycleDetector
impl UnwindSafe for CycleDetector
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<'a, T> Captures<'a> for Twhere
T: ?Sized,
impl<T> Erased for T
Layout
Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.
Size: 0 bytes