Struct rs_graph::linkedlistgraph::Node

pub struct Node<ID = u32>(_)
 where
    ID: PrimInt + Unsigned;

Node of a linked list graph.

This is basically a newtype of the node index.

Trait Implementations

impl<ID: Clone> Clone for Node<ID> where
    ID: PrimInt + Unsigned, 

fn clone(&self) -> Node<ID>

Returns a copy of the value.

pub fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<ID: Copy> Copy for Node<ID> where
    ID: PrimInt + Unsigned, 

impl<ID: Debug> Debug for Node<ID> where
    ID: PrimInt + Unsigned, 

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<ID> Display for Node<ID> where
    ID: PrimInt + Unsigned + Display, 

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<ID: Eq> Eq for Node<ID> where
    ID: PrimInt + Unsigned, 

impl<ID: Hash> Hash for Node<ID> where
    ID: PrimInt + Unsigned, 

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<ID> Indexable for Node<ID> where
    ID: PrimInt + Unsigned, 

fn index(&self) -> usize

impl<ID: PartialEq> PartialEq<Node<ID>> for Node<ID> where
    ID: PrimInt + Unsigned, 

fn eq(&self, other: &Node<ID>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Node<ID>) -> bool

This method tests for !=.

impl<ID> StructuralEq for Node<ID> where
    ID: PrimInt + Unsigned, 

impl<ID> StructuralPartialEq for Node<ID> where
    ID: PrimInt + Unsigned,