pub enum Cons<T> {
Fork(Box<Cons<T>>, Box<Cons<T>>),
Seq(Box<Cons<T>>, Box<Cons<T>>),
Task(T),
Nil,
}
Expand description
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§
Implementations§
Trait Implementations§
impl<T: Eq> Eq for Cons<T>
impl<T> StructuralPartialEq for Cons<T>
Auto Trait Implementations§
impl<T> Freeze for Cons<T>where
T: Freeze,
impl<T> RefUnwindSafe for Cons<T>where
T: RefUnwindSafe,
impl<T> Send for Cons<T>where
T: Send,
impl<T> Sync for Cons<T>where
T: Sync,
impl<T> Unpin for Cons<T>where
T: Unpin,
impl<T> UnwindSafe for Cons<T>where
T: UnwindSafe,
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