CycleDetector

solar_data_structures::cycle

Struct CycleDetector 

Source 
pub struct CycleDetector<Cx, T, B> { /* private fields */ }
Expand description

Detector for cycles in directed graphs.

Implementations§

Source§

impl<Cx: Copy, T: Copy + Eq + Hash, B> CycleDetector<Cx, T, B>

Source

pub fn detect( cx: Cx, vertex: T, f: fn(Cx, &mut CycleDetector<Cx, T, B>, T) -> CycleDetectorResult<B, T>, ) -> CycleDetectorResult<B, T>

Creates a new cycle detector and runs it on the given vertex.

Returns Err if a cycle is detected, containing the first vertex in the cycle.

Source

pub fn new( cx: Cx, f: fn(Cx, &mut CycleDetector<Cx, T, B>, T) -> CycleDetectorResult<B, T>, ) -> Self

Creates a new cycle detector.

Source

pub fn run(&mut self, vertex: T) -> CycleDetectorResult<B, T>

Runs the cycle detector on the given vertex.

Returns Err if a cycle is detected, containing the first vertex in the cycle.

Source

pub fn depth(&self) -> usize

Returns the current depth.

Auto Trait Implementations§

§

impl<Cx, T, B> Freeze for CycleDetector<Cx, T, B>
where Cx: Freeze, T: Freeze,

§

impl<Cx, T, B> RefUnwindSafe for CycleDetector<Cx, T, B>
where Cx: RefUnwindSafe, T: RefUnwindSafe,

§

impl<Cx, T, B> Send for CycleDetector<Cx, T, B>
where Cx: Send, T: Send,

§

impl<Cx, T, B> Sync for CycleDetector<Cx, T, B>
where Cx: Sync, T: Sync,

§

impl<Cx, T, B> Unpin for CycleDetector<Cx, T, B>
where Cx: Unpin, T: Unpin,

§

impl<Cx, T, B> UnwindSafe for CycleDetector<Cx, T, B>
where Cx: UnwindSafe, T: UnwindSafe,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T, R> CollectAndApply<T, R> for T

Source§

fn collect_and_apply<I, F>(iter: I, f: F) -> R
where I: Iterator<Item = T>, F: FnOnce(&[T]) -> R,

Equivalent to f(&iter.collect::<Vec<_>>()).

Source§

type Output = R

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where 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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

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

Source§

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 T
where U: TryFrom<T>,

Source§

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.

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.