Struct HashableWeak 

pub struct HashableWeak<T: ?Sized>(pub Weak<T>);

Weak<T> newtype that hashes and compares by the underlying allocation address, so it can be stored in a HashSet or used as a HashMap key.

Equality uses Weak::ptr_eq. The ptr_eq semantics are documented as unspecified once the original allocation has been dropped, so callers should periodically prune dead entries (via Weak::upgrade returning None) to keep the set hygienic. With timely pruning, the only observable consequence of a stale entry colliding with a new live entry is that the live entry replaces the stale one on insert — which is the desired outcome anyway.

Tuple Fields

0: Weak<T>

Implementations

impl<T: ?Sized> HashableWeak<T>

pub fn new(arc: &Arc<T>) -> Self

Trait Implementations

impl<T: ?Sized> Clone for HashableWeak<T>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Hash for HashableWeak<T>

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<T: ?Sized> PartialEq for HashableWeak<T>

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<T: ?Sized> Eq for HashableWeak<T>