Struct CubeList 

pub struct CubeList(/* private fields */);

A CubeList is a sum (OR’d list) of cubes. It represents a Boolean expression in sum-of-products form, by construction.

The CubeList abstraction supports only indexed anonymous variables (variable 0, 1, …), and does not (yet) have a wrapper supporting an arbitrary terminal type T. This may be implemented in the future.

The CubeList abstraction is used internally to convert from a BDD to a quasi-minimized Boolean expression.

Implementations

impl CubeList

pub fn new() -> CubeList

Construct a new, empty, cube list (equivalent to a constant false).

pub fn from_list(cubes: &[Cube]) -> CubeList

Construct a cube list from a list of Cube structs.

pub fn cubes(&self) -> Iter<'_, Cube>

Return an iterator over all cubes.

pub fn merge(&self, other: &CubeList) -> CubeList

Merge this cube list with another, canceling or merging cubes where possible. The resulting cube list is not guaranteed to be minimal (that is the set-cover problem, which is NP-Complete), but is reduced somewhat by a very simple reduction/merging algorithm.

pub fn with_var(&self, idx: usize, val: CubeVar) -> CubeList

Trait Implementations

impl Clone for CubeList

fn clone(&self) -> CubeList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CubeList

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for CubeList

fn eq(&self, other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.