Type Alias TaskGraph

Source
pub type TaskGraph = Cons<Box<dyn TaskFactory>>;
Expand description

A node of the binary tree grammar that describes a task graph. Cons::Seq lists represent sequential execution of tasks. Cons::Fork lists represent concurrent execution of tasks. The leaves of the tree are Cons::Tasks.

Aliased Type§

pub enum TaskGraph {
    Fork(Box<Cons<Box<dyn TaskFactory>>>, Box<Cons<Box<dyn TaskFactory>>>),
    Seq(Box<Cons<Box<dyn TaskFactory>>>, Box<Cons<Box<dyn TaskFactory>>>),
    Task(Box<dyn TaskFactory>),
    Nil,
}

Variants§

Implementations§

Source§

impl TaskGraph

Source

pub fn assemble( self, on_completion: OnCompletion, user: &TaskUser<'_>, ) -> Option<Entity>

Lazily create all of the task graph entities and connect them with edges. Tasks won’t exist until calling World::maintain.