pub struct Sop { /* private fields */ }
Expand description
Sum of Products representation (Or of And)
This is the usual representation for 2-level logic optimization. Any boolean function can be represented this way, and the optimization can be done quite efficiently (with Espresso, for example).
Implementations§
Trait Implementations§
source§impl Ord for Sop
impl Ord for Sop
source§impl PartialOrd for Sop
impl PartialOrd for Sop
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for
self
and other
) and is used by the <=
operator. Read moreimpl Eq for Sop
impl StructuralEq for Sop
impl StructuralPartialEq for Sop
Auto Trait Implementations§
impl RefUnwindSafe for Sop
impl Send for Sop
impl Sync for Sop
impl Unpin for Sop
impl UnwindSafe for Sop
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