Struct rs_graph::linkedlistgraph::EdgeIt [−][src]
pub struct EdgeIt<ID>(_);
An iterator over all edges of a linked list graph.
This iterator only returns the forward edges.
Trait Implementations
impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for EdgeIt<ID> where
ID: 'a + PrimInt + Unsigned, [src]
impl<'a, ID, N: 'a, E: 'a> GraphIterator<LinkedListGraph<ID, N, E>> for EdgeIt<ID> where
ID: 'a + PrimInt + Unsigned, [src]type Item = Edge<ID>
fn next(&mut self, _g: &LinkedListGraph<ID, N, E>) -> Option<Self::Item>[src]
fn size_hint(&self, _g: &LinkedListGraph<ID, N, E>) -> (usize, Option<usize>)[src]
fn count(self, _g: &LinkedListGraph<ID, N, E>) -> usize[src]
fn iter<'a>(self, g: &'a G) -> GraphIter<'a, G, Self>ⓘ where
G: Sized, [src]
G: Sized,
Auto Trait Implementations
impl<ID> RefUnwindSafe for EdgeIt<ID> where
ID: RefUnwindSafe,
ID: RefUnwindSafe,
impl<ID> Send for EdgeIt<ID> where
ID: Send,
ID: Send,
impl<ID> Sync for EdgeIt<ID> where
ID: Sync,
ID: Sync,
impl<ID> Unpin for EdgeIt<ID> where
ID: Unpin,
ID: Unpin,
impl<ID> UnwindSafe for EdgeIt<ID> where
ID: UnwindSafe,
ID: UnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]
impl<T> BorrowMut<T> for T where
T: ?Sized, [src]pub fn borrow_mut(&mut self) -> &mut T[src]
pub fn borrow_mut(&mut self) -> &mut T[src]Mutably borrows from an owned value. Read more
impl<T> ToOwned for T where
T: Clone, [src]
impl<T> ToOwned for T where
T: Clone, [src]type Owned = T
type Owned = TThe resulting type after obtaining ownership.
pub fn to_owned(&self) -> T[src]
pub fn to_owned(&self) -> T[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)[src]
pub fn clone_into(&self, target: &mut T)[src]🔬 This is a nightly-only experimental API. (toowned_clone_into)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more