Enum Cons

pub enum Cons<T> {
    Fork(Box<Cons<T>>, Box<Cons<T>>),
    Seq(Box<Cons<T>>, Box<Cons<T>>),
    Task(T),
    Nil,
}

Implementation detail of TaskGraph. Note that two trees may be unequal yet equivalent in how they assemble, for example, Cons::Seq(x, Cons::Seq(y, z)) != Cons::Seq(Cons::Seq(x, y), z), but they both assemble into a sequence x -> y -> z.

Variants

Fork(Box<Cons<T>>, Box<Cons<T>>)

Seq(Box<Cons<T>>, Box<Cons<T>>)

Task(T)

Nil

Implementations

impl Cons<Box<dyn TaskFactory>>

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.

Trait Implementations

impl<T: Clone> Clone for Cons<T>

fn clone(&self) -> Cons<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Cons<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for Cons<T>

fn eq(&self, other: &Cons<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Eq> Eq for Cons<T>

impl<T> StructuralPartialEq for Cons<T>