Struct SparseStorage

pub struct SparseStorage<T: Default> {
    pub cell_size: i32,
    pub cells: FnvHashMap<CellIdx, T>,
}

SparseStorage stores cells in a FastMap to be used in a Grid. It is Sparse because cells are eagerly allocated, and cleaned when they are empty. It implements the Storage trait.

Fields

cell_size: i32

cells: FnvHashMap<CellIdx, T>

Implementations

impl<T: Default> SparseStorage<T>

pub fn new(cell_size: i32) -> Self

pub fn cell_size(&self) -> i32

pub fn modify(&mut self, f: impl FnMut(&mut T) -> bool)

pub fn cell_mut<V2: Vec2>(&mut self, pos: V2) -> (CellIdx, &mut T)

pub fn cell_mut_unchecked(&mut self, id: CellIdx) -> &mut T

pub fn cell(&self, id: CellIdx) -> Option<&T>

pub fn cell_id<V2: Vec2>(&self, pos: V2) -> CellIdx

Trait Implementations

impl<T: Clone + Default> Clone for SparseStorage<T>

fn clone(&self) -> SparseStorage<T>

Returns a copy of the value.

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

Performs copy-assignment from source.