Enum DecompositionType 

pub enum DecompositionType {
    None,
    Independent,
    Identity,
    Negation,
    And,
    Or,
    Le,
    Lt,
    Xor,
}

Basic boolean function families to describe decompositions

Variants

None

No valid decomposition with this variable

Independent

The function is independent of this variable

Identity

The function returns this variable

Negation

The function returns the negation of this variable

And

Decomposition possible as And

Or

Decomposition possible as Or

Le

Decomposition possible as Less-Or-Equal (equivalent to Nand for a top decomposition)

Lt

Decomposition possible as Less-Than (equivalent to Nor for a top decomposition)

Xor

Decomposition possible as Xor

Implementations

impl DecompositionType

pub fn is_trivial(&self) -> bool

Returns whether the decomposition is trivial (independent, x or !x)

pub fn is_and_type(&self) -> bool

Returns whether the decomposition is based on an and gate or similar

pub fn is_xor_type(&self) -> bool

Returns whether the decomposition is based on a xor gate

pub fn is_simple_gate(&self) -> bool

Returns whether the decomposition is based on any 2-input gate

Trait Implementations

impl Debug for DecompositionType

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

Formats the value using the given formatter.

impl Eq for DecompositionType

impl Hash for DecompositionType

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for DecompositionType

fn eq(&self, other: &DecompositionType) -> 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.

impl StructuralPartialEq for DecompositionType