Enum zdd::ZddTree

pub enum ZddTree<Label> {
    Node(Label, Zdd<Label>, Zdd<Label>),
    HasOne(Zdd<Label>),
    Zero,
}

Actual ZDD enum type.

Usually a ZDD is either:

• a node with a label and a left and a right hash consed subtree,
• the one terminal, the set containing only the null combination,
• the zero terminal, the empty set.

However we use 0-element edges that indicate a path contains the null combination. So there's no one terminal.

Variants

Node(Label, Zdd<Label>, Zdd<Label>)

A node with a label and two kids.

HasOne(Zdd<Label>)

Indicates the underlying contains the empty combination.

Zero

The empty set.

Methods

impl<Label: Ord + Clone> ZddTree<Label>

pub fn iter(&self) -> Iterator<Label>

Returns an iterator over a ZddTree. There's no into_iter since a ZDD is immutable anyway.

Trait Implementations

impl<Label: Clone> Clone for ZddTree<Label>

fn clone(&self) -> ZddTree<Label>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Label: Ord + Clone + Display> Display for ZddTree<Label>

fn fmt(&self, fmt: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<Label: Clone + Eq> Eq for ZddTree<Label>

impl<Label: Hash> Hash for ZddTree<Label>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<Label: PartialEq> PartialEq<ZddTree<Label>> for ZddTree<Label>

fn eq(&self, other: &ZddTree<Label>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &ZddTree<Label>) -> bool

This method tests for !=.

impl<Label> StructuralPartialEq for ZddTree<Label>