Struct rs_graph::linkedlistgraph::NeighIt [−][src]
pub struct NeighIt<ID>(_);
Graph iterator over edges incident with some node.
Trait Implementations
impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID> where
ID: 'a + PrimInt + Unsigned, [src]
impl<'a, ID, N, E> GraphIterator<LinkedListGraph<ID, N, E>> for NeighIt<ID> where
ID: 'a + PrimInt + Unsigned, [src]Auto Trait Implementations
impl<ID> RefUnwindSafe for NeighIt<ID> where
ID: RefUnwindSafe,
ID: RefUnwindSafe,
impl<ID> Send for NeighIt<ID> where
ID: Send,
ID: Send,
impl<ID> Sync for NeighIt<ID> where
ID: Sync,
ID: Sync,
impl<ID> Unpin for NeighIt<ID> where
ID: Unpin,
ID: Unpin,
impl<ID> UnwindSafe for NeighIt<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