Struct wgpu_core::weak_vec::WeakVec

pub(crate) struct WeakVec<T> {
    inner: Vec<Option<Weak<T>>>,
    empty_slots: Vec<usize>,
    scan_slots_on_next_push: bool,
}

An optimized container for Weak references of T that minimizes reallocations by dropping older elements that no longer have strong references to them.

Fields

inner: Vec<Option<Weak<T>>>

empty_slots: Vec<usize>

scan_slots_on_next_push: bool

Implementations

impl<T> WeakVec<T>

pub(crate) fn new() -> Self

pub(crate) fn push(&mut self, value: Weak<T>)

Pushes a new element to this collection.

If the inner Vec needs to be reallocated, we will first drop older elements that no longer have strong references to them.

Trait Implementations

impl<T: Debug> Debug for WeakVec<T>

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

Formats the value using the given formatter.

impl<T> Default for WeakVec<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> IntoIterator for WeakVec<T>

type Item = Weak<T>

The type of the elements being iterated over.

type IntoIter = WeakVecIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.