Struct specs::prelude::HashMapStorage

pub struct HashMapStorage<T>(_);

HashMap-based storage. Best suited for rare components.

This uses the std::collections::HashMap internally.

Trait Implementations

impl<T> Default for HashMapStorage<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T> UnprotectedStorage<T> for HashMapStorage<T>

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 get(&self, id: 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, id: 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, id: Index, v: T)

Inserts new data for a given Index.

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

Removes the data associated with an Index.

unsafe fn drop(&mut self, id: 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 HashMapStorage<T>