pub struct DDOptimizer { /* private fields */ }Expand description
Optimized DD operations using SciRS2 graph algorithms
Implementations§
Source§impl DDOptimizer
impl DDOptimizer
pub fn new() -> Result<Self>
Sourcepub fn optimize_variable_ordering(
&mut self,
_dd: &mut DecisionDiagram,
) -> Result<Vec<usize>>
pub fn optimize_variable_ordering( &mut self, _dd: &mut DecisionDiagram, ) -> Result<Vec<usize>>
Optimize variable ordering for better compression
Sourcepub fn minimize_diagram(&mut self, _dd: &mut DecisionDiagram) -> Result<()>
pub fn minimize_diagram(&mut self, _dd: &mut DecisionDiagram) -> Result<()>
Minimize number of nodes using reduction rules
Auto Trait Implementations§
impl Freeze for DDOptimizer
impl !RefUnwindSafe for DDOptimizer
impl Send for DDOptimizer
impl Sync for DDOptimizer
impl Unpin for DDOptimizer
impl !UnwindSafe for DDOptimizer
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.