Struct graph_theory::PureNode

pub struct PureNode<M> { /* private fields */ }

Implementations

impl<M> PureNode<M>

pub fn new(index: usize, metadata: M) -> PureNode<M>

pub fn as_ref(&self) -> PureNode<&M>

pub fn re_ref(node: PureNode<&M>) -> &PureNode<M>

Cast the inner reference to outer reference.

Safety

The memory layout of PureNode<&M> and &PureNode<M> is the same, so we can safely cast between them.

Here we leak the index, it’s safe since it is Copy.

Examples

let ref_inner = PureNode::new(0, &0);
let ref_outer = PureNode::re_ref(ref_inner);

pub fn re_mut(node: PureNode<&mut M>) -> &mut PureNode<M>

Cast the inner mutable reference to outer mutable reference.

Safety

The memory layout of PureNode<&mut M> and &mut PureNode<M> is the same, so we can safely cast between them.

index is leaked and promoted, make sure you don’t modify its value.

Examples

let ref_inner = PureNode::new(0, &mut 0);
let ref_outer = PureNode::re_mut(ref_inner);

Trait Implementations

impl<M> Clone for PureNode<M>where M: Clone,

fn clone(&self) -> PureNode<M>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<M> Debug for PureNode<M>where M: Debug,

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

Formats the value using the given formatter.

impl<M> Node for PureNode<M>

fn index(&self) -> usize

impl<M> PartialEq<PureNode<M>> for PureNode<M>where M: PartialEq<M>,

fn eq(&self, other: &PureNode<M>) -> 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<M> Copy for PureNode<M>where M: Copy,

impl<M> Eq for PureNode<M>where M: Eq,

impl<M> StructuralEq for PureNode<M>

impl<M> StructuralPartialEq for PureNode<M>