[−][src]Struct rustc_ap_rustc_data_structures::graph::iterate::CycleDetector
This TriColorVisitor looks for back edges in a graph, which indicate that a cycle exists.
Trait Implementations
impl<G: ?Sized> TriColorVisitor<G> for CycleDetector where
G: DirectedGraph, [src]
G: DirectedGraph,
type BreakVal = ()
The value returned by this search.
fn node_examined(
&mut self,
_node: G::Node,
prior_status: Option<NodeStatus>
) -> ControlFlow<Self::BreakVal>[src]
&mut self,
_node: G::Node,
prior_status: Option<NodeStatus>
) -> ControlFlow<Self::BreakVal>
fn node_settled(&mut self, _node: G::Node) -> ControlFlow<Self::BreakVal>[src]
fn ignore_edge(&mut self, _source: G::Node, _target: G::Node) -> bool[src]
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
impl<T> Any for T where
T: 'static + ?Sized, [src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T[src]
impl<'a, T> Captures<'a> for T where
T: ?Sized, [src]
T: ?Sized,
impl<T> Erased for T[src]
impl<T> From<T> for T[src]
impl<T, U> Into<U> for T where
U: From<T>, [src]
U: From<T>,
impl<E> SpecializationError for E[src]
default fn not_found<S, T>(
trait_name: &'static str,
method_name: &'static str
) -> E where
T: ?Sized, [src]
trait_name: &'static str,
method_name: &'static str
) -> E where
T: ?Sized,
impl<T, U> TryFrom<U> for T where
U: Into<T>, [src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>, [src]
U: TryFrom<T>,