pub enum Dag<T> {
Nullary,
Unary(T),
Binary(T, T),
}
Expand description
Abstract node of a directed acyclic graph.
Tracks the arity (out-degree) of nodes in a Simplictiy program, as well
as whether they represent witness
or disconnect
combinators, which
are treated specially when working with the graph structure of
Simplicty programs.
Variants§
Nullary
Combinator with no children
Unary(T)
Combinator with one child
Binary(T, T)
Combinator with two children
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl<T> Freeze for Dag<T>where
T: Freeze,
impl<T> RefUnwindSafe for Dag<T>where
T: RefUnwindSafe,
impl<T> Send for Dag<T>where
T: Send,
impl<T> Sync for Dag<T>where
T: Sync,
impl<T> Unpin for Dag<T>where
T: Unpin,
impl<T> UnwindSafe for Dag<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