Struct bevy_internal::ecs::query::WithoutFetch

pub struct WithoutFetch<T> { /* fields omitted */ }

Trait Implementations

impl<'a, T> Fetch<'a> for WithoutFetch<T> where
    T: Component, 

type Item = bool

type State = WithoutState<T>

pub unsafe fn init(
    _world: &World,
    state: &<WithoutFetch<T> as Fetch<'a>>::State,
    _last_change_tick: u32,
    _change_tick: u32
) -> WithoutFetch<T>

Creates a new instance of this fetch.

pub fn is_dense(&self) -> bool

Returns true if (and only if) every table of every archetype matched by this Fetch contains all of the matched components. This is used to select a more efficient “table iterator” for “dense” queries. If this returns true, Fetch::set_table and Fetch::table_fetch will be called for iterators If this returns false, Fetch::set_archetype and Fetch::archetype_fetch will be called for iterators

pub unsafe fn set_table(
    &mut self,
    _state: &<WithoutFetch<T> as Fetch<'a>>::State,
    _table: &Table
)

Adjusts internal state to account for the next Table. This will always be called on tables that match this Fetch

pub unsafe fn set_archetype(
    &mut self,
    _state: &<WithoutFetch<T> as Fetch<'a>>::State,
    _archetype: &Archetype,
    _tables: &Tables
)

Adjusts internal state to account for the next Archetype. This will always be called on archetypes that match this Fetch

pub unsafe fn archetype_fetch(&mut self, _archetype_index: usize) -> bool

Fetch Self::Item for the given archetype_index in the current Archetype. This must always be called after Fetch::set_archetype with an archetype_index in the range of the current Archetype

pub unsafe fn table_fetch(&mut self, _table_row: usize) -> bool

Fetch Self::Item for the given table_row in the current Table. This must always be called after Fetch::set_table with a table_row in the range of the current Table