Struct petgraph::graphmap::Ptr

source · [−]

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

Expand description

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.

Tuple Fields

0: &'b T

Trait Implementations

source

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

source

fn clone(&self) -> Self

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

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

source

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

Formats the value using the given formatter. Read more

source

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

type Target = T

The resulting type after dereferencing.

source

fn deref(&self) -> &T

Dereferences the value.

source

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

source

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

Feeds this value into the given Hasher. Read more

1.3.0 · source

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

Feeds a slice of this type into the given Hasher. Read more

source

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

source

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

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

1.21.0 · source

fn max(self, other: Self) -> Self

Compares and returns the maximum of two values. Read more

1.21.0 · source

fn min(self, other: Self) -> Self

Compares and returns the minimum of two values. Read more

1.50.0 · source

fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval. Read more

source

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

source

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

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

1.0.0 · source

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

source

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

source

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

This method returns an ordering between self and other values if one exists. Read more

1.0.0 · source

fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator. Read more

1.0.0 · source

fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator. Read more

1.0.0 · source

fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator. Read more

1.0.0 · source

fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator. Read more

source

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

source

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

Auto Trait Implementations

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

impl<'b, T> Send for Ptr<'b, T> where
T: Sync,

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

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

impl<'b, T> UnwindSafe for Ptr<'b, T> where
T: RefUnwindSafe,

Blanket Implementations

source

impl<T> Any for T where
T: 'static + ?Sized,

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

impl<T> Borrow<T> for T where
T: ?Sized,

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

impl<T> BorrowMut<T> for T where
T: ?Sized,

const: unstable · source

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

source

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

source

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

impl<T, U> Into for T where
U: From<T>,

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

source

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more

source

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

source

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

source

Struct petgraph::graphmap::Ptr

Tuple Fields

Trait Implementations

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

fn clone(&self) -> Self

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

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

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

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

type Target = T

fn deref(&self) -> &T

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

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

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

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

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

fn max(self, other: Self) -> Self

fn min(self, other: Self) -> Self

fn clamp(self, min: Self, max: Self) -> Self

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

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

fn ne(&self, other: &Rhs) -> bool

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

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

fn lt(&self, other: &Rhs) -> bool

fn le(&self, other: &Rhs) -> bool

fn gt(&self, other: &Rhs) -> bool

fn ge(&self, other: &Rhs) -> bool

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

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

Auto Trait Implementations

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

impl<'b, T> Send for Ptr<'b, T> where T: Sync,

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

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

impl<'b, T> UnwindSafe for Ptr<'b, T> where T: RefUnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

impl<Q, K> Equivalent<K> for Q where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

fn equivalent(&self, key: &K) -> bool

impl<T> From<T> for T

fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

fn into(self) -> U

impl<T> ToOwned for T where T: Clone,

type Owned = T

fn to_owned(&self) -> T

fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

type Error = Infallible

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

impl<T, U> TryInto<U> for T where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

impl<N> NodeTrait for N where N: Copy + Ord + Hash,

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

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

impl<'b, T> Send for Ptr<'b, T> where
T: Sync,

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

impl<'b, T> UnwindSafe for Ptr<'b, T> where
T: RefUnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<N> NodeTrait for N where
N: Copy + Ord + Hash,