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 for Node<ID>where ID: PrimInt + Unsigned + Clone,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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> Hash for Node<ID>where ID: PrimInt + Unsigned + Hash,

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

Feeds this value into the given Hasher.

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

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<Node<ID>> for Node<ID>where ID: PrimInt + Unsigned + PartialEq,

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: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

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

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

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

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