Struct bevy::ecs::prelude::Or

pub struct Or<T>(/* private fields */);
Expand description

A filter that tests if any of the given filters apply.

This is useful for example if a system with multiple components in a query only wants to run when one or more of the components have changed.

The And equivalent to this filter is a tuple testing that all the contained filters apply instead.

§Examples

fn print_cool_entity_system(query: Query<Entity, Or<(Changed<Color>, Changed<Style>)>>) {
    for entity in &query {
        println!("Entity {:?} got a new style or color", entity);
    }
}

Trait Implementations§

§

impl QueryFilter for Or<()>

§

const IS_ARCHETYPAL: bool = true

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<()> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0> QueryFilter for Or<(F0,)>
where F0: QueryFilter,

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0,)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1> QueryFilter for Or<(F0, F1)>
where F0: QueryFilter, F1: QueryFilter,

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2> QueryFilter for Or<(F0, F1, F2)>
where F0: QueryFilter, F1: QueryFilter, F2: QueryFilter,

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3> QueryFilter for Or<(F0, F1, F2, F3)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4> QueryFilter for Or<(F0, F1, F2, F3, F4)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5> QueryFilter for Or<(F0, F1, F2, F3, F4, F5)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14> QueryFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)>

§

const IS_ARCHETYPAL: bool = _

Returns true if (and only if) this Filter relies strictly on archetypes to limit which components are accessed by the Query. Read more
§

unsafe fn filter_fetch( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::Fetch<'_>, entity: Entity, table_row: TableRow, ) -> bool

Returns true if the provided Entity and TableRow should be included in the query results. If false, the entity will be skipped. Read more
§

impl WorldQuery for Or<()>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = ()

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = ()

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<()> as WorldQuery>::Item<'wlong>, ) -> <Or<()> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: bool = true

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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<()> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<()> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<()> as WorldQuery>::Fetch<'w>, state: &<Or<()> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<()> as WorldQuery>::Fetch<'w>, state: &<Or<()> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<()> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<()> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<()> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state(world: &mut World) -> <Or<()> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state(components: &Components) -> Option<<Or<()> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<()> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0> WorldQuery for Or<(F0,)>
where F0: QueryFilter,

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>,)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State,)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0,)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0,)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0,)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0,)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0,)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0,)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0,)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0,)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0,)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0,)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0,)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state(world: &mut World) -> <Or<(F0,)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0,)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0,)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1> WorldQuery for Or<(F0, F1)>
where F0: QueryFilter, F1: QueryFilter,

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state(world: &mut World) -> <Or<(F0, F1)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2> WorldQuery for Or<(F0, F1, F2)>
where F0: QueryFilter, F1: QueryFilter, F2: QueryFilter,

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state(world: &mut World) -> <Or<(F0, F1, F2)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3> WorldQuery for Or<(F0, F1, F2, F3)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state(world: &mut World) -> <Or<(F0, F1, F2, F3)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4> WorldQuery for Or<(F0, F1, F2, F3, F4)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5> WorldQuery for Or<(F0, F1, F2, F3, F4, F5)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6, F7)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>, OrFetch<'w, F7>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State, <F7 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>, OrFetch<'w, F7>, OrFetch<'w, F8>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State, <F7 as WorldQuery>::State, <F8 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>, OrFetch<'w, F7>, OrFetch<'w, F8>, OrFetch<'w, F9>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State, <F7 as WorldQuery>::State, <F8 as WorldQuery>::State, <F9 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>, OrFetch<'w, F7>, OrFetch<'w, F8>, OrFetch<'w, F9>, OrFetch<'w, F10>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State, <F7 as WorldQuery>::State, <F8 as WorldQuery>::State, <F9 as WorldQuery>::State, <F10 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>, OrFetch<'w, F7>, OrFetch<'w, F8>, OrFetch<'w, F9>, OrFetch<'w, F10>, OrFetch<'w, F11>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State, <F7 as WorldQuery>::State, <F8 as WorldQuery>::State, <F9 as WorldQuery>::State, <F10 as WorldQuery>::State, <F11 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>, OrFetch<'w, F7>, OrFetch<'w, F8>, OrFetch<'w, F9>, OrFetch<'w, F10>, OrFetch<'w, F11>, OrFetch<'w, F12>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State, <F7 as WorldQuery>::State, <F8 as WorldQuery>::State, <F9 as WorldQuery>::State, <F10 as WorldQuery>::State, <F11 as WorldQuery>::State, <F12 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>, OrFetch<'w, F7>, OrFetch<'w, F8>, OrFetch<'w, F9>, OrFetch<'w, F10>, OrFetch<'w, F11>, OrFetch<'w, F12>, OrFetch<'w, F13>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State, <F7 as WorldQuery>::State, <F8 as WorldQuery>::State, <F9 as WorldQuery>::State, <F10 as WorldQuery>::State, <F11 as WorldQuery>::State, <F12 as WorldQuery>::State, <F13 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14> WorldQuery for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)>

