Struct daggy::petgraph::graphmap::Ptr

pub struct Ptr<'b, T> where T: 'b(pub &'b T);

A reference that is hashed and compared by its pointer value.

Ptr is used for certain configurations of GraphMap, in particular in the combination where the node type for GraphMap is something of type for example Ptr(&Cell<T>), with the Cell<T> being TypedArena allocated.

Trait Implementations

impl<'b, T> Copy for Ptr<'b, T>

impl<'b, T> Clone for Ptr<'b, T>

fn clone(&self) -> Ptr<'b, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<'b, T> PartialEq<Ptr<'b, T>> for Ptr<'b, T>

fn eq(&self, other: &Ptr<'b, T>) -> bool

Ptr compares by pointer equality, i.e if they point to the same value

impl<'b, T> PartialOrd<Ptr<'b, T>> for Ptr<'b, T>

fn partial_cmp(&self, other: &Ptr<'b, T>) -> Option<Ordering>

impl<'b, T> Ord for Ptr<'b, T>

fn cmp(&self, other: &Ptr<'b, T>) -> Ordering

Ptr is ordered by pointer value, i.e. an arbitrary but stable and total order.

impl<'b, T> Deref for Ptr<'b, T>

type Target = T

fn deref(&'a self) -> &'a T

impl<'b, T> Eq for Ptr<'b, T>

impl<'b, T> Hash for Ptr<'b, T>

fn hash<H>(&self, st: &mut H) where H: Hasher

impl<'b, T> Debug for Ptr<'b, T> where T: Debug

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

Formats the value using the given formatter.