pub enum Incomplete {
Free(String),
Cycle,
Sum(Arc<Incomplete>, Arc<Incomplete>),
Product(Arc<Incomplete>, Arc<Incomplete>),
Final(Arc<Final>),
}
Expand description
An incomplete type bound for use in error messages.
Variants§
Free(String)
A free variable.
Cycle
A type containing this type.
Sum(Arc<Incomplete>, Arc<Incomplete>)
A sum of two other types
Product(Arc<Incomplete>, Arc<Incomplete>)
A product of two other types
Final(Arc<Final>)
A complete type (including unit)
Implementations§
Trait Implementations§
Source§impl Clone for Incomplete
impl Clone for Incomplete
Source§fn clone(&self) -> Incomplete
fn clone(&self) -> Incomplete
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read moreSource§impl DagLike for &Incomplete
impl DagLike for &Incomplete
Source§type Node = Incomplete
type Node = Incomplete
The type of the DAG node, with no references or wrappers
Source§fn data(&self) -> &Incomplete
fn data(&self) -> &Incomplete
A pointer to the underlying data
Source§fn as_dag_node(&self) -> Dag<Self>
fn as_dag_node(&self) -> Dag<Self>
Interpret the node as a DAG node
Source§fn left_child(&self) -> Option<Self>
fn left_child(&self) -> Option<Self>
Accessor for the left child of the node, if one exists
Source§fn right_child(&self) -> Option<Self>
fn right_child(&self) -> Option<Self>
Accessor for the right child of the node, if one exists
Source§fn n_children(&self) -> usize
fn n_children(&self) -> usize
Number of children that the node has. Read more
Source§fn rtl_post_order_iter<S: SharingTracker<SwapChildren<Self>> + Default>(
self,
) -> RtlPostOrderIter<Self, S>
fn rtl_post_order_iter<S: SharingTracker<SwapChildren<Self>> + Default>( self, ) -> RtlPostOrderIter<Self, S>
Obtains an iterator of all the nodes rooted at the DAG, in right-to-left post order. Read more
Source§fn pre_order_iter<S: SharingTracker<Self> + Default>(
self,
) -> PreOrderIter<Self, S> ⓘ
fn pre_order_iter<S: SharingTracker<Self> + Default>( self, ) -> PreOrderIter<Self, S> ⓘ
Obtains an iterator of all the nodes rooted at the DAG, in pre-order.
Source§fn verbose_pre_order_iter<S: SharingTracker<Self> + Default>(
self,
max_depth: Option<usize>,
) -> VerbosePreOrderIter<Self, S> ⓘwhere
Self: Clone,
fn verbose_pre_order_iter<S: SharingTracker<Self> + Default>(
self,
max_depth: Option<usize>,
) -> VerbosePreOrderIter<Self, S> ⓘwhere
Self: Clone,
Obtains a verbose iterator of all the nodes rooted at the DAG, in pre-order. Read more
Source§fn post_order_iter<S: SharingTracker<Self> + Default>(
self,
) -> PostOrderIter<Self, S> ⓘ
fn post_order_iter<S: SharingTracker<Self> + Default>( self, ) -> PostOrderIter<Self, S> ⓘ
Obtains an iterator of all the nodes rooted at the DAG, in post order. Read more
Checks whether a DAG’s internal sharing (as expressed by shared pointers)
matches the given target sharing.
Source§fn post_order_iter_with_tracker<S: SharingTracker<Self>>(
self,
tracker: S,
) -> PostOrderIter<Self, S> ⓘ
fn post_order_iter_with_tracker<S: SharingTracker<Self>>( self, tracker: S, ) -> PostOrderIter<Self, S> ⓘ
Obtains an post-order iterator of all the nodes rooted at DAG, using the
given tracker. Read more
Source§impl Debug for Incomplete
impl Debug for Incomplete
Auto Trait Implementations§
impl Freeze for Incomplete
impl RefUnwindSafe for Incomplete
impl Send for Incomplete
impl Sync for Incomplete
impl Unpin for Incomplete
impl UnwindSafe for Incomplete
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