Struct ExecutionGraph

pub struct ExecutionGraph { /* private fields */ }

The Execution Plan provides a plan of executable tasks that the task executor can execute.

For the execution plan to be valid, the following must hold:

• No Cycles
• The graph must be able to be topographically sorted such that all tasks that depend on a task run before a task, and all tasks that finalize a task occur after said task

Implementations

impl ExecutionGraph

pub fn new( graph: Graph<Arc<RwLock<RawRwLock, Box<dyn FullTask>>>, TaskOrderingKind>, requested_tasks: TaskRequests, ) -> ExecutionGraph

pub fn requested_tasks(&self) -> &Arc<TaskRequests>

pub fn graph( &self, ) -> &Arc<RwLock<RawRwLock, Graph<Arc<RwLock<RawRwLock, Box<dyn FullTask>>>, TaskOrderingKind>>>

Trait Implementations

impl Clone for ExecutionGraph

fn clone(&self) -> ExecutionGraph

Returns a duplicate of the value.

const fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for ExecutionGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.