Struct Systems 

pub struct Systems { /* private fields */ }

Container for systems in a schedule.

Implementations

impl Systems

pub fn len(&self) -> usize

Returns the number of systems in this container.

pub fn is_empty(&self) -> bool

Returns true if this container is empty.

pub fn get(&self, key: SystemKey) -> Option<&SystemWithAccess>

Returns a reference to the system with the given key, if it exists.

pub fn get_mut(&mut self, key: SystemKey) -> Option<&mut SystemWithAccess>

Returns a mutable reference to the system with the given key, if it exists.

pub fn has_conditions(&self, key: SystemKey) -> bool

Returns true if the system with the given key has conditions.

pub fn get_conditions(&self, key: SystemKey) -> Option<&[ConditionWithAccess]>

Returns a reference to the conditions for the system with the given key, if it exists.

pub fn get_conditions_mut( &mut self, key: SystemKey, ) -> Option<&mut Vec<ConditionWithAccess>>

Returns a mutable reference to the conditions for the system with the given key, if it exists.

pub fn iter( &self, ) -> impl Iterator<Item = (SystemKey, &Box<dyn System<Out = (), In = ()>>, &[ConditionWithAccess])>

Returns an iterator over all systems and their conditions in this container.

pub fn insert( &mut self, system: Box<dyn System<Out = (), In = ()>>, conditions: Vec<Box<dyn ReadOnlySystem<Out = bool, In = ()>>>, ) -> SystemKey

Inserts a new system into the container, along with its conditions, and queues it to be initialized later in Systems::initialize.

We have to defer initialization of systems in the container until we have &mut World access, so we store these in a list until Systems::initialize is called. This is usually done upon the first run of the schedule.

pub fn is_initialized(&self) -> bool

Returns true if all systems in this container have been initialized.

pub fn initialize(&mut self, world: &mut World)

Initializes all systems and their conditions that have not been initialized yet.

pub fn get_conflicting_systems( &self, flat_dependency_analysis: &DagAnalysis<SystemKey>, flat_ambiguous_with: &Graph<false, SystemKey>, ambiguous_with_all: &HashSet<NodeId>, ignored_ambiguities: &BTreeSet<ComponentId>, ) -> ConflictingSystems

Calculates the list of systems that conflict with each other based on their access patterns.

If the Box<[ComponentId]> is empty for a given pair of systems, then the systems conflict on World access in general (e.g. one of them is exclusive, or both systems have Query<EntityMut>).

Trait Implementations

impl Default for Systems

fn default() -> Systems

Returns the “default value” for a type.

impl Index<SystemKey> for Systems

type Output = SystemWithAccess

The returned type after indexing.

fn index(&self, key: SystemKey) -> &<Systems as Index<SystemKey>>::Output

Performs the indexing (container[index]) operation.

impl IndexMut<SystemKey> for Systems

fn index_mut( &mut self, key: SystemKey, ) -> &mut <Systems as Index<SystemKey>>::Output

Performs the mutable indexing (container[index]) operation.