Struct WeakHashList 

pub struct WeakHashList<T: ?Sized + 'static> { /* private fields */ }

A list of weakly referenced items, compared by identity.

Up to DEFAULT_ARRAY_SIZE items are kept in an array; beyond that the list switches to a dictionary that counts how many times each item was added.

Implementations

impl<T: ?Sized + 'static> WeakHashList<T>

pub const DEFAULT_ARRAY_SIZE: usize = 8

pub fn new() -> Self

pub fn is_empty(&self) -> bool

pub fn need_compact(&self) -> bool

pub fn add(&mut self, item: &Rc<T>)

pub fn remove(&mut self, item: &Rc<T>)

pub fn compact(&mut self)

pub fn return_to_shared_pool(list: Vec<Rc<T>>)

Clears list and keeps it for a later get_alive.

pub fn get_alive( &mut self, factory: Option<&dyn Fn() -> Vec<Rc<T>>>, ) -> Option<Vec<Rc<T>>>

The items that are still alive, or None if there are none. The list comes from factory when given, else from the shared pool.

Trait Implementations

impl<T: ?Sized + 'static> Default for WeakHashList<T>

fn default() -> Self

Returns the “default value” for a type.