pub struct Deferred<'a, T>(/* private fields */)
where
T: SystemBuffer;
Expand description
A SystemParam
that stores a buffer which gets applied to the World
during
apply_deferred
.
This is used internally by Commands
to defer World
mutations.
§Examples
By using this type to defer mutations, you can avoid mutable World
access within
a system, which allows it to run in parallel with more systems.
Note that deferring mutations is not free, and should only be used if
the gains in parallelization outweigh the time it takes to apply deferred mutations.
In general, Deferred
should only be used for mutations that are infrequent,
or which otherwise take up a small portion of a system’s run-time.
// Tracks whether or not there is a threat the player should be aware of.
#[derive(Resource, Default)]
pub struct Alarm(bool);
#[derive(Component)]
pub struct Settlement {
// ...
}
// A threat from inside the settlement.
#[derive(Component)]
pub struct Criminal;
// A threat from outside the settlement.
#[derive(Component)]
pub struct Monster;
use bevy_ecs::system::{Deferred, SystemBuffer, SystemMeta};
// Uses deferred mutations to allow signaling the alarm from multiple systems in parallel.
#[derive(Resource, Default)]
struct AlarmFlag(bool);
impl AlarmFlag {
/// Sounds the alarm the next time buffers are applied via apply_deferred.
pub fn flag(&mut self) {
self.0 = true;
}
}
impl SystemBuffer for AlarmFlag {
// When `AlarmFlag` is used in a system, this function will get
// called the next time buffers are applied via apply_deferred.
fn apply(&mut self, system_meta: &SystemMeta, world: &mut World) {
if self.0 {
world.resource_mut::<Alarm>().0 = true;
self.0 = false;
}
}
}
// Sound the alarm if there are any criminals who pose a threat.
fn alert_criminal(
settlement: Single<&Settlement>,
criminals: Query<&Criminal>,
mut alarm: Deferred<AlarmFlag>
) {
for criminal in &criminals {
// Only sound the alarm if the criminal is a threat.
// For this example, assume that this check is expensive to run.
// Since the majority of this system's run-time is dominated
// by calling `is_threat()`, we defer sounding the alarm to
// allow this system to run in parallel with other alarm systems.
if criminal.is_threat(*settlement) {
alarm.flag();
}
}
}
// Sound the alarm if there is a monster.
fn alert_monster(
monsters: Query<&Monster>,
mut alarm: ResMut<Alarm>
) {
if monsters.iter().next().is_some() {
// Since this system does nothing except for sounding the alarm,
// it would be pointless to defer it, so we sound the alarm directly.
alarm.0 = true;
}
}
let mut world = World::new();
world.init_resource::<Alarm>();
world.spawn(Settlement {
// ...
});
let mut schedule = Schedule::default();
// These two systems have no conflicts and will run in parallel.
schedule.add_systems((alert_criminal, alert_monster));
// There are no criminals or monsters, so the alarm is not sounded.
schedule.run(&mut world);
assert_eq!(world.resource::<Alarm>().0, false);
// Spawn a monster, which will cause the alarm to be sounded.
let m_id = world.spawn(Monster).id();
schedule.run(&mut world);
assert_eq!(world.resource::<Alarm>().0, true);
// Remove the monster and reset the alarm.
world.entity_mut(m_id).despawn();
world.resource_mut::<Alarm>().0 = false;
// Spawn a criminal, which will cause the alarm to be sounded.
world.spawn(Criminal);
schedule.run(&mut world);
assert_eq!(world.resource::<Alarm>().0, true);
Implementations§
source§impl<T> Deferred<'_, T>where
T: SystemBuffer,
impl<T> Deferred<'_, T>where
T: SystemBuffer,
sourcepub fn reborrow(&mut self) -> Deferred<'_, T>
pub fn reborrow(&mut self) -> Deferred<'_, T>
Returns a Deferred<T>
with a smaller lifetime.
This is useful if you have &mut Deferred<T>
but need Deferred<T>
.
Trait Implementations§
source§impl<'a, T> Deref for Deferred<'a, T>where
T: SystemBuffer,
impl<'a, T> Deref for Deferred<'a, T>where
T: SystemBuffer,
source§impl<'a, T> DerefMut for Deferred<'a, T>where
T: SystemBuffer,
impl<'a, T> DerefMut for Deferred<'a, T>where
T: SystemBuffer,
source§impl<T> SystemParam for Deferred<'_, T>where
T: SystemBuffer,
impl<T> SystemParam for Deferred<'_, T>where
T: SystemBuffer,
source§type Item<'w, 's> = Deferred<'s, T>
type Item<'w, 's> = Deferred<'s, T>
The item type returned when constructing this system param.
The value of this associated type should be
Self
, instantiated with new lifetimes. Read moresource§fn init_state(
world: &mut World,
system_meta: &mut SystemMeta,
) -> <Deferred<'_, T> as SystemParam>::State
fn init_state( world: &mut World, system_meta: &mut SystemMeta, ) -> <Deferred<'_, T> as SystemParam>::State
Registers any
World
access used by this SystemParam
and creates a new instance of this param’s State
.source§fn apply(
state: &mut <Deferred<'_, T> as SystemParam>::State,
system_meta: &SystemMeta,
world: &mut World,
)
fn apply( state: &mut <Deferred<'_, T> as SystemParam>::State, system_meta: &SystemMeta, world: &mut World, )
Applies any deferred mutations stored in this
SystemParam
’s state.
This is used to apply Commands
during apply_deferred
.source§fn queue(
state: &mut <Deferred<'_, T> as SystemParam>::State,
system_meta: &SystemMeta,
world: DeferredWorld<'_>,
)
fn queue( state: &mut <Deferred<'_, T> as SystemParam>::State, system_meta: &SystemMeta, world: DeferredWorld<'_>, )
Queues any deferred mutations to be applied at the next
apply_deferred
.source§unsafe fn get_param<'w, 's>(
state: &'s mut <Deferred<'_, T> as SystemParam>::State,
_system_meta: &SystemMeta,
_world: UnsafeWorldCell<'w>,
_change_tick: Tick,
) -> <Deferred<'_, T> as SystemParam>::Item<'w, 's>
unsafe fn get_param<'w, 's>( state: &'s mut <Deferred<'_, T> as SystemParam>::State, _system_meta: &SystemMeta, _world: UnsafeWorldCell<'w>, _change_tick: Tick, ) -> <Deferred<'_, T> as SystemParam>::Item<'w, 's>
Creates a parameter to be passed into a
SystemParamFunction
. Read moresource§unsafe fn new_archetype(
state: &mut Self::State,
archetype: &Archetype,
system_meta: &mut SystemMeta,
)
unsafe fn new_archetype( state: &mut Self::State, archetype: &Archetype, system_meta: &mut SystemMeta, )
For the specified
Archetype
, registers the components accessed by this SystemParam
(if applicable).a Read moresource§unsafe fn validate_param(
_state: &Self::State,
_system_meta: &SystemMeta,
_world: UnsafeWorldCell<'_>,
) -> bool
unsafe fn validate_param( _state: &Self::State, _system_meta: &SystemMeta, _world: UnsafeWorldCell<'_>, ) -> bool
Validates that the param can be acquired by the
get_param
.
Built-in executors use this to prevent systems with invalid params from running.
For nested SystemParam
s validation will fail if any
delegated validation fails. Read moreimpl<T> ReadOnlySystemParam for Deferred<'_, T>where
T: SystemBuffer,
Auto Trait Implementations§
impl<'a, T> Freeze for Deferred<'a, T>
impl<'a, T> RefUnwindSafe for Deferred<'a, T>where
T: RefUnwindSafe,
impl<'a, T> Send for Deferred<'a, T>
impl<'a, T> Sync for Deferred<'a, T>where
T: Sync,
impl<'a, T> Unpin for Deferred<'a, T>
impl<'a, T> !UnwindSafe for Deferred<'a, T>
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
Mutably borrows from an owned value. Read more
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
Sample a point on this curve at the parameter value
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>
Sample a point on this curve at the parameter value
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
Sample a point on this curve at the parameter value
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,
Sample a collection of
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,
Sample a collection of
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,
Sample a collection of
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>
Create a new curve by mapping the values of this curve via a function
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>
Create a new
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,
Linearly reparametrize this
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>
Resample this
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,
Resample this
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,
Extract an iterator over evenly-spaced samples from this curve. If
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,
Resample this
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>
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
.source§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
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
.source§fn as_any(&self) -> &(dyn Any + 'static)
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.source§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
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.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> ⓘ
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 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> ⓘ
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