Struct rs_graph::linkedlistgraph::Node
[−]
[src]
pub struct Node<ID = u32>(_)
where
ID: PrimInt + Unsigned;
Node of a linked list graph.
This is basically a newtype of the node index.
Methods
impl<ID> Node<ID> where
ID: PrimInt + Unsigned,
[src]
ID: PrimInt + Unsigned,
Trait Implementations
impl<ID: PartialEq> PartialEq for Node<ID> where
ID: PrimInt + Unsigned,
[src]
ID: PrimInt + Unsigned,
fn eq(&self, __arg_0: &Node<ID>) -> bool
[src]
This method tests for self
and other
values to be equal, and is used by ==
. Read more
fn ne(&self, __arg_0: &Node<ID>) -> bool
[src]
This method tests for !=
.
impl<ID: Eq> Eq for Node<ID> where
ID: PrimInt + Unsigned,
[src]
ID: PrimInt + Unsigned,
impl<ID: Clone> Clone for Node<ID> where
ID: PrimInt + Unsigned,
[src]
ID: PrimInt + Unsigned,
fn clone(&self) -> Node<ID>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<ID: Copy> Copy for Node<ID> where
ID: PrimInt + Unsigned,
[src]
ID: PrimInt + Unsigned,
impl<ID: Debug> Debug for Node<ID> where
ID: PrimInt + Unsigned,
[src]
ID: PrimInt + Unsigned,
impl<ID: Hash> Hash for Node<ID> where
ID: PrimInt + Unsigned,
[src]
ID: PrimInt + Unsigned,
fn hash<__HID: Hasher>(&self, __arg_0: &mut __HID)
[src]
Feeds this value into the given [Hasher
]. Read more
fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,
1.3.0[src]
H: Hasher,
Feeds a slice of this type into the given [Hasher
]. Read more
impl<ID> Node for Node<ID> where
ID: PrimInt + Unsigned,
[src]
ID: PrimInt + Unsigned,
impl<ID> Display for Node<ID> where
ID: PrimInt + Unsigned + Display,
[src]
ID: PrimInt + Unsigned + Display,