Struct specs::storage::RestrictedStorage

pub struct RestrictedStorage<'rf, C, S> { /* private fields */ }

Similar to a MaskedStorage and a Storage combined, but restricts usage to only getting and modifying the components. That means it’s not possible to modify the inner bitset so the iteration cannot be invalidated. In other words, no insertion or removal is allowed.

Example Usage:

struct SomeComp(u32);
impl Component for SomeComp {
    type Storage = VecStorage<Self>;
}

struct RestrictedSystem;
impl<'a> System<'a> for RestrictedSystem {
    type SystemData = (Entities<'a>, WriteStorage<'a, SomeComp>);

    fn run(&mut self, (entities, mut some_comps): Self::SystemData) {
        for (entity, mut comps) in (&entities, &mut some_comps.restrict_mut()).join() {
            // Check if the reference is fine to mutate.
            if comps.get().0 < 5 {
                // Get a mutable reference now.
                let mut mutable = comps.get_mut();
                mutable.0 += 1;
            }
        }
    }
}

Trait Implementations

impl<'rf, C, S> Join for &'rf RestrictedStorage<'rf, C, S>where C: Component, S: Borrow<C::Storage>,

type Mask = &'rf BitSet

Type of joined bit mask.

type Type = PairedStorageRead<'rf, C>

Type of joined components.

type Value = (&'rf <C as Component>::Storage, &'rf Fetch<'rf, EntitiesRes>, &'rf BitSet)

Type of joined storages.

unsafe fn open(self) -> (Self::Mask, Self::Value)

Open this join by returning the mask and the storages.

unsafe fn get(value: &mut Self::Value, id: Index) -> Self::Type

Get a joined component value by a given index.

fn join(self) -> JoinIter<Self> where Self: Sized,

Create a joined iterator over the contents.

fn is_unconstrained() -> bool

If this Join typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinIter to go through all indices which is usually not what is wanted and will kill performance.

impl<'rf, C, S> Join for &'rf mut RestrictedStorage<'rf, C, S>where C: Component, S: BorrowMut<C::Storage>, C::Storage: SharedGetMutStorage<C>,

type Mask = &'rf BitSet

Type of joined bit mask.

type Type = PairedStorageWriteShared<'rf, C>

Type of joined components.

type Value = SharedGetOnly<'rf, C, <C as Component>::Storage>

Type of joined storages.

unsafe fn open(self) -> (Self::Mask, Self::Value)

Open this join by returning the mask and the storages.

unsafe fn get(value: &mut Self::Value, id: Index) -> Self::Type

Get a joined component value by a given index.

fn join(self) -> JoinIter<Self> where Self: Sized,

Create a joined iterator over the contents.

fn is_unconstrained() -> bool

If this Join typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinIter to go through all indices which is usually not what is wanted and will kill performance.

impl<'rf, C, S> LendJoin for &'rf RestrictedStorage<'rf, C, S>where C: Component, S: Borrow<C::Storage>,

type Mask = &'rf BitSet

Type of joined bit mask.

type Value = (&'rf <C as Component>::Storage, &'rf Fetch<'rf, EntitiesRes>, &'rf BitSet)

Type of joined storages.

unsafe fn open(self) -> (Self::Mask, Self::Value)

Open this join by returning the mask and the storages.

unsafe fn get<'next>( value: &'next mut Self::Value, id: Index ) -> <Self as LendJoinඞType<'next>>::T

Get a joined component value by a given index.

fn lend_join(self) -> JoinLendIter<Self>where Self: Sized,

Create a joined lending iterator over the contents.

fn maybe(self) -> MaybeJoin<Self>where Self: Sized,

Returns a structure that implements Join/LendJoin/MaybeJoin if the contained T does and that yields all indices, returning None for all missing elements and Some(T) for found elements.

fn is_unconstrained() -> bool

If this LendJoin typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinLendIter to go through all indices which is usually not what is wanted and will kill performance.

impl<'rf, C, S> LendJoin for &'rf mut RestrictedStorage<'rf, C, S>where C: Component, S: BorrowMut<C::Storage>,

type Mask = &'rf BitSet

Type of joined bit mask.

type Value = (&'rf mut <C as Component>::Storage, &'rf Fetch<'rf, EntitiesRes>, &'rf BitSet)

Type of joined storages.

unsafe fn open(self) -> (Self::Mask, Self::Value)

Open this join by returning the mask and the storages.

unsafe fn get<'next>( value: &'next mut Self::Value, id: Index ) -> <Self as LendJoinඞType<'next>>::T

Get a joined component value by a given index.

fn lend_join(self) -> JoinLendIter<Self>where Self: Sized,

Create a joined lending iterator over the contents.

fn maybe(self) -> MaybeJoin<Self>where Self: Sized,

Returns a structure that implements Join/LendJoin/MaybeJoin if the contained T does and that yields all indices, returning None for all missing elements and Some(T) for found elements.

fn is_unconstrained() -> bool

If this LendJoin typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinLendIter to go through all indices which is usually not what is wanted and will kill performance.

impl<'rf, C, S> ParJoin for &'rf RestrictedStorage<'rf, C, S>where C: Component, S: Borrow<C::Storage>, C::Storage: Sync,

type Mask = &'rf BitSet

Type of joined bit mask.

type Type = PairedStorageRead<'rf, C>

Type of joined components.

type Value = (&'rf <C as Component>::Storage, &'rf Fetch<'rf, EntitiesRes>, &'rf BitSet)

Type of joined storages.

unsafe fn open(self) -> (Self::Mask, Self::Value)

Open this join by returning the mask and the storages.

unsafe fn get(value: &Self::Value, id: Index) -> Self::Type

Get a joined component value by a given index.

fn par_join(self) -> JoinParIter<Self>where Self: Sized,

Create a joined parallel iterator over the contents.

fn is_unconstrained() -> bool

If this LendJoin typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinLendIter to go through all indices which is usually not what is wanted and will kill performance.

impl<'rf, C, S> ParJoin for &'rf mut RestrictedStorage<'rf, C, S>where C: Component, S: BorrowMut<C::Storage>, C::Storage: Sync + SharedGetMutStorage<C> + DistinctStorage,

type Mask = &'rf BitSet

Type of joined bit mask.

type Type = PairedStorageWriteShared<'rf, C>

Type of joined components.

type Value = SharedGetOnly<'rf, C, <C as Component>::Storage>

Type of joined storages.

unsafe fn open(self) -> (Self::Mask, Self::Value)

Open this join by returning the mask and the storages.

unsafe fn get(value: &Self::Value, id: Index) -> Self::Type

Get a joined component value by a given index.

fn par_join(self) -> JoinParIter<Self>where Self: Sized,

Create a joined parallel iterator over the contents.

fn is_unconstrained() -> bool

If this LendJoin typically returns all indices in the mask, then iterating over only it or combined with other joins that are also dangerous will cause the JoinLendIter to go through all indices which is usually not what is wanted and will kill performance.

impl<'rf, C, S> RepeatableLendGet for &'rf RestrictedStorage<'rf, C, S>where C: Component, S: Borrow<C::Storage>,

impl<'rf, C, S> RepeatableLendGet for &'rf mut RestrictedStorage<'rf, C, S>where C: Component, S: BorrowMut<C::Storage>,