pub struct Schedules {
pub ignored_scheduling_ambiguities: BTreeSet<ComponentId>,
/* private fields */
}
Expand description
Resource that stores Schedule
s mapped to ScheduleLabel
s excluding the current running Schedule
.
Fields§
§ignored_scheduling_ambiguities: BTreeSet<ComponentId>
List of ComponentId
s to ignore when reporting system order ambiguity conflicts
Implementations§
§impl Schedules
impl Schedules
pub fn insert(&mut self, schedule: Schedule) -> Option<Schedule>
pub fn insert(&mut self, schedule: Schedule) -> Option<Schedule>
Inserts a labeled schedule into the map.
If the map already had an entry for label
, schedule
is inserted,
and the old schedule is returned. Otherwise, None
is returned.
pub fn remove(&mut self, label: impl ScheduleLabel) -> Option<Schedule>
pub fn remove(&mut self, label: impl ScheduleLabel) -> Option<Schedule>
Removes the schedule corresponding to the label
from the map, returning it if it existed.
pub fn remove_entry(
&mut self,
label: impl ScheduleLabel
) -> Option<(Interned<dyn ScheduleLabel>, Schedule)>
pub fn remove_entry( &mut self, label: impl ScheduleLabel ) -> Option<(Interned<dyn ScheduleLabel>, Schedule)>
Removes the (schedule, label) pair corresponding to the label
from the map, returning it if it existed.
pub fn contains(&self, label: impl ScheduleLabel) -> bool
pub fn contains(&self, label: impl ScheduleLabel) -> bool
Does a schedule with the provided label already exist?
pub fn get(&self, label: impl ScheduleLabel) -> Option<&Schedule>
pub fn get(&self, label: impl ScheduleLabel) -> Option<&Schedule>
Returns a reference to the schedule associated with label
, if it exists.
Examples found in repository?
101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187
fn build_ui(
mut commands: Commands,
asset_server: Res<AssetServer>,
schedules: Res<Schedules>,
mut stepping: ResMut<Stepping>,
mut state: ResMut<State>,
) {
let mut text_sections = Vec::new();
let mut always_run = Vec::new();
let Ok(schedule_order) = stepping.schedules() else {
return;
};
// go through the stepping schedules and construct a list of systems for
// each label
for label in schedule_order {
let schedule = schedules.get(*label).unwrap();
text_sections.push(TextSection::new(
format!("{:?}\n", label),
TextStyle {
font: asset_server.load(FONT_BOLD),
font_size: FONT_SIZE,
color: FONT_COLOR,
},
));
// grab the list of systems in the schedule, in the order the
// single-threaded executor would run them.
let Ok(systems) = schedule.systems() else {
return;
};
for (node_id, system) in systems {
// skip bevy default systems; we don't want to step those
if system.name().starts_with("bevy") {
always_run.push((*label, node_id));
continue;
}
// Add an entry to our systems list so we can find where to draw
// the cursor when the stepping cursor is at this system
state.systems.push((*label, node_id, text_sections.len()));
// Add a text section for displaying the cursor for this system
text_sections.push(TextSection::new(
" ",
TextStyle {
font: asset_server.load(FONT_MEDIUM),
font_size: FONT_SIZE,
color: FONT_COLOR,
},
));
// add the name of the system to the ui
text_sections.push(TextSection::new(
format!("{}\n", system.name()),
TextStyle {
font: asset_server.load(FONT_MEDIUM),
font_size: FONT_SIZE,
color: FONT_COLOR,
},
));
}
}
for (label, node) in always_run.drain(..) {
stepping.always_run_node(label, node);
}
commands.spawn((
SteppingUi,
TextBundle {
text: Text::from_sections(text_sections),
style: Style {
position_type: PositionType::Absolute,
top: state.ui_top,
left: state.ui_left,
padding: UiRect::all(Val::Px(10.0)),
..default()
},
background_color: BackgroundColor(Color::srgba(1.0, 1.0, 1.0, 0.33)),
visibility: Visibility::Hidden,
..default()
},
));
}
pub fn get_mut(&mut self, label: impl ScheduleLabel) -> Option<&mut Schedule>
pub fn get_mut(&mut self, label: impl ScheduleLabel) -> Option<&mut Schedule>
Returns a mutable reference to the schedule associated with label
, if it exists.
pub fn entry(&mut self, label: impl ScheduleLabel) -> &mut Schedule
pub fn entry(&mut self, label: impl ScheduleLabel) -> &mut Schedule
Returns a mutable reference to the schedules associated with label
, creating one if it doesn’t already exist.
pub fn iter(
&self
) -> impl Iterator<Item = (&(dyn ScheduleLabel + 'static), &Schedule)>
pub fn iter( &self ) -> impl Iterator<Item = (&(dyn ScheduleLabel + 'static), &Schedule)>
Returns an iterator over all schedules. Iteration order is undefined.
pub fn iter_mut(
&mut self
) -> impl Iterator<Item = (&(dyn ScheduleLabel + 'static), &mut Schedule)>
pub fn iter_mut( &mut self ) -> impl Iterator<Item = (&(dyn ScheduleLabel + 'static), &mut Schedule)>
Returns an iterator over mutable references to all schedules. Iteration order is undefined.
pub fn configure_schedules(
&mut self,
schedule_build_settings: ScheduleBuildSettings
)
pub fn configure_schedules( &mut self, schedule_build_settings: ScheduleBuildSettings )
Applies the provided ScheduleBuildSettings
to all schedules.
pub fn allow_ambiguous_component<T>(&mut self, world: &mut World)where
T: Component,
pub fn allow_ambiguous_component<T>(&mut self, world: &mut World)where
T: Component,
Ignore system order ambiguities caused by conflicts on Component
s of type T
.
pub fn allow_ambiguous_resource<T>(&mut self, world: &mut World)where
T: Resource,
pub fn allow_ambiguous_resource<T>(&mut self, world: &mut World)where
T: Resource,
Ignore system order ambiguities caused by conflicts on Resource
s of type T
.
pub fn iter_ignored_ambiguities(&self) -> impl Iterator<Item = &ComponentId>
pub fn iter_ignored_ambiguities(&self) -> impl Iterator<Item = &ComponentId>
Iterate through the ComponentId
’s that will be ignored.
pub fn print_ignored_ambiguities(&self, components: &Components)
pub fn print_ignored_ambiguities(&self, components: &Components)
Prints the names of the components and resources with info
May panic or retrieve incorrect names if Components
is not from the same
world
pub fn add_systems<M>(
&mut self,
schedule: impl ScheduleLabel,
systems: impl IntoSystemConfigs<M>
) -> &mut Schedules
pub fn add_systems<M>( &mut self, schedule: impl ScheduleLabel, systems: impl IntoSystemConfigs<M> ) -> &mut Schedules
Adds one or more systems to the Schedule
matching the provided ScheduleLabel
.
pub fn configure_sets(
&mut self,
schedule: impl ScheduleLabel,
sets: impl IntoSystemSetConfigs
) -> &mut Schedules
pub fn configure_sets( &mut self, schedule: impl ScheduleLabel, sets: impl IntoSystemSetConfigs ) -> &mut Schedules
Configures a collection of system sets in the provided schedule, adding any sets that do not exist.
pub fn ignore_ambiguity<M1, M2, S1, S2>(
&mut self,
schedule: impl ScheduleLabel,
a: S1,
b: S2
) -> &mut Scheduleswhere
S1: IntoSystemSet<M1>,
S2: IntoSystemSet<M2>,
pub fn ignore_ambiguity<M1, M2, S1, S2>(
&mut self,
schedule: impl ScheduleLabel,
a: S1,
b: S2
) -> &mut Scheduleswhere
S1: IntoSystemSet<M1>,
S2: IntoSystemSet<M2>,
Suppress warnings and errors that would result from systems in these sets having ambiguities
(conflicting access but indeterminate order) with systems in set
.
When possible, do this directly in the .add_systems(Update, a.ambiguous_with(b))
call.
However, sometimes two independent plugins A
and B
are reported as ambiguous, which you
can only suppress as the consumer of both.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Schedules
impl !RefUnwindSafe for Schedules
impl Send for Schedules
impl Sync for Schedules
impl Unpin for Schedules
impl !UnwindSafe for Schedules
Blanket Implementations§
§impl<T, U> AsBindGroupShaderType<U> for T
impl<T, U> AsBindGroupShaderType<U> for T
§fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U
fn as_bind_group_shader_type(&self, _images: &RenderAssets<GpuImage>) -> U
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
§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>
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>
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)
&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)
&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<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
§impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
§fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Self
using data from the given World
.§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> ⓘ
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§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> NoneValue for Twhere
T: Default,
impl<T> NoneValue for Twhere
T: Default,
type NoneType = T
§fn null_value() -> T
fn null_value() -> T
§impl<T> Pointable for T
impl<T> Pointable for T
source§impl<R, P> ReadPrimitive<R> for P
impl<R, P> ReadPrimitive<R> for P
source§fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
fn read_from_little_endian(read: &mut R) -> Result<Self, Error>
ReadEndian::read_from_little_endian()
.