Struct NonDeterministic

Source

pub struct NonDeterministic<T> { /* private fields */ }

Expand description

A graph traversal that does not guarantee any particular order, and may not return the same order every time it is run.

Implementations§

Source §

impl<T> NonDeterministic<T>

Source

pub fn new() -> Self

Trait Implementations§

Source §

impl<T> Default for NonDeterministic<T>

Source §

fn default() -> Self

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

Source §

fn insert( &mut self, _from_handle: Option<Self::Handle>, node: GraphNode<T>, ) -> Option<(Self::Handle, &T)>

Inserts a node into the graph store, and returns a handle to it. Read more

Source §

impl<T> IntoIterator for NonDeterministic<T>

Source §

type Item = T

The type of the elements being iterated over.

Source §

type IntoIter = <Vec<T> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

Source §

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value. Read more

Auto Trait Implementations§

§

impl<T> Freeze for NonDeterministic<T>

§

impl<T> RefUnwindSafe for NonDeterministic<T>
where T: RefUnwindSafe,

§

impl<T> Send for NonDeterministic<T>
where T: Send,

§

impl<T> Sync for NonDeterministic<T>
where T: Sync,

§

impl<T> Unpin for NonDeterministic<T>
where T: Unpin,

§

impl<T> UnwindSafe for NonDeterministic<T>
where 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

§

impl<T> Any for T
where T: Any,

§

fn get_type_id(&self) -> TypeId

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> From<T> for T

Source §

fn from(t: T) -> T

Returns the argument unchanged.

Source §

impl<Store> GraphTraversal for Store
where Store: GraphStore,

Source §

fn visit<VisitImpl, Abort, Impl>( self, root_edges: impl IntoIterator<Item = <VisitImpl as Visit<<Store as GraphStore>::Node, Abort, Impl>>::Edge>, visit: VisitImpl, ) -> impl Future<Output = GraphTraversalResult<Result<Store, Error>, Abort>> + Send
where VisitImpl: Visit<<Store as GraphStore>::Node, Abort, Impl> + Send, Abort: Send, Impl: Send,

Visits the graph starting from the given roots, and returns a future that will resolve to the traversal result.

Source §

fn skip_duplicates(self) -> SkipDuplicates<Store>

Source §

fn skip_duplicates_with_visited_nodes( self, visited: VisitedNodes<<Store as GraphStore>::Node>, ) -> SkipDuplicates<Store>

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided [Span], returning an Instrumented wrapper. Read more

§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more

Source §

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

§