Struct hydroflow::util::sparse_vec::SparseVec

pub struct SparseVec<T> { /* private fields */ }

A vector that supports efficient deletion without reordering all subsequent items.

Implementations

impl<T: Clone + Eq + Hash> SparseVec<T>

pub fn push(&mut self, item: T)

Insert item into the vector, see https://doc.rust-lang.org/std/vec/struct.Vec.html#method.push

pub fn delete(&mut self, item: &T)

Delete all items of a specific value from this vector. This takes time proportional to the amount of items with that value in the vector, not the total size of the vector.

pub fn iter( &self ) -> impl DoubleEndedIterator<Item = &T> + FusedIterator + Clone

Iterate through all items in the vector in order. Deleted items will not appear in the iteration.

Trait Implementations

impl<T> Default for SparseVec<T>

fn default() -> Self

Returns the “default value” for a type.