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§
source§impl<'w, T> Ref<'w, T>where
T: ?Sized,
impl<'w, T> Ref<'w, T>where
T: ?Sized,
sourcepub 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
.
sourcepub 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
.
sourcepub fn new(
value: &'w T,
added: &'w Tick,
changed: &'w Tick,
last_run: Tick,
this_run: Tick,
) -> Ref<'w, T>
pub fn new( value: &'w T, added: &'w Tick, changed: &'w Tick, last_run: Tick, this_run: Tick, ) -> Ref<'w, T>
Create a new Ref
using provided values.
This is an advanced feature, Ref
s are designed to be created by
engine-internal code and consumed by end-user code.
value
- The value wrapped byRef
.added
- ATick
that stores the tick when the wrapped value was created.changed
- ATick
that stores the last time the wrapped value was changed.last_run
- ATick
, occurring beforethis_run
, which is used as a reference to determine whether the wrapped value is newly added or changed.this_run
- ATick
corresponding to the current point in time – “now”.
Trait Implementations§
source§impl<'w, T> DetectChanges for Ref<'w, T>where
T: ?Sized,
impl<'w, T> DetectChanges for Ref<'w, T>where
T: ?Sized,
source§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 moresource§fn last_changed(&self) -> Tick
fn last_changed(&self) -> Tick
source§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,
source§impl<'__w, T> QueryData for Ref<'__w, T>where
T: Component,
impl<'__w, T> QueryData for Ref<'__w, T>where
T: Component,
SAFETY: Self
is the same as Self::ReadOnly
source§impl<'__w, T> WorldQuery for Ref<'__w, T>where
T: Component,
impl<'__w, T> WorldQuery for Ref<'__w, T>where
T: Component,
SAFETY:
fetch
accesses a single component in a readonly way.
This is sound because update_component_access
and update_archetype_component_access
add read access for that component and panic when appropriate.
update_component_access
adds a With
filter for a component.
This is sound because matches_component_set
returns whether the set contains that component.
source§const IS_DENSE: bool = _
const IS_DENSE: bool = _
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.source§type Item<'w> = Ref<'w, T>
type Item<'w> = Ref<'w, T>
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.source§type Fetch<'w> = RefFetch<'w, T>
type Fetch<'w> = RefFetch<'w, T>
WorldQuery
to fetch Self::Item
source§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
.source§fn shrink<'wlong, 'wshort>(item: Ref<'wlong, T>) -> Ref<'wshort, T>where
'wlong: 'wshort,
fn shrink<'wlong, 'wshort>(item: Ref<'wlong, T>) -> Ref<'wshort, T>where
'wlong: 'wshort,
source§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,
source§unsafe fn init_fetch<'w>(
world: UnsafeWorldCell<'w>,
_: &ComponentId,
last_run: Tick,
this_run: Tick,
) -> RefFetch<'w, T>
unsafe fn init_fetch<'w>( world: UnsafeWorldCell<'w>, _: &ComponentId, last_run: Tick, this_run: Tick, ) -> RefFetch<'w, T>
source§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 moresource§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 moresource§unsafe fn fetch<'w>(
fetch: &mut <Ref<'__w, T> as WorldQuery>::Fetch<'w>,
entity: Entity,
table_row: TableRow,
) -> <Ref<'__w, T> as WorldQuery>::Item<'w>
unsafe fn fetch<'w>( fetch: &mut <Ref<'__w, T> as WorldQuery>::Fetch<'w>, entity: Entity, table_row: TableRow, ) -> <Ref<'__w, T> as WorldQuery>::Item<'w>
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 moresource§fn update_component_access(
_: &ComponentId,
access: &mut FilteredAccess<ComponentId>,
)
fn update_component_access( _: &ComponentId, access: &mut FilteredAccess<ComponentId>, )
source§fn init_state(world: &mut World) -> ComponentId
fn init_state(world: &mut World) -> ComponentId
State
for this WorldQuery
type.source§fn get_state(
components: &Components,
) -> Option<<Ref<'__w, T> as WorldQuery>::State>
fn get_state( components: &Components, ) -> Option<<Ref<'__w, T> as WorldQuery>::State>
source§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
source§fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)
fn set_access(_state: &mut Self::State, _access: &FilteredAccess<ComponentId>)
FilteredEntityRef
or FilteredEntityMut
. Read moreimpl<'__w, T> ReadOnlyQueryData for Ref<'__w, T>where
T: Component,
SAFETY: access is read only
Auto Trait Implementations§
impl<'w, T> Freeze for Ref<'w, T>where
T: ?Sized,
impl<'w, T> RefUnwindSafe for Ref<'w, T>where
T: RefUnwindSafe + ?Sized,
impl<'w, T> Send for Ref<'w, T>
impl<'w, T> Sync for Ref<'w, T>
impl<'w, T> Unpin for Ref<'w, T>where
T: ?Sized,
impl<'w, T> UnwindSafe for Ref<'w, T>where
T: RefUnwindSafe + ?Sized,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
source§impl<T, C, D> Curve<T> for D
impl<T, C, D> Curve<T> for D
source§fn sample_unchecked(&self, t: f32) -> T
fn sample_unchecked(&self, t: f32) -> T
t
, extracting the associated value.
This is the unchecked version of sampling, which should only be used if the sample time t
is already known to lie within the curve’s domain. Read moresource§fn sample(&self, t: f32) -> Option<T>
fn sample(&self, t: f32) -> Option<T>
t
, returning None
if the point is
outside of the curve’s domain.source§fn sample_clamped(&self, t: f32) -> T
fn sample_clamped(&self, t: f32) -> T
t
, clamping t
to lie inside the
domain of the curve.source§fn sample_iter(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = Option<T>>where
Self: Sized,
fn sample_iter(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = Option<T>>where
Self: Sized,
n >= 0
points on this curve at the parameter values t_n
,
returning None
if the point is outside of the curve’s domain. Read moresource§fn sample_iter_unchecked(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = T>where
Self: Sized,
fn sample_iter_unchecked(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = T>where
Self: Sized,
n >= 0
points on this curve at the parameter values t_n
,
extracting the associated values. This is the unchecked version of sampling, which should
only be used if the sample times t_n
are already known to lie within the curve’s domain. Read moresource§fn sample_iter_clamped(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = T>where
Self: Sized,
fn sample_iter_clamped(
&self,
iter: impl IntoIterator<Item = f32>,
) -> impl Iterator<Item = T>where
Self: Sized,
n >= 0
points on this curve at the parameter values t_n
,
clamping t_n
to lie inside the domain of the curve. Read moresource§fn map<S, F>(self, f: F) -> MapCurve<T, S, Self, F>
fn map<S, F>(self, f: F) -> MapCurve<T, S, Self, F>
f
; i.e., if the
sample at time t
for this curve is x
, the value at time t
on the new curve will be
f(x)
.source§fn reparametrize<F>(self, domain: Interval, f: F) -> ReparamCurve<T, Self, F>
fn reparametrize<F>(self, domain: Interval, f: F) -> ReparamCurve<T, Self, F>
Curve
whose parameter space is related to the parameter space of this curve
by f
. For each time t
, the sample from the new curve at time t
is the sample from
this curve at time f(t)
. The given domain
will be the domain of the new curve. The
function f
is expected to take domain
into self.domain()
. Read moresource§fn reparametrize_linear(
self,
domain: Interval,
) -> Result<LinearReparamCurve<T, Self>, LinearReparamError>where
Self: Sized,
fn reparametrize_linear(
self,
domain: Interval,
) -> Result<LinearReparamCurve<T, Self>, LinearReparamError>where
Self: Sized,
Curve
, producing a new curve whose domain is the given
domain
instead of the current one. This operation is only valid for curves with bounded
domains; if either this curve’s domain or the given domain
is unbounded, an error is
returned.source§fn reparametrize_by_curve<C>(self, other: C) -> CurveReparamCurve<T, Self, C>
fn reparametrize_by_curve<C>(self, other: C) -> CurveReparamCurve<T, Self, C>
source§fn graph(self) -> GraphCurve<T, Self>where
Self: Sized,
fn graph(self) -> GraphCurve<T, Self>where
Self: Sized,
source§fn chain<C>(self, other: C) -> Result<ChainCurve<T, Self, C>, ChainError>
fn chain<C>(self, other: C) -> Result<ChainCurve<T, Self, C>, ChainError>
source§fn reverse(self) -> Result<ReverseCurve<T, Self>, ReverseError>where
Self: Sized,
fn reverse(self) -> Result<ReverseCurve<T, Self>, ReverseError>where
Self: Sized,
source§fn repeat(self, count: usize) -> Result<RepeatCurve<T, Self>, RepeatError>where
Self: Sized,
fn repeat(self, count: usize) -> Result<RepeatCurve<T, Self>, RepeatError>where
Self: Sized,
source§fn forever(self) -> Result<ForeverCurve<T, Self>, RepeatError>where
Self: Sized,
fn forever(self) -> Result<ForeverCurve<T, Self>, RepeatError>where
Self: Sized,
source§fn ping_pong(self) -> Result<PingPongCurve<T, Self>, PingPongError>where
Self: Sized,
fn ping_pong(self) -> Result<PingPongCurve<T, Self>, PingPongError>where
Self: Sized,
source§fn chain_continue<C>(
self,
other: C,
) -> Result<ContinuationCurve<T, Self, C>, ChainError>
fn chain_continue<C>( self, other: C, ) -> Result<ContinuationCurve<T, Self, C>, ChainError>
source§fn resample<I>(
&self,
segments: usize,
interpolation: I,
) -> Result<SampleCurve<T, I>, ResamplingError>
fn resample<I>( &self, segments: usize, interpolation: I, ) -> Result<SampleCurve<T, I>, ResamplingError>
Curve
to produce a new one that is defined by interpolation over equally
spaced sample values, using the provided interpolation
to interpolate between adjacent samples.
The curve is interpolated on segments
segments between samples. For example, if segments
is 1,
only the start and end points of the curve are used as samples; if segments
is 2, a sample at
the midpoint is taken as well, and so on. If segments
is zero, or if this curve has an unbounded
domain, then a ResamplingError
is returned. Read moresource§fn resample_auto(
&self,
segments: usize,
) -> Result<SampleAutoCurve<T>, ResamplingError>where
Self: Sized,
T: StableInterpolate,
fn resample_auto(
&self,
segments: usize,
) -> Result<SampleAutoCurve<T>, ResamplingError>where
Self: Sized,
T: StableInterpolate,
Curve
to produce a new one that is defined by interpolation over equally
spaced sample values, using automatic interpolation to interpolate between adjacent samples.
The curve is interpolated on segments
segments between samples. For example, if segments
is 1,
only the start and end points of the curve are used as samples; if segments
is 2, a sample at
the midpoint is taken as well, and so on. If segments
is zero, or if this curve has an unbounded
domain, then a ResamplingError
is returned.source§fn samples(
&self,
samples: usize,
) -> Result<impl Iterator<Item = T>, ResamplingError>where
Self: Sized,
fn samples(
&self,
samples: usize,
) -> Result<impl Iterator<Item = T>, ResamplingError>where
Self: Sized,
samples
is less than 2
or if this curve has unbounded domain, then an error is returned instead.source§fn resample_uneven<I>(
&self,
sample_times: impl IntoIterator<Item = f32>,
interpolation: I,
) -> Result<UnevenSampleCurve<T, I>, ResamplingError>
fn resample_uneven<I>( &self, sample_times: impl IntoIterator<Item = f32>, interpolation: I, ) -> Result<UnevenSampleCurve<T, I>, ResamplingError>
source§fn resample_uneven_auto(
&self,
sample_times: impl IntoIterator<Item = f32>,
) -> Result<UnevenSampleAutoCurve<T>, ResamplingError>where
Self: Sized,
T: StableInterpolate,
fn resample_uneven_auto(
&self,
sample_times: impl IntoIterator<Item = f32>,
) -> Result<UnevenSampleAutoCurve<T>, ResamplingError>where
Self: Sized,
T: StableInterpolate,
Curve
to produce a new one that is defined by automatic interpolation over
samples taken at the given set of times. The given sample_times
are expected to contain at least
two valid times within the curve’s domain interval. Read moresource§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
source§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
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
.source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.source§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
source§impl<T> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
source§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
source§impl<T> IntoEither for T
impl<T> IntoEither for T
source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
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 moresource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
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