Struct rs_graph::linkedlistgraph::Node
source · Expand description
Node of a linked list graph.
This is basically a newtype of the node index.
Trait Implementations
sourceimpl<ID: PartialEq> PartialEq<Node<ID>> for Node<ID>where
ID: PrimInt + Unsigned,
impl<ID: PartialEq> PartialEq<Node<ID>> for Node<ID>where
ID: PrimInt + Unsigned,
impl<ID: Copy> Copy for Node<ID>where
ID: PrimInt + Unsigned,
impl<ID: Eq> Eq for Node<ID>where
ID: PrimInt + Unsigned,
impl<ID> Node for Node<ID>where
ID: PrimInt + Unsigned,
impl<ID> StructuralEq for Node<ID>where
ID: PrimInt + Unsigned,
impl<ID> StructuralPartialEq for Node<ID>where
ID: PrimInt + Unsigned,
Auto Trait Implementations
impl<ID> RefUnwindSafe for Node<ID>where
ID: RefUnwindSafe,
impl<ID> Send for Node<ID>where
ID: Send,
impl<ID> Sync for Node<ID>where
ID: Sync,
impl<ID> Unpin for Node<ID>where
ID: Unpin,
impl<ID> UnwindSafe for Node<ID>where
ID: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more