pub struct Dag { /* private fields */ }
Expand description
A directed acyclic graph structure.
Implementations§
Source§impl Dag
impl Dag
Sourcepub fn graph(&self) -> &DiGraphMap<NodeId, ()>
pub fn graph(&self) -> &DiGraphMap<NodeId, ()>
The directed graph of the stored systems, connected by their ordering dependencies.
Sourcepub fn cached_topsort(&self) -> &[NodeId]
pub fn cached_topsort(&self) -> &[NodeId]
A cached topological ordering of the graph.
The order is determined by the ordering dependencies between systems.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Dag
impl RefUnwindSafe for Dag
impl Send for Dag
impl Sync for Dag
impl Unpin for Dag
impl UnwindSafe for Dag
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> 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 data from the given World
.