Struct BCDDRules 

pub struct BCDDRules;

DiagramRules for complement edge binary decision diagrams

Trait Implementations

impl<E: Edge<Tag = EdgeTag>, N: InnerNode<E>> DiagramRules<E, N, BCDDTerminal> for BCDDRules

type Cofactors<'a> = Cofactors<'a, E, <N as InnerNode<E>>::ChildrenIter<'a>> where N: 'a, E: 'a

Iterator created by DiagramRules::cofactors()

fn reduce<M: Manager<Edge = E, InnerNode = N>>( manager: &M, level: LevelNo, children: impl IntoIterator<Item = E>, ) -> ReducedOrNew<E, N>

Apply the reduction rule(s)

fn cofactors(tag: E::Tag, node: &N) -> Self::Cofactors<'_>

Get the cofactors of node assuming an incoming edge with tag

fn cofactor(tag: E::Tag, node: &N, n: usize) -> Borrowed<'_, E>

Get the n-th cofactor of node assuming an incoming edge with tag