Struct valence::ecs::system::CombinatorSystem
pub struct CombinatorSystem<Func, A, B> { /* private fields */ }
Expand description
Implementations§
§impl<Func, A, B> CombinatorSystem<Func, A, B>
impl<Func, A, B> CombinatorSystem<Func, A, B>
pub const fn new(
a: A,
b: B,
name: Cow<'static, str>,
) -> CombinatorSystem<Func, A, B>
pub const fn new( a: A, b: B, name: Cow<'static, str>, ) -> CombinatorSystem<Func, A, B>
Creates a new system that combines two inner systems.
The returned system will only be usable if Func
implements Combine<A, B>
.
Trait Implementations§
§impl<Func, A, B> Clone for CombinatorSystem<Func, A, B>
impl<Func, A, B> Clone for CombinatorSystem<Func, A, B>
§fn clone(&self) -> CombinatorSystem<Func, A, B>
fn clone(&self) -> CombinatorSystem<Func, A, B>
Clone the combined system. The cloned instance must be .initialize()
d before it can run.
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read more§impl<A, B, Func> ReadOnlySystem for CombinatorSystem<Func, A, B>
impl<A, B, Func> ReadOnlySystem for CombinatorSystem<Func, A, B>
SAFETY: Both systems are read-only, so any system created by combining them will only read from the world.
§impl<A, B, Func> System for CombinatorSystem<Func, A, B>
impl<A, B, Func> System for CombinatorSystem<Func, A, B>
§fn component_access(&self) -> &Access<ComponentId>
fn component_access(&self) -> &Access<ComponentId>
Returns the system’s component
Access
.§fn archetype_component_access(&self) -> &Access<ArchetypeComponentId>
fn archetype_component_access(&self) -> &Access<ArchetypeComponentId>
Returns the system’s archetype component
Access
.§fn is_exclusive(&self) -> bool
fn is_exclusive(&self) -> bool
Returns true if the system must be run exclusively.
§fn has_deferred(&self) -> bool
fn has_deferred(&self) -> bool
Returns true if system as deferred buffers
§unsafe fn run_unsafe(
&mut self,
input: <CombinatorSystem<Func, A, B> as System>::In,
world: UnsafeWorldCell<'_>,
) -> <CombinatorSystem<Func, A, B> as System>::Out
unsafe fn run_unsafe( &mut self, input: <CombinatorSystem<Func, A, B> as System>::In, world: UnsafeWorldCell<'_>, ) -> <CombinatorSystem<Func, A, B> as System>::Out
Runs the system with the given input in the world. Unlike
System::run
, this function
can be called in parallel with other systems and may break Rust’s aliasing rules
if used incorrectly, making it unsafe to call. Read more§fn run<'w>(
&mut self,
input: <CombinatorSystem<Func, A, B> as System>::In,
world: &'w mut World,
) -> <CombinatorSystem<Func, A, B> as System>::Out
fn run<'w>( &mut self, input: <CombinatorSystem<Func, A, B> as System>::In, world: &'w mut World, ) -> <CombinatorSystem<Func, A, B> as System>::Out
Runs the system with the given input in the world. Read more
§fn apply_deferred(&mut self, world: &mut World)
fn apply_deferred(&mut self, world: &mut World)
§fn queue_deferred(&mut self, world: DeferredWorld<'_>)
fn queue_deferred(&mut self, world: DeferredWorld<'_>)
Enqueues any
Deferred
system parameters (or other system buffers)
of this system into the world’s command buffer.§fn initialize(&mut self, world: &mut World)
fn initialize(&mut self, world: &mut World)
Initialize the system.
§fn update_archetype_component_access(&mut self, world: UnsafeWorldCell<'_>)
fn update_archetype_component_access(&mut self, world: UnsafeWorldCell<'_>)
§fn check_change_tick(&mut self, change_tick: Tick)
fn check_change_tick(&mut self, change_tick: Tick)
§fn default_system_sets(&self) -> Vec<Interned<dyn SystemSet>>
fn default_system_sets(&self) -> Vec<Interned<dyn SystemSet>>
Returns the system’s default system sets. Read more
§fn get_last_run(&self) -> Tick
fn get_last_run(&self) -> Tick
Gets the tick indicating the last time this system ran.
§fn set_last_run(&mut self, last_run: Tick)
fn set_last_run(&mut self, last_run: Tick)
Overwrites the tick indicating the last time this system ran. Read more
Auto Trait Implementations§
impl<Func, A, B> Freeze for CombinatorSystem<Func, A, B>
impl<Func, A, B> RefUnwindSafe for CombinatorSystem<Func, A, B>where
A: RefUnwindSafe,
B: RefUnwindSafe,
impl<Func, A, B> Send for CombinatorSystem<Func, A, B>
impl<Func, A, B> Sync for CombinatorSystem<Func, A, B>
impl<Func, A, B> Unpin for CombinatorSystem<Func, A, B>
impl<Func, A, B> UnwindSafe for CombinatorSystem<Func, A, B>where
A: UnwindSafe,
B: UnwindSafe,
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
source§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<Marker, In, F> Condition<Marker, In> for Fwhere
F: Condition<Marker, In>,
impl<Marker, In, F> Condition<Marker, In> for Fwhere
F: Condition<Marker, In>,
§fn and_then<M, C>(
self,
and_then: C,
) -> CombinatorSystem<AndThenMarker, Self::System, <C as IntoSystem<In, bool, M>>::System>where
C: Condition<M, In>,
fn and_then<M, C>(
self,
and_then: C,
) -> CombinatorSystem<AndThenMarker, Self::System, <C as IntoSystem<In, bool, M>>::System>where
C: Condition<M, In>,
Returns a new run condition that only returns
true
if both this one and the passed and_then
return true
. Read more§fn or_else<M, C>(
self,
or_else: C,
) -> CombinatorSystem<OrElseMarker, Self::System, <C as IntoSystem<In, bool, M>>::System>where
C: Condition<M, In>,
fn or_else<M, C>(
self,
or_else: C,
) -> CombinatorSystem<OrElseMarker, Self::System, <C as IntoSystem<In, bool, M>>::System>where
C: Condition<M, In>,
Returns a new run condition that returns
true
if either this one or the passed or_else
return true
. Read more§impl<T> Conv for T
impl<T> Conv for T
§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§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
.§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
.§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.§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.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> FmtForward for T
impl<T> FmtForward for T
§fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
fn fmt_binary(self) -> FmtBinary<Self>where
Self: Binary,
Causes
self
to use its Binary
implementation when Debug
-formatted.§fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
fn fmt_display(self) -> FmtDisplay<Self>where
Self: Display,
Causes
self
to use its Display
implementation when
Debug
-formatted.§fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
fn fmt_lower_exp(self) -> FmtLowerExp<Self>where
Self: LowerExp,
Causes
self
to use its LowerExp
implementation when
Debug
-formatted.§fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
fn fmt_lower_hex(self) -> FmtLowerHex<Self>where
Self: LowerHex,
Causes
self
to use its LowerHex
implementation when
Debug
-formatted.§fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
fn fmt_octal(self) -> FmtOctal<Self>where
Self: Octal,
Causes
self
to use its Octal
implementation when Debug
-formatted.§fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
fn fmt_pointer(self) -> FmtPointer<Self>where
Self: Pointer,
Causes
self
to use its Pointer
implementation when
Debug
-formatted.§fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
fn fmt_upper_exp(self) -> FmtUpperExp<Self>where
Self: UpperExp,
Causes
self
to use its UpperExp
implementation when
Debug
-formatted.§fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
fn fmt_upper_hex(self) -> FmtUpperHex<Self>where
Self: UpperHex,
Causes
self
to use its UpperHex
implementation when
Debug
-formatted.§fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
fn fmt_list(self) -> FmtList<Self>where
&'a Self: for<'a> IntoIterator,
Formats each item in a sequence. Read more
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
§impl<S, M, Out, E, B> IntoObserverSystem<E, B, M, Out> for Swhere
S: IntoSystem<Trigger<'static, E, B>, Out, M> + Send + 'static,
E: 'static,
B: Bundle,
<S as IntoSystem<Trigger<'static, E, B>, Out, M>>::System: ObserverSystem<E, B, Out>,
impl<S, M, Out, E, B> IntoObserverSystem<E, B, M, Out> for Swhere
S: IntoSystem<Trigger<'static, E, B>, Out, M> + Send + 'static,
E: 'static,
B: Bundle,
<S as IntoSystem<Trigger<'static, E, B>, Out, M>>::System: ObserverSystem<E, B, Out>,
§type System = <S as IntoSystem<Trigger<'static, E, B>, Out, M>>::System
type System = <S as IntoSystem<Trigger<'static, E, B>, Out, M>>::System
The type of
System
that this instance converts into.§fn into_system(this: S) -> <S as IntoObserverSystem<E, B, M, Out>>::System
fn into_system(this: S) -> <S as IntoObserverSystem<E, B, M, Out>>::System
Turns this value into its corresponding
System
.§impl<T> IntoSystem<<T as System>::In, <T as System>::Out, ()> for Twhere
T: System,
impl<T> IntoSystem<<T as System>::In, <T as System>::Out, ()> for Twhere
T: System,
§fn into_system(this: T) -> T
fn into_system(this: T) -> T
Turns this value into its corresponding
System
.§fn pipe<B, Final, MarkerB>(
self,
system: B,
) -> CombinatorSystem<Pipe, Self::System, <B as IntoSystem<Out, Final, MarkerB>>::System>where
B: IntoSystem<Out, Final, MarkerB>,
fn pipe<B, Final, MarkerB>(
self,
system: B,
) -> CombinatorSystem<Pipe, Self::System, <B as IntoSystem<Out, Final, MarkerB>>::System>where
B: IntoSystem<Out, Final, MarkerB>,
§fn map<T, F>(self, f: F) -> AdapterSystem<F, Self::System>
fn map<T, F>(self, f: F) -> AdapterSystem<F, Self::System>
Pass the output of this system into the passed function
f
, creating a new system that
outputs the value returned from the function. Read more§fn system_type_id(&self) -> TypeId
fn system_type_id(&self) -> TypeId
§impl<Marker, F> IntoSystemConfigs<Marker> for F
impl<Marker, F> IntoSystemConfigs<Marker> for F
§fn into_configs(self) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn into_configs(self) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Convert into a
SystemConfigs
.§fn in_set(
self,
set: impl SystemSet,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn in_set( self, set: impl SystemSet, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Add these systems to the provided
set
.§fn before<M>(
self,
set: impl IntoSystemSet<M>,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn before<M>( self, set: impl IntoSystemSet<M>, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
§fn after<M>(
self,
set: impl IntoSystemSet<M>,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn after<M>( self, set: impl IntoSystemSet<M>, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
§fn before_ignore_deferred<M>(
self,
set: impl IntoSystemSet<M>,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn before_ignore_deferred<M>( self, set: impl IntoSystemSet<M>, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Run before all systems in
set
. Read more§fn after_ignore_deferred<M>(
self,
set: impl IntoSystemSet<M>,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn after_ignore_deferred<M>( self, set: impl IntoSystemSet<M>, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Run after all systems in
set
. Read more§fn distributive_run_if<M>(
self,
condition: impl Condition<M> + Clone,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn distributive_run_if<M>( self, condition: impl Condition<M> + Clone, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Add a run condition to each contained system. Read more
§fn run_if<M>(
self,
condition: impl Condition<M>,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn run_if<M>( self, condition: impl Condition<M>, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
§fn ambiguous_with<M>(
self,
set: impl IntoSystemSet<M>,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn ambiguous_with<M>( self, set: impl IntoSystemSet<M>, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Suppress warnings and errors that would result from these systems having ambiguities
(conflicting access but indeterminate order) with systems in
set
.§fn ambiguous_with_all(self) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn ambiguous_with_all(self) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Suppress warnings and errors that would result from these systems having ambiguities
(conflicting access but indeterminate order) with any other system.
§fn chain(self) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn chain(self) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Treat this collection as a sequence of systems. Read more
§fn chain_ignore_deferred(
self,
) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
fn chain_ignore_deferred( self, ) -> NodeConfigs<Box<dyn System<In = (), Out = ()>>>
Treat this collection as a sequence of systems. Read more
§impl<T> Pipe for Twhere
T: ?Sized,
impl<T> Pipe for Twhere
T: ?Sized,
§fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> Rwhere
Self: Sized,
Pipes by value. This is generally the method you want to use. Read more
§fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> Rwhere
R: 'a,
Borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> Rwhere
R: 'a,
Mutably borrows
self
and passes that borrow into the pipe function. Read more§fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
§fn pipe_borrow_mut<'a, B, R>(
&'a mut self,
func: impl FnOnce(&'a mut B) -> R,
) -> R
fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
§fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
Borrows
self
, then passes self.as_ref()
into the pipe function.§fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
Mutably borrows
self
, then passes self.as_mut()
into the pipe
function.§fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
Borrows
self
, then passes self.deref()
into the pipe function.§impl<T> Tap for T
impl<T> Tap for T
§fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
Immutable access to the
Borrow<B>
of a value. Read more§fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
Mutable access to the
BorrowMut<B>
of a value. Read more§fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
Immutable access to the
AsRef<R>
view of a value. Read more§fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
Mutable access to the
AsMut<R>
view of a value. Read more§fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
Immutable access to the
Deref::Target
of a value. Read more§fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
Mutable access to the
Deref::Target
of a value. Read more§fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self
Calls
.tap()
only in debug builds, and is erased in release builds.§fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self
Calls
.tap_mut()
only in debug builds, and is erased in release
builds.§fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
Calls
.tap_borrow()
only in debug builds, and is erased in release
builds.§fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
Calls
.tap_borrow_mut()
only in debug builds, and is erased in release
builds.§fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
Calls
.tap_ref()
only in debug builds, and is erased in release
builds.§fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
Calls
.tap_ref_mut()
only in debug builds, and is erased in release
builds.§fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
Calls
.tap_deref()
only in debug builds, and is erased in release
builds.