Struct petgraph::graphmap::Ptr [−][src]
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.
Trait Implementations
impl<'b, T> Ord for Ptr<'b, T>
[src]
impl<'b, T> Ord for Ptr<'b, T>
[src]fn cmp(&self, other: &Ptr<'b, T>) -> Ordering
[src]
fn cmp(&self, other: &Ptr<'b, T>) -> Ordering
[src]Ptr is ordered by pointer value, i.e. an arbitrary but stable and total order.
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]
#[must_use]fn max(self, other: Self) -> Self
1.21.0[src]Compares and returns the maximum of two values. Read more
impl<'b, T> PartialOrd<Ptr<'b, T>> for Ptr<'b, T>
[src]
impl<'b, T> PartialOrd<Ptr<'b, T>> for Ptr<'b, T>
[src]fn partial_cmp(&self, other: &Ptr<'b, T>) -> Option<Ordering>
[src]
fn partial_cmp(&self, other: &Ptr<'b, T>) -> Option<Ordering>
[src]This method returns an ordering between self
and other
values if one exists. Read more
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn lt(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than (for self
and other
) and is used by the <
operator. Read more
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]
#[must_use]fn le(&self, other: &Rhs) -> bool
1.0.0[src]This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
impl<'b, T> Copy for Ptr<'b, T>
[src]
impl<'b, T> Eq for Ptr<'b, T>
[src]
Auto Trait Implementations
impl<'b, T> RefUnwindSafe for Ptr<'b, T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
impl<'b, T> Send for Ptr<'b, T> where
T: Sync,
T: Sync,
impl<'b, T> Sync for Ptr<'b, T> where
T: Sync,
T: Sync,
impl<'b, T> Unpin for Ptr<'b, T>
impl<'b, T> UnwindSafe for Ptr<'b, T> where
T: RefUnwindSafe,
T: RefUnwindSafe,
Blanket Implementations
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]pub fn borrow_mut(&mut self) -> &mut T
[src]
pub fn borrow_mut(&mut self) -> &mut T
[src]Mutably borrows from an owned value. Read more
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]
impl<Q, K> Equivalent<K> for Q where
K: Borrow<Q> + ?Sized,
Q: Eq + ?Sized,
[src]pub fn equivalent(&self, key: &K) -> bool
[src]
pub fn equivalent(&self, key: &K) -> bool
[src]Compare self to key
and return true
if they are equal.
impl<T> ToOwned for T where
T: Clone,
[src]
impl<T> ToOwned for T where
T: Clone,
[src]type Owned = T
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub fn to_owned(&self) -> T
[src]Creates owned data from borrowed data, usually by cloning. Read more
pub fn clone_into(&self, target: &mut T)
[src]
pub fn clone_into(&self, target: &mut T)
[src]🔬 This is a nightly-only experimental API. (toowned_clone_into
)
recently added
Uses borrowed data to replace owned data, usually by cloning. Read more
impl<N> NodeTrait for N where
N: Copy + Ord + Hash,
[src]
N: Copy + Ord + Hash,