Struct rin::ecs::HasOption

pub struct HasOption<T> where
    T: 'static,  { /* fields omitted */ }

Operator that matches every entity no matter if it has the component or not but doesn’t give access to the component, only returns a boolean specifying if the component is present or not.

This doesn’t lock the accessed component so it can be used in parallel even with write access operators

for (has_pos, vel) in entities.iter_for::<(HasOption<Position>, Read<Velocity>)>(){
    if has_pos {
        // ...
    }
}

Will select all entities that optionally have Position and have a Velocity component pos will be false for those that don’t have Position

Methods from Deref<Target = bool>

Trait Implementations

impl<T> DataAccesses for HasOption<T> where
    T: 'static, 

pub fn reads() -> Vec<TypeId, Global>

pub fn writes() -> Vec<TypeId, Global>

impl<T> Deref for HasOption<T> where
    T: 'static, 

type Target = bool

The resulting type after dereferencing.

pub fn deref(&self) -> &bool

Dereferences the value.

impl<'a, T> FromComponent<'a, bool> for HasOption<T> where
    T: 'static, 

pub fn from_component(has: bool) -> HasOption<T>

impl<'a, T> UnorderedData<'a> for HasOption<T> where
    T: 'static, 

type Iter = IterHasOption<'a, T>

type IterMut = IterHasOption<'a, T>

type Components = T

type ComponentsRef = bool

type Storage = StorageHasOption<'a, T>

pub fn query_mask<E>(&E) -> Bitmask where
    E: EntitiesStorage, 

pub fn into_iter<E>(
    entities: &'a E
) -> <HasOption<T> as UnorderedData<'a>>::Iter where
    E: EntitiesStorage, 

pub fn into_iter_mut<E>(
    entities: &'a E
) -> <HasOption<T> as UnorderedData<'a>>::Iter where
    E: EntitiesStorage, 

pub fn storage<E>(
    entities: &'a E
) -> Option<<HasOption<T> as UnorderedData<'a>>::Storage> where
    E: EntitiesStorage, 

impl<'_, T> SafeIter<'_> for HasOption<T>