Struct zdd::factory::Factory

pub struct Factory<Label> where
    Label: Eq + Hash + Clone,  { /* fields omitted */ }

A ZDD factory.

Wraps a hash consing table. Functions count, offset, onset, change, union, inter, minus and subset are cached.

Methods

impl<'a, 'b, Label: Ord + Eq + Hash + Clone + 'a + 'b> Factory<Label> where
    Factory<Label>: FactoryUnOps<Label, Zdd<Label>> + FactoryUnOps<Label, &'a Zdd<Label>> + FactoryUnLblOps<Label, Zdd<Label>, Label> + FactoryUnLblOps<Label, &'a Zdd<Label>, Label> + FactoryUnLblOps<Label, Zdd<Label>, &'b Label> + FactoryUnLblOps<Label, &'a Zdd<Label>, &'b Label> + FactoryBinOps<Label, Zdd<Label>, Zdd<Label>> + FactoryBinOps<Label, &'a Zdd<Label>, Zdd<Label>> + FactoryBinOps<Label, Zdd<Label>, &'b Zdd<Label>> + FactoryBinOps<Label, &'a Zdd<Label>, &'b Zdd<Label>>, 

pub fn mk(capacity: usize) -> Self

Creates a new factory.

One should never create more than one factory for a given element type.

pub fn zero(&self) -> Zdd<Label>

The zero element, i.e. the empty set.

pub fn one(&self) -> Zdd<Label>

The one element, i.e. the set containing only the empty combination.

pub fn add_one(&self, kid: &Zdd<Label>) -> Zdd<Label>

Adds the empty combination to a ZDD if it's not already there.

pub fn rm_one(&self, zdd: &Zdd<Label>) -> Zdd<Label>

Removes the empty combination from a ZDD if it's there.

pub fn lft(&self, zdd: &Zdd<Label>) -> Result<Zdd<Label>, bool>

Returns the left subtree if the ZDD is a node, an error

• of true if the ZDD is One (more precisely ZddTree::HasOne(Zero)) and
• of false if it is Zero.

pub fn rgt(&self, zdd: &Zdd<Label>) -> Result<Zdd<Label>, bool>

Returns the right subtree if the ZDD is a node, an error of true if the ZDD is One and false if it is Zero.

pub fn kids(&self, zdd: &Zdd<Label>) -> Result<(Zdd<Label>, Zdd<Label>), bool>

Returns the subtrees if the ZDD is a node, an error of true if the ZDD is One and false if it is Zero.