SAFETY: fetch accesses are a subset of the subqueries’ accesses This is sound because update_component_access adds accesses according to the implementations of all the subqueries. update_component_access replace the filters with a disjunction where every element is a conjunction of the previous filters and the filters of one of the subqueries. This is sound because matches_component_set returns a disjunction of the results of the subqueries’ implementations.

§

type Fetch<'w> = (OrFetch<'w, F0>, OrFetch<'w, F1>, OrFetch<'w, F2>, OrFetch<'w, F3>, OrFetch<'w, F4>, OrFetch<'w, F5>, OrFetch<'w, F6>, OrFetch<'w, F7>, OrFetch<'w, F8>, OrFetch<'w, F9>, OrFetch<'w, F10>, OrFetch<'w, F11>, OrFetch<'w, F12>, OrFetch<'w, F13>, OrFetch<'w, F14>)

Per archetype/table state used by this WorldQuery to fetch Self::Item
§

type Item<'w> = bool

The item returned by this WorldQuery For QueryData this will be the item returned by the query. For QueryFilter this will be either (), or a bool indicating whether the entity should be included or a tuple of such things.
§

type State = (<F0 as WorldQuery>::State, <F1 as WorldQuery>::State, <F2 as WorldQuery>::State, <F3 as WorldQuery>::State, <F4 as WorldQuery>::State, <F5 as WorldQuery>::State, <F6 as WorldQuery>::State, <F7 as WorldQuery>::State, <F8 as WorldQuery>::State, <F9 as WorldQuery>::State, <F10 as WorldQuery>::State, <F11 as WorldQuery>::State, <F12 as WorldQuery>::State, <F13 as WorldQuery>::State, <F14 as WorldQuery>::State)

State used to construct a Self::Fetch. This will be cached inside QueryState, so it is best to move as much data / computation here as possible to reduce the cost of constructing Self::Fetch.
§

fn shrink<'wlong, 'wshort>( item: <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::Item<'wlong>, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::Item<'wshort>
where 'wlong: 'wshort,

This function manually implements subtyping for the query items.
§

const IS_DENSE: 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, WorldQuery::set_table must be used before WorldQuery::fetch can be called for iterators. If this returns false, WorldQuery::set_archetype must be used before WorldQuery::fetch can be called for iterators.
§

unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::State, last_run: Tick, this_run: Tick, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::Fetch<'w>

Creates a new instance of this fetch. Read more
§

unsafe fn set_table<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::State, table: &'w Table, )

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

unsafe fn set_archetype<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::Fetch<'w>, state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::State, archetype: &'w Archetype, table: &'w Table, )

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

unsafe fn fetch<'w>( fetch: &mut <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::Fetch<'w>, _entity: Entity, _table_row: TableRow, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::Item<'w>

Fetch Self::Item for either the given entity in the current Table, or for the given entity in the current Archetype. This must always be called after WorldQuery::set_table with a table_row in the range of the current Table or after WorldQuery::set_archetype with a entity in the current archetype. Read more
§

fn update_component_access( state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::State, access: &mut FilteredAccess<ComponentId>, )

Adds any component accesses used by this WorldQuery to access. Read more
§

fn init_state( world: &mut World, ) -> <Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::State

Creates and initializes a State for this WorldQuery type.
§

fn get_state( components: &Components, ) -> Option<<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::State>

Attempts to initialize a State for this WorldQuery type using read-only access to Components.
§

fn matches_component_set( _state: &<Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)> as WorldQuery>::State, _set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool

Returns true if this query matches a set of components. Otherwise, returns false. Read more
§

fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)

