pub struct NonSendMut<'w, T>where
T: 'static + ?Sized,{ /* private fields */ }
Expand description
Unique borrow of a non-Send
resource.
Only Send
resources may be accessed with the ResMut
SystemParam
. In case that the
resource does not implement Send
, this SystemParam
wrapper can be used. This will instruct
the scheduler to instead run the system on the main thread so that it doesn’t send the resource
over to another thread.
This SystemParam
fails validation if non-send resource doesn’t exist.
This will cause systems that use this parameter to be skipped.
Use Option<NonSendMut<T>>
instead if the resource might not always exist.
Implementations§
source§impl<'w, T> NonSendMut<'w, T>where
T: ?Sized,
impl<'w, T> NonSendMut<'w, T>where
T: ?Sized,
sourcepub fn into_inner(self) -> &'w mut T
pub fn into_inner(self) -> &'w mut T
Consume self
and return a mutable reference to the
contained value while marking self
as “changed”.
sourcepub fn reborrow(&mut self) -> Mut<'_, T>
pub fn reborrow(&mut self) -> Mut<'_, T>
Returns a Mut<>
with a smaller lifetime.
This is useful if you have &mut NonSendMut <T>
, but you need a Mut<T>
.
sourcepub fn map_unchanged<U>(self, f: impl FnOnce(&mut T) -> &mut U) -> Mut<'w, U>where
U: ?Sized,
pub fn map_unchanged<U>(self, f: impl FnOnce(&mut T) -> &mut U) -> Mut<'w, U>where
U: ?Sized,
Maps to an inner value by applying a function to the contained reference, without flagging a change.
You should never modify the argument passed to the closure – if you want to modify the data
without flagging a change, consider using DetectChangesMut::bypass_change_detection
to make your intent explicit.
// When run, zeroes the translation of every entity.
fn reset_positions(mut transforms: Query<&mut Transform>) {
for transform in &mut transforms {
// We pinky promise not to modify `t` within the closure.
// Breaking this promise will result in logic errors, but will never cause undefined behavior.
let mut translation = transform.map_unchanged(|t| &mut t.translation);
// Only reset the translation if it isn't already zero;
translation.set_if_neq(Vec2::ZERO);
}
}
sourcepub fn filter_map_unchanged<U>(
self,
f: impl FnOnce(&mut T) -> Option<&mut U>,
) -> Option<Mut<'w, U>>where
U: ?Sized,
pub fn filter_map_unchanged<U>(
self,
f: impl FnOnce(&mut T) -> Option<&mut U>,
) -> Option<Mut<'w, U>>where
U: ?Sized,
Optionally maps to an inner value by applying a function to the contained reference.
This is useful in a situation where you need to convert a Mut<T>
to a Mut<U>
, but only if T
contains U
.
As with map_unchanged
, you should never modify the argument passed to the closure.
Trait Implementations§
source§impl<'w, T> AsMut<T> for NonSendMut<'w, T>
impl<'w, T> AsMut<T> for NonSendMut<'w, T>
source§impl<'w, T> AsRef<T> for NonSendMut<'w, T>
impl<'w, T> AsRef<T> for NonSendMut<'w, T>
source§impl<'w, T> Debug for NonSendMut<'w, T>
impl<'w, T> Debug for NonSendMut<'w, T>
source§impl<'w, T> Deref for NonSendMut<'w, T>where
T: ?Sized,
impl<'w, T> Deref for NonSendMut<'w, T>where
T: ?Sized,
source§impl<'w, T> DerefMut for NonSendMut<'w, T>where
T: ?Sized,
impl<'w, T> DerefMut for NonSendMut<'w, T>where
T: ?Sized,
source§impl<'w, T> DetectChanges for NonSendMut<'w, T>where
T: ?Sized,
impl<'w, T> DetectChanges for NonSendMut<'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, T> DetectChangesMut for NonSendMut<'w, T>where
T: ?Sized,
impl<'w, T> DetectChangesMut for NonSendMut<'w, T>where
T: ?Sized,
source§fn set_changed(&mut self)
fn set_changed(&mut self)
source§fn set_last_changed(&mut self, last_changed: Tick)
fn set_last_changed(&mut self, last_changed: Tick)
source§fn bypass_change_detection(
&mut self,
) -> &mut <NonSendMut<'w, T> as DetectChangesMut>::Inner
fn bypass_change_detection( &mut self, ) -> &mut <NonSendMut<'w, T> as DetectChangesMut>::Inner
source§impl<'a, T> From<NonSendMut<'a, T>> for NonSend<'a, T>
impl<'a, T> From<NonSendMut<'a, T>> for NonSend<'a, T>
source§fn from(nsm: NonSendMut<'a, T>) -> NonSend<'a, T>
fn from(nsm: NonSendMut<'a, T>) -> NonSend<'a, T>
source§impl<'w, T> From<NonSendMut<'w, T>> for Mut<'w, T>where
T: 'static,
impl<'w, T> From<NonSendMut<'w, T>> for Mut<'w, T>where
T: 'static,
source§fn from(other: NonSendMut<'w, T>) -> Mut<'w, T>
fn from(other: NonSendMut<'w, T>) -> Mut<'w, T>
Convert this NonSendMut
into a Mut
. This allows keeping the change-detection feature of Mut
while losing the specificity of NonSendMut
.
source§impl<'a, T> SystemParam for NonSendMut<'a, T>where
T: 'static,
impl<'a, T> SystemParam for NonSendMut<'a, T>where
T: 'static,
source§type State = ComponentId
type State = ComponentId
source§type Item<'w, 's> = NonSendMut<'w, T>
type Item<'w, 's> = NonSendMut<'w, T>
Self
, instantiated with new lifetimes. Read moresource§fn init_state(
world: &mut World,
system_meta: &mut SystemMeta,
) -> <NonSendMut<'a, T> as SystemParam>::State
fn init_state( world: &mut World, system_meta: &mut SystemMeta, ) -> <NonSendMut<'a, T> as SystemParam>::State
World
access used by this SystemParam
and creates a new instance of this param’s State
.source§unsafe fn validate_param(
_: &<NonSendMut<'a, T> as SystemParam>::State,
system_meta: &SystemMeta,
world: UnsafeWorldCell<'_>,
) -> bool
unsafe fn validate_param( _: &<NonSendMut<'a, T> as SystemParam>::State, system_meta: &SystemMeta, world: UnsafeWorldCell<'_>, ) -> bool
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 moresource§unsafe fn get_param<'w, 's>(
_: &'s mut <NonSendMut<'a, T> as SystemParam>::State,
system_meta: &SystemMeta,
world: UnsafeWorldCell<'w>,
change_tick: Tick,
) -> <NonSendMut<'a, T> as SystemParam>::Item<'w, 's>
unsafe fn get_param<'w, 's>( _: &'s mut <NonSendMut<'a, T> as SystemParam>::State, system_meta: &SystemMeta, world: UnsafeWorldCell<'w>, change_tick: Tick, ) -> <NonSendMut<'a, T> as SystemParam>::Item<'w, 's>
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, )
Archetype
, registers the components accessed by this SystemParam
(if applicable).a Read moresource§fn apply(state: &mut Self::State, system_meta: &SystemMeta, world: &mut World)
fn apply(state: &mut Self::State, system_meta: &SystemMeta, world: &mut World)
SystemParam
’s state.
This is used to apply Commands
during apply_deferred
.source§fn queue(
state: &mut Self::State,
system_meta: &SystemMeta,
world: DeferredWorld<'_>,
)
fn queue( state: &mut Self::State, system_meta: &SystemMeta, world: DeferredWorld<'_>, )
apply_deferred
.Auto Trait Implementations§
impl<'w, T> Freeze for NonSendMut<'w, T>where
T: ?Sized,
impl<'w, T> RefUnwindSafe for NonSendMut<'w, T>where
T: RefUnwindSafe + ?Sized,
impl<'w, T> Send for NonSendMut<'w, T>
impl<'w, T> Sync for NonSendMut<'w, T>
impl<'w, T> Unpin for NonSendMut<'w, T>where
T: ?Sized,
impl<'w, T> !UnwindSafe for NonSendMut<'w, 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
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