Struct DenseVecStorage

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

Dense vector storage. Has a redirection 2-way table between entities and components, allowing to leave no gaps within the data.

Note that this only stores the data (T) densely; indices to the data are stored in a sparse Vec.

as_slice() and as_mut_slice() indices are local to this DenseVecStorage at this particular moment. These indices cannot be compared with indices from any other storage, and a particular entity’s position within this slice may change over time.

Trait Implementations

impl<T> Default for DenseVecStorage<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> Storage<T> for DenseVecStorage<T>

unsafe fn get(&self, index: Index) -> &T

Tries reading the data associated with an Index. This is unsafe because the external set used to protect this storage is absent.

unsafe fn get_mut(&mut self, index: Index) -> &mut T

Tries mutating the data associated with an Index. This is unsafe because the external set used to protect this storage is absent.

unsafe fn insert(&mut self, index: Index, v: T)

Inserts new data for a given Index.

unsafe fn remove(&mut self, index: Index) -> T

Removes the data associated with an Index.

unsafe fn clean<B>(&mut self, _has: B)

where B: BitSetLike,

Clean the storage given a bitset with bits set for valid indices. Allows us to safely drop the storage.

unsafe fn drop(&mut self, index: Index)

Drops the data associated with an Index. This could be used when a more efficient implementation for it exists than remove when the data is no longer needed. Defaults to simply calling remove.

impl<T> DistinctStorage for DenseVecStorage<T>