Sets available accesses for implementors with dynamic access such as FilteredEntityRef or FilteredEntityMut. Read more
§

impl ArchetypeFilter for Or<()>

§

impl<F0> ArchetypeFilter for Or<(F0,)>
where F0: ArchetypeFilter,

§

impl<F0, F1> ArchetypeFilter for Or<(F0, F1)>

§

impl<F0, F1, F2> ArchetypeFilter for Or<(F0, F1, F2)>

§

impl<F0, F1, F2, F3> ArchetypeFilter for Or<(F0, F1, F2, F3)>

§

impl<F0, F1, F2, F3, F4> ArchetypeFilter for Or<(F0, F1, F2, F3, F4)>

§

impl<F0, F1, F2, F3, F4, F5> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5)>

§

impl<F0, F1, F2, F3, F4, F5, F6> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6)>

§

impl<F0, F1, F2, F3, F4, F5, F6, F7> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7)>

§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8)>

§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9)>

§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10)>

§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11)>

§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12)>

§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13)>

§

impl<F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14> ArchetypeFilter for Or<(F0, F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14)>

Auto Trait Implementations§

§

impl<T> Freeze for Or<T>

§

impl<T> RefUnwindSafe for Or<T>
where T: RefUnwindSafe,

§

impl<T> Send for Or<T>
where T: Send,

§

impl<T> Sync for Or<T>
where T: Sync,

§

impl<T> Unpin for Or<T>
where T: Unpin,

§

impl<T> UnwindSafe for Or<T>
where T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
§

impl<T, U> AsBindGroupShaderType<U> for T
where U: ShaderType, &'a T: for<'a> Into<U>,

§

fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U

Return the T ShaderType for self. When used in AsBindGroup derives, it is safe to assume that all images in self exist.
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
§

impl<T> Downcast<T> for T

§

fn downcast(&self) -> &T

§

impl<T> Downcast for T
where T: Any,

§

fn into_any(self: Box<T>) -> Box<dyn Any>

Convert Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>. Box<dyn Any> can then be further downcast into Box<ConcreteType> where ConcreteType implements Trait.
§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Convert Rc<Trait> (where Trait: Downcast) to Rc<Any>. Rc<Any> can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
§

fn as_any(&self) -> &(dyn Any + 'static)

Convert &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Convert &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Convert Arc<Trait> (where Trait: Downcast) to Arc<Any>. Arc<Any> can then be further downcast into Arc<ConcreteType> where ConcreteType implements Trait.
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

§

impl<S> FromSample<S> for S

§

fn from_sample_(s: S) -> S

§

impl<T> Instrument for T

§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
§

impl<F, T> IntoSample<T> for F
where T: FromSample<F>,

§

fn into_sample(self) -> T

§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> Same for T

§

type Output = T

Should always be Self
§

impl<T, U> ToSample<U> for T
where U: FromSample<T>,

§

fn to_sample_(self) -> U

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
§

impl<T> Upcast<T> for T

§

fn upcast(&self) -> Option<&T>

§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

§

fn vzip(self) -> V

§

impl<T> WithSubscriber for T

§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more
§

impl<T> ConditionalSend for T
where T: Send,

§

impl<S, T> Duplex<S> for T
where T: FromSample<S> + ToSample<S>,

§

impl<T> Settings for T
where T: 'static + Send + Sync,

§

impl<T> WasmNotSend for T
where T: Send,

§

impl<T> WasmNotSendSync for T
where T: WasmNotSend + WasmNotSync,

§

impl<T> WasmNotSync for T
where T: Sync,