pub struct AutoInsertApplyDeferredPass { /* private fields */ }
Expand description
A ScheduleBuildPass
that inserts ApplyDeferred
systems into the schedule graph
when there are Deferred
in one system and there are ordering dependencies on that system. Commands
is one
such deferred buffer.
This pass is typically automatically added to the schedule. You can disable this by setting
ScheduleBuildSettings::auto_insert_apply_deferred
to false
. You may want to disable this if you only want to sync deferred params at the end of the schedule,
or want to manually insert all your sync points.
Trait Implementations§
Source§impl Debug for AutoInsertApplyDeferredPass
impl Debug for AutoInsertApplyDeferredPass
Source§impl Default for AutoInsertApplyDeferredPass
impl Default for AutoInsertApplyDeferredPass
Source§fn default() -> AutoInsertApplyDeferredPass
fn default() -> AutoInsertApplyDeferredPass
Returns the “default value” for a type. Read more
Source§impl ScheduleBuildPass for AutoInsertApplyDeferredPass
impl ScheduleBuildPass for AutoInsertApplyDeferredPass
Source§type EdgeOptions = IgnoreDeferred
type EdgeOptions = IgnoreDeferred
Custom options for dependencies between sets or systems.
Source§fn add_dependency(
&mut self,
from: NodeId,
to: NodeId,
options: Option<&<AutoInsertApplyDeferredPass as ScheduleBuildPass>::EdgeOptions>,
)
fn add_dependency( &mut self, from: NodeId, to: NodeId, options: Option<&<AutoInsertApplyDeferredPass as ScheduleBuildPass>::EdgeOptions>, )
Called when a dependency between sets or systems was explicitly added to the graph.
Source§fn build(
&mut self,
_world: &mut World,
graph: &mut ScheduleGraph,
dependency_flattened: &mut Graph<true>,
) -> Result<(), ScheduleBuildError>
fn build( &mut self, _world: &mut World, graph: &mut ScheduleGraph, dependency_flattened: &mut Graph<true>, ) -> Result<(), ScheduleBuildError>
The implementation will be able to modify the
ScheduleGraph
here.Source§fn collapse_set(
&mut self,
set: NodeId,
systems: &[NodeId],
dependency_flattened: &Graph<true>,
) -> impl Iterator<Item = (NodeId, NodeId)>
fn collapse_set( &mut self, set: NodeId, systems: &[NodeId], dependency_flattened: &Graph<true>, ) -> impl Iterator<Item = (NodeId, NodeId)>
Called while flattening the dependency graph. For each
set
, this method is called
with the systems
associated with the set as well as an immutable reference to the current graph.
Instead of modifying the graph directly, this method should return an iterator of edges to add to the graph.Auto Trait Implementations§
impl Freeze for AutoInsertApplyDeferredPass
impl RefUnwindSafe for AutoInsertApplyDeferredPass
impl Send for AutoInsertApplyDeferredPass
impl Sync for AutoInsertApplyDeferredPass
impl Unpin for AutoInsertApplyDeferredPass
impl UnwindSafe for AutoInsertApplyDeferredPass
Blanket Implementations§
Source§impl<T, U> AsBindGroupShaderType<U> for T
impl<T, U> AsBindGroupShaderType<U> for T
Source§fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U
fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U
Return the
T
ShaderType
for self
. When used in AsBindGroup
derives, it is safe to assume that all images in self
exist.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> 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>
Converts
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
, which can then be
downcast
into Box<dyn 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>
Converts
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
, which 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)
Converts
&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)
Converts
&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> 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> DowncastSend for T
impl<T> DowncastSend for T
Source§impl<T> DowncastSync for T
impl<T> DowncastSync for T
Source§impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
Source§fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Creates Self
using default()
.
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