pub fn of_btree_set(&self, set: &'b BTreeSet<Label>) -> Zdd<Label>

Creates a ZDD containing the combination corresponding to a BTreeSet.

pub fn of_hashset(&self, set: &'b HashSet<Label>) -> Zdd<Label>

Creates a ZDD containing the combination corresponding to a HashSet.

pub fn consign_len(&self) -> usize

The size of the consign.

pub fn count_cache_len(&self) -> usize

The size of the count cache.

pub fn offset_cache_len(&self) -> usize

The size of the offset cache.

pub fn onset_cache_len(&self) -> usize

The size of the onset cache.

pub fn change_cache_len(&self) -> usize

The size of the change cache.

pub fn union_cache_len(&self) -> usize

The size of the union cache.

pub fn inter_cache_len(&self) -> usize

The size of the inter cache.

pub fn minus_cache_len(&self) -> usize

The size of the minus cache.

pub fn subset_cache_len(&self) -> usize

The size of the subset cache.

Trait Implementations

impl<'a, 'b, Label: Ord + Eq + Hash + Clone> FactoryBinOps<Label, &'a HConsed<ZddTree<Label>>, &'b HConsed<ZddTree<Label>>> for Factory<Label>

fn union(&self, lhs: &'a Zdd<Label>, rhs: &'b Zdd<Label>) -> Zdd<Label>

The union of two ZDDs. Cached.

fn inter(&self, lhs: &'a Zdd<Label>, rhs: &'b Zdd<Label>) -> Zdd<Label>

The intersection of two ZDDs. Cached.

fn minus(&self, lhs: &'a Zdd<Label>, rhs: &'b Zdd<Label>) -> Zdd<Label>

The difference of two ZDDs. Cached.

fn subset(&self, lhs: &'a Zdd<Label>, rhs: &'b Zdd<Label>) -> bool

Returns true iff lhs is a subset of rhs. Cached.

impl<'a, Label: Ord + Eq + Hash + Clone> FactoryBinOps<Label, &'a HConsed<ZddTree<Label>>, HConsed<ZddTree<Label>>> for Factory<Label>

fn union(&self, lhs: &'a Zdd<Label>, rhs: Zdd<Label>) -> Zdd<Label>

The union of two ZDDs. Cached.

fn inter(&self, lhs: &'a Zdd<Label>, rhs: Zdd<Label>) -> Zdd<Label>

The intersection of two ZDDs. Cached.

fn minus(&self, lhs: &'a Zdd<Label>, rhs: Zdd<Label>) -> Zdd<Label>

The difference of two ZDDs. Cached.

fn subset(&self, lhs: &'a Zdd<Label>, rhs: Zdd<Label>) -> bool

Returns true iff lhs is a subset of rhs. Cached.

impl<'a, Label: Ord + Eq + Hash + Clone> FactoryBinOps<Label, HConsed<ZddTree<Label>>, &'a HConsed<ZddTree<Label>>> for Factory<Label>

fn union(&self, lhs: Zdd<Label>, rhs: &'a Zdd<Label>) -> Zdd<Label>

The union of two ZDDs. Cached.

fn inter(&self, lhs: Zdd<Label>, rhs: &'a Zdd<Label>) -> Zdd<Label>

The intersection of two ZDDs. Cached.

fn minus(&self, lhs: Zdd<Label>, rhs: &'a Zdd<Label>) -> Zdd<Label>

The difference of two ZDDs. Cached.

fn subset(&self, lhs: Zdd<Label>, rhs: &'a Zdd<Label>) -> bool

Returns true iff lhs is a subset of rhs. Cached.

impl<Label: Ord + Eq + Hash + Clone> FactoryBinOps<Label, HConsed<ZddTree<Label>>, HConsed<ZddTree<Label>>> for Factory<Label>

fn union(&self, lhs: Zdd<Label>, rhs: Zdd<Label>) -> Zdd<Label>

The union of two ZDDs. Cached.

fn inter(&self, lhs: Zdd<Label>, rhs: Zdd<Label>) -> Zdd<Label>

The intersection of two ZDDs. Cached.

fn minus(&self, lhs: Zdd<Label>, rhs: Zdd<Label>) -> Zdd<Label>

The difference of two ZDDs. Cached.

fn subset(&self, lhs: Zdd<Label>, rhs: Zdd<Label>) -> bool

Returns true iff lhs is a subset of rhs. Cached.

impl<'a, 'b, Label: Ord + Eq + Hash + Clone> FactoryUnLblOps<Label, &'a HConsed<ZddTree<Label>>, &'b Label> for Factory<Label>

fn offset(&self, zdd: &'a Zdd<Label>, lbl: &'b Label) -> Zdd<Label>

The set of combinations of zdd in which lbl does not appear. Cached.

fn onset(&self, zdd: &'a Zdd<Label>, lbl: &'b Label) -> Zdd<Label>

The set of combinations of zdd in which lbl appears, without lbl in them. Cached.

fn change(&self, zdd: &'a Zdd<Label>, lbl: &'b Label) -> Zdd<Label>

Switches lbl in each combination of zdd. Inverts offset and onset. Cached.

impl<'a, Label: Ord + Eq + Hash + Clone> FactoryUnLblOps<Label, &'a HConsed<ZddTree<Label>>, Label> for Factory<Label>

fn offset(&self, zdd: &'a Zdd<Label>, lbl: Label) -> Zdd<Label>

The set of combinations of zdd in which lbl does not appear. Cached.

fn onset(&self, zdd: &'a Zdd<Label>, lbl: Label) -> Zdd<Label>

The set of combinations of zdd in which lbl appears, without lbl in them. Cached.

fn change(&self, zdd: &'a Zdd<Label>, lbl: Label) -> Zdd<Label>

Switches lbl in each combination of zdd. Inverts offset and onset. Cached.

impl<'a, Label: Ord + Eq + Hash + Clone> FactoryUnLblOps<Label, HConsed<ZddTree<Label>>, &'a Label> for Factory<Label>

fn offset(&self, zdd: Zdd<Label>, lbl: &'a Label) -> Zdd<Label>

The set of combinations of zdd in which lbl does not appear. Cached.

fn onset(&self, zdd: Zdd<Label>, lbl: &'a Label) -> Zdd<Label>

The set of combinations of zdd in which lbl appears, without lbl in them. Cached.

fn change(&self, zdd: Zdd<Label>, lbl: &'a Label) -> Zdd<Label>

Switches lbl in each combination of zdd. Inverts offset and onset. Cached.

impl<Label: Ord + Eq + Hash + Clone> FactoryUnLblOps<Label, HConsed<ZddTree<Label>>, Label> for Factory<Label>

fn offset(&self, zdd: Zdd<Label>, lbl: Label) -> Zdd<Label>

The set of combinations of zdd in which lbl does not appear. Cached.

fn onset(&self, zdd: Zdd<Label>, lbl: Label) -> Zdd<Label>

The set of combinations of zdd in which lbl appears, without lbl in them. Cached.

fn change(&self, zdd: Zdd<Label>, lbl: Label) -> Zdd<Label>

Switches lbl in each combination of zdd. Inverts offset and onset. Cached.

impl<'a, Label: Ord + Eq + Hash + Clone> FactoryUnOps<Label, &'a HConsed<ZddTree<Label>>> for Factory<Label>

fn count(&self, zdd: &'a Zdd<Label>) -> usize

The number of combinations in a ZDD. Cached.

impl<Label: Ord + Eq + Hash + Clone> FactoryUnOps<Label, HConsed<ZddTree<Label>>> for Factory<Label>

fn count(&self, zdd: Zdd<Label>) -> usize

The number of combinations in a ZDD. Cached.

impl<Label: Eq + Hash + Clone> Sync for Factory<Label>

impl<'a, 'b, Label: Ord + Eq + Hash + Clone> ZddMaker<Label, &'a HConsed<ZddTree<Label>>, &'b HConsed<ZddTree<Label>>> for Factory<Label>

fn mk_node(
    &self,
    lbl: Label,
    lft: &'a Zdd<Label>,
    rgt: &'b Zdd<Label>
) -> Zdd<Label>

The precise semantics of this function is as follows:

impl<'a, Label: Ord + Eq + Hash + Clone> ZddMaker<Label, &'a HConsed<ZddTree<Label>>, HConsed<ZddTree<Label>>> for Factory<Label>

fn mk_node(
    &self,
    lbl: Label,
    lft: &'a Zdd<Label>,
    rgt: Zdd<Label>
) -> Zdd<Label>

The precise semantics of this function is as follows:

impl<'a, Label: Ord + Eq + Hash + Clone> ZddMaker<Label, HConsed<ZddTree<Label>>, &'a HConsed<ZddTree<Label>>> for Factory<Label>

fn mk_node(
    &self,
    lbl: Label,
    lft: Zdd<Label>,
    rgt: &'a Zdd<Label>
) -> Zdd<Label>

The precise semantics of this function is as follows:

impl<Label: Ord + Eq + Hash + Clone> ZddMaker<Label, HConsed<ZddTree<Label>>, HConsed<ZddTree<Label>>> for Factory<Label>

fn mk_node(&self, lbl: Label, lft: Zdd<Label>, rgt: Zdd<Label>) -> Zdd<Label>

The precise semantics of this function is as follows: