pub struct NodeIt<ID>(/* private fields */);
Expand description
A graph iterator over all nodes of a linked list graph.
Trait Implementations§
Source§impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NodeIt<ID>
impl<ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NodeIt<ID>
type Item = Node<ID>
fn next(&mut self, _g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>
fn size_hint(&self, _g: &LinkedListGraph<ID, N, E>) -> (usize, Option<usize>)
fn count(self, _g: &LinkedListGraph<ID, N, E>) -> usize
fn iter(self, g: &G) -> GraphIter<'_, G, Self> ⓘwhere
G: Sized,
Auto Trait Implementations§
impl<ID> Freeze for NodeIt<ID>where
ID: Freeze,
impl<ID> RefUnwindSafe for NodeIt<ID>where
ID: RefUnwindSafe,
impl<ID> Send for NodeIt<ID>where
ID: Send,
impl<ID> Sync for NodeIt<ID>where
ID: Sync,
impl<ID> Unpin for NodeIt<ID>where
ID: Unpin,
impl<ID> UnwindSafe for NodeIt<ID>where
ID: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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