Struct weak_table::PtrWeakHashSet

pub struct PtrWeakHashSet<T, S = RandomState>(_);

A hash set with weak elements, hashed on element pointer.

When a weak pointer expires, its mapping is lazily removed.

Implementations

impl<T: WeakElement> PtrWeakHashSet<T, RandomState> where
    T::Strong: Deref, 

pub fn new() -> Self

Creates an empty PtrWeakHashSet.

pub fn with_capacity(capacity: usize) -> Self

Creates an empty PtrWeakHashSet with the given capacity.

impl<T: WeakElement, S: BuildHasher> PtrWeakHashSet<T, S> where
    T::Strong: Deref, 

pub fn with_hasher(hash_builder: S) -> Self

Creates an empty PtrWeakHashSet with the given capacity and hasher.

pub fn with_capacity_and_hasher(capacity: usize, hash_builder: S) -> Self

Creates an empty PtrWeakHashSet with the given capacity and hasher.

pub fn hasher(&self) -> &S

Returns a reference to the map's BuildHasher.

pub fn capacity(&self) -> usize

Returns the number of elements the map can hold without reallocating.

pub fn remove_expired(&mut self)

Removes all mappings whose keys have expired.

pub fn reserve(&mut self, additional_capacity: usize)

Reserves room for additional elements.

pub fn shrink_to_fit(&mut self)

Shrinks the capacity to the minimum allowed to hold the current number of elements.

pub fn len(&self) -> usize

Returns an over-approximation of the number of elements.

pub fn is_empty(&self) -> bool

Is the set known to be empty?

This could answer false for an empty set whose elements have expired but have yet to be collected.

pub fn load_factor(&self) -> f32

The proportion of buckets that are used.

This is an over-approximation because of expired elements.

pub fn clear(&mut self)

Removes all associations from the map.

pub fn contains(&self, key: &T::Strong) -> bool

Returns true if the map contains the specified key.

pub fn insert(&mut self, key: T::Strong) -> bool

Unconditionally inserts the value, returning the old value if already present. Does not replace the key.

pub fn remove(&mut self, key: &T::Strong) -> bool

Removes the entry with the given key, if it exists, and returns the value.

pub fn retain<F>(&mut self, f: F) where
    F: FnMut(T::Strong) -> bool, 

Removes all mappings not satisfying the given predicate.

Also removes any expired mappings.

pub fn is_subset<S1>(&self, other: &PtrWeakHashSet<T, S1>) -> bool where
    S1: BuildHasher, 

Is self a subset of other?

impl<T: WeakElement, S> PtrWeakHashSet<T, S> where
    T::Strong: Deref, 

pub fn iter(&self) -> Iter<T>

Gets an iterator over the keys and values.

pub fn drain(&mut self) -> Drain<T>

Gets a draining iterator, which removes all the values but retains the storage.

Trait Implementations

impl<T: Clone, S: Clone> Clone for PtrWeakHashSet<T, S>

fn clone(&self) -> PtrWeakHashSet<T, S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T, S> Debug for PtrWeakHashSet<T, S> where
    T: WeakElement,
    T::Strong: Debug, 

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

Formats the value using the given formatter.

impl<T: WeakElement, S: BuildHasher + Default> Default for PtrWeakHashSet<T, S> where
    T::Strong: Deref, 

fn default() -> Self

Returns the "default value" for a type.

impl<T: WeakElement, S: BuildHasher> Eq for PtrWeakHashSet<T, S> where
    T::Strong: Deref, 

impl<T, S> Extend<<T as WeakElement>::Strong> for PtrWeakHashSet<T, S> where
    T: WeakElement,
    T::Strong: Deref,
    S: BuildHasher, 

fn extend<I: IntoIterator<Item = T::Strong>>(&mut self, iter: I)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬 This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬 This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<T, S> FromIterator<<T as WeakElement>::Strong> for PtrWeakHashSet<T, S> where
    T: WeakElement,
    T::Strong: Deref,
    S: BuildHasher + Default, 

fn from_iter<I: IntoIterator<Item = T::Strong>>(iter: I) -> Self

Creates a value from an iterator.

impl<T: WeakElement, S> IntoIterator for PtrWeakHashSet<T, S>

type Item = T::Strong

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<'a, T: WeakElement, S> IntoIterator for &'a PtrWeakHashSet<T, S> where
    T::Strong: Deref, 

type Item = T::Strong

The type of the elements being iterated over.

type IntoIter = Iter<'a, T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T, S, S1> PartialEq<PtrWeakHashSet<T, S1>> for PtrWeakHashSet<T, S> where
    T: WeakElement,
    T::Strong: Deref,
    S: BuildHasher,
    S1: BuildHasher, 

fn eq(&self, other: &PtrWeakHashSet<T, S1>) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.