Struct Ref
pub struct Ref<'w, T>where
T: ?Sized,{ /* private fields */ }Expand description
Shared borrow of an entity’s component with access to change detection.
Similar to Mut but is immutable and so doesn’t require unique access.
§Examples
These two systems produce the same output.
fn how_many_changed_1(query: Query<(), Changed<MyComponent>>) {
println!("{} changed", query.iter().count());
}
fn how_many_changed_2(query: Query<Ref<MyComponent>>) {
println!("{} changed", query.iter().filter(|c| c.is_changed()).count());
}Implementations§
§impl<'w, T> Ref<'w, T>where
T: ?Sized,
impl<'w, T> Ref<'w, T>where
T: ?Sized,
pub fn into_inner(self) -> &'w T
pub fn into_inner(self) -> &'w T
Returns the reference wrapped by this type. The reference is allowed to outlive self, which makes this method more flexible than simply borrowing self.
pub fn map<U>(self, f: impl FnOnce(&T) -> &U) -> Ref<'w, U>where
U: ?Sized,
pub fn map<U>(self, f: impl FnOnce(&T) -> &U) -> Ref<'w, U>where
U: ?Sized,
Map Ref to a different type using f.
This doesn’t do anything else than call f on the wrapped value.
This is equivalent to Mut::map_unchanged.
pub fn new(
value: &'w T,
added: &'w Tick,
changed: &'w Tick,
last_run: Tick,
this_run: Tick,
caller: MaybeLocation<&'w &'static Location<'static>>,
) -> Ref<'w, T>
pub fn new( value: &'w T, added: &'w Tick, changed: &'w Tick, last_run: Tick, this_run: Tick, caller: MaybeLocation<&'w &'static Location<'static>>, ) -> Ref<'w, T>
Create a new Ref using provided values.
This is an advanced feature, Refs are designed to be created by
engine-internal code and consumed by end-user code.
value- The value wrapped byRef.added- A [Tick] that stores the tick when the wrapped value was created.changed- A [Tick] that stores the last time the wrapped value was changed.last_run- A [Tick], occurring beforethis_run, which is used as a reference to determine whether the wrapped value is newly added or changed.this_run- A [Tick] corresponding to the current point in time – “now”.
pub fn set_ticks(&mut self, last_run: Tick, this_run: Tick)
pub fn set_ticks(&mut self, last_run: Tick, this_run: Tick)
Overwrite the last_run and this_run tick that are used for change detection.
This is an advanced feature. Refs are usually created by engine-internal code and
consumed by end-user code.
Trait Implementations§
§impl<T> ContiguousQueryData for Ref<'_, T>where
T: Component,
impl<T> ContiguousQueryData for Ref<'_, T>where
T: Component,
§type Contiguous<'w, 's> = ContiguousRef<'w, T>
type Contiguous<'w, 's> = ContiguousRef<'w, T>
ContiguousQueryData::fetch_contiguous].
Represents a contiguous chunk of memory.§unsafe fn fetch_contiguous<'w, 's>(
_state: &'s <Ref<'_, T> as WorldQuery>::State,
fetch: &mut <Ref<'_, T> as WorldQuery>::Fetch<'w>,
entities: &'w [Entity],
) -> <Ref<'_, T> as ContiguousQueryData>::Contiguous<'w, 's>
unsafe fn fetch_contiguous<'w, 's>( _state: &'s <Ref<'_, T> as WorldQuery>::State, fetch: &mut <Ref<'_, T> as WorldQuery>::Fetch<'w>, entities: &'w [Entity], ) -> <Ref<'_, T> as ContiguousQueryData>::Contiguous<'w, 's>
ContiguousQueryData::Contiguous] which represents a contiguous chunk of memory (e.g., an array) in the current [Table].
This must always be called after [WorldQuery::set_table]. Read more§impl<'w, T> DetectChanges for Ref<'w, T>where
T: ?Sized,
impl<'w, T> DetectChanges for Ref<'w, T>where
T: ?Sized,
§fn is_changed(&self) -> bool
fn is_changed(&self) -> bool
true if this value was added or mutably dereferenced
either since the last time the system ran or, if the system never ran,
since the beginning of the program. Read more§fn is_added_after(&self, other: Tick) -> bool
fn is_added_after(&self, other: Tick) -> bool
true if this value was added after the other tick.§fn is_changed_after(&self, other: Tick) -> bool
fn is_changed_after(&self, other: Tick) -> bool
§fn last_changed(&self) -> Tick
fn last_changed(&self) -> Tick
§fn changed_by(&self) -> MaybeLocation
fn changed_by(&self) -> MaybeLocation
§impl<'w, 'a, T> IntoIterator for &'a Ref<'w, T>where
&'a T: IntoIterator,
impl<'w, 'a, T> IntoIterator for &'a Ref<'w, T>where
&'a T: IntoIterator,
§impl<'__w, T> QueryData for Ref<'__w, T>where
T: Component,
impl<'__w, T> QueryData for Ref<'__w, T>where
T: Component,
§const IS_READ_ONLY: bool = true
const IS_READ_ONLY: bool = true
§const IS_ARCHETYPAL: bool = true
const IS_ARCHETYPAL: bool = true
§type ReadOnly = Ref<'__w, T>
type ReadOnly = Ref<'__w, T>
QueryData], which satisfies the [ReadOnlyQueryData] trait.§type Item<'w, 's> = Ref<'w, T>
type Item<'w, 's> = Ref<'w, T>
WorldQuery]
This will be the data retrieved by the query,
and is visible to the end user when calling e.g. Query<Self>::get.§fn shrink<'wlong, 'wshort, 's>(
item: <Ref<'__w, T> as QueryData>::Item<'wlong, 's>,
) -> <Ref<'__w, T> as QueryData>::Item<'wshort, 's>where
'wlong: 'wshort,
fn shrink<'wlong, 'wshort, 's>(
item: <Ref<'__w, T> as QueryData>::Item<'wlong, 's>,
) -> <Ref<'__w, T> as QueryData>::Item<'wshort, 's>where
'wlong: 'wshort,
§unsafe fn fetch<'w, 's>(
_state: &'s <Ref<'__w, T> as WorldQuery>::State,
fetch: &mut <Ref<'__w, T> as WorldQuery>::Fetch<'w>,
entity: Entity,
table_row: TableRow,
) -> Option<<Ref<'__w, T> as QueryData>::Item<'w, 's>>
unsafe fn fetch<'w, 's>( _state: &'s <Ref<'__w, T> as WorldQuery>::State, fetch: &mut <Ref<'__w, T> as WorldQuery>::Fetch<'w>, entity: Entity, table_row: TableRow, ) -> Option<<Ref<'__w, T> as QueryData>::Item<'w, 's>>
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 an entity in the current archetype.
Accesses components registered in [WorldQuery::update_component_access]. Read more§fn iter_access(
state: &<Ref<'__w, T> as WorldQuery>::State,
) -> impl Iterator<Item = EcsAccessType<'_>>
fn iter_access( state: &<Ref<'__w, T> as WorldQuery>::State, ) -> impl Iterator<Item = EcsAccessType<'_>>
QueryData::fetch]. Access conflicts are usually
checked in [WorldQuery::update_component_access], but in certain cases this method can be useful to implement
a way of checking for access conflicts in a non-allocating way.§fn provide_extra_access(
_state: &mut Self::State,
_access: &mut Access,
_available_access: &Access,
)
fn provide_extra_access( _state: &mut Self::State, _access: &mut Access, _available_access: &Access, )
update_component_access.
Implementations may add additional access that is a subset of available_access
and does not conflict with anything in access,
and must update access to include that access. Read more§impl<T> ReleaseStateQueryData for Ref<'_, T>where
T: Component,
impl<T> ReleaseStateQueryData for Ref<'_, T>where
T: Component,
§fn release_state<'w>(
item: <Ref<'_, T> as QueryData>::Item<'w, '_>,
) -> <Ref<'_, T> as QueryData>::Item<'w, 'static>
fn release_state<'w>( item: <Ref<'_, T> as QueryData>::Item<'w, '_>, ) -> <Ref<'_, T> as QueryData>::Item<'w, 'static>
'static state lifetime.§impl<'__w, T> WorldQuery for Ref<'__w, T>where
T: Component,
impl<'__w, T> WorldQuery for Ref<'__w, T>where
T: Component,
§const IS_DENSE: bool
const IS_DENSE: bool
§type Fetch<'w> = RefFetch<'w, T>
type Fetch<'w> = RefFetch<'w, T>
WorldQuery] to compute Self::Item for each entity.§type State = ComponentId
type State = ComponentId
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_fetch<'wlong, 'wshort>(
fetch: <Ref<'__w, T> as WorldQuery>::Fetch<'wlong>,
) -> <Ref<'__w, T> as WorldQuery>::Fetch<'wshort>where
'wlong: 'wshort,
fn shrink_fetch<'wlong, 'wshort>(
fetch: <Ref<'__w, T> as WorldQuery>::Fetch<'wlong>,
) -> <Ref<'__w, T> as WorldQuery>::Fetch<'wshort>where
'wlong: 'wshort,
§unsafe fn init_fetch<'w, 's>(
world: UnsafeWorldCell<'w>,
_: &ComponentId,
last_run: Tick,
this_run: Tick,
) -> RefFetch<'w, T>
unsafe fn init_fetch<'w, 's>( world: UnsafeWorldCell<'w>, _: &ComponentId, last_run: Tick, this_run: Tick, ) -> RefFetch<'w, T>
Self::Fetch,
by combining data from the World with the cached Self::State.
Readonly accesses resources registered in [WorldQuery::update_component_access]. Read more§unsafe fn set_archetype<'w>(
fetch: &mut RefFetch<'w, T>,
component_id: &ComponentId,
_archetype: &'w Archetype,
table: &'w Table,
)
unsafe fn set_archetype<'w>( fetch: &mut RefFetch<'w, T>, component_id: &ComponentId, _archetype: &'w Archetype, table: &'w Table, )
Archetype]. This will always be called on
archetypes that match this [WorldQuery]. Read more§unsafe fn set_table<'w>(
fetch: &mut RefFetch<'w, T>,
_: &ComponentId,
table: &'w Table,
)
unsafe fn set_table<'w>( fetch: &mut RefFetch<'w, T>, _: &ComponentId, table: &'w Table, )
Table]. This will always be called on tables
that match this [WorldQuery]. Read more§fn update_component_access(_: &ComponentId, access: &mut FilteredAccess)
fn update_component_access(_: &ComponentId, access: &mut FilteredAccess)
§fn init_state(world: &mut World) -> ComponentId
fn init_state(world: &mut World) -> ComponentId
State for this [WorldQuery] type.§fn matches_component_set(
_: &ComponentId,
set_contains_id: &impl Fn(ComponentId) -> bool,
) -> bool
fn matches_component_set( _: &ComponentId, set_contains_id: &impl Fn(ComponentId) -> bool, ) -> bool
§fn init_nested_access(
_state: &Self::State,
_system_name: Option<&str>,
_component_access_set: &mut FilteredAccessSet,
_world: UnsafeWorldCell<'_>,
)
fn init_nested_access( _state: &Self::State, _system_name: Option<&str>, _component_access_set: &mut FilteredAccessSet, _world: UnsafeWorldCell<'_>, )
WorldQuery]. Read more