Struct debris_common::graph::GraphLoopDetector

source · 
pub struct GraphLoopDetector {
    to_visit: FxHashSet<u32>,
    visited: FxHashSet<u32>,
}
Expand description

Detects loops in a graph. This is a custom struct in order to save on allocations in hot code.

Fields§

§to_visit: FxHashSet<u32>§visited: FxHashSet<u32>

Implementations§

source§

impl GraphLoopDetector

source

pub fn has_loop<T>(&mut self, graph: &GraphMatrix<T>, node: u32) -> bool

Returns true if the graph has a loop which is reachable from node.

Trait Implementations§

source§

impl Default for GraphLoopDetector

source§

fn default() -> GraphLoopDetector

Returns the “default value” for a type. Read more

Auto Trait Implementations§

Blanket Implementations§

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