Safe Haskell	Safe-Inferred
Language	Haskell2010

Math.Tools.BDD

Synopsis

data BDD
- = BBead {
  - btrue :: BDD
  - bfalse :: BDD
  }
- | BTrue
- | BFalse
var :: BDD
reduceFold :: Fold BDD BDD
reduce :: BDD -> BDD
eval :: BDD -> [Bool] -> Bool
ifthenelse :: (Bool, [Bool]) -> Either [Bool] [Bool]
returnBDD :: Bool -> BDD
bead :: BDD -> BDD -> BDD
neg :: BDD -> BDD
(-&-) :: BDD -> BDD -> BDD
(-|-) :: BDD -> BDD -> BDD

Documentation

data BDD Source #

Idea for BDD is from Knuth: The Art of Computer Programming, volume 4, fascicle 1, pg. 70-148. Every level in BDD tree represents one variable.

Constructors

BBead
Fields btrue :: BDD bfalse :: BDD
BTrue
BFalse

Instances

Instances details

Data BDD Source #
Instance details Defined in Math.Tools.BDD Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BDD -> c BDD # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BDD # toConstr :: BDD -> Constr # dataTypeOf :: BDD -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c BDD) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BDD) # gmapT :: (forall b. Data b => b -> b) -> BDD -> BDD # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BDD -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BDD -> r # gmapQ :: (forall d. Data d => d -> u) -> BDD -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BDD -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BDD -> m BDD # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BDD -> m BDD # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BDD -> m BDD #
Generic BDD Source #
Instance details Defined in Math.Tools.BDD Associated Types type Rep BDD :: Type -> Type # Methods from :: BDD -> Rep BDD x # to :: Rep BDD x -> BDD #
Show BDD Source #
Instance details Defined in Math.Tools.BDD Methods showsPrec :: Int -> BDD -> ShowS # show :: BDD -> String # showList :: [BDD] -> ShowS #
Visitor BDD Source #
Instance details Defined in Math.Tools.BDD Associated Types data Fold BDD :: Type -> Type Source # Methods visit :: Fold BDD a -> BDD -> a Source #
Eq BDD Source #
Instance details Defined in Math.Tools.BDD Methods (==) :: BDD -> BDD -> Bool # (/=) :: BDD -> BDD -> Bool #
type Rep BDD Source #
Instance details Defined in Math.Tools.BDD type Rep BDD = D1 ('MetaData "BDD" "Math.Tools.BDD" "cifl-math-library-1.1.1.0-JEQP78tsA0rJRaFkv5LJVZ" 'False) (C1 ('MetaCons "BBead" 'PrefixI 'True) (S1 ('MetaSel ('Just "btrue") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BDD) :*: S1 ('MetaSel ('Just "bfalse") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 BDD)) :+: (C1 ('MetaCons "BTrue" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "BFalse" 'PrefixI 'False) (U1 :: Type -> Type)))
data Fold BDD a Source #
Instance details Defined in Math.Tools.BDD data Fold BDD a = BDDFold a a (a -> a -> a)

var :: BDD Source #

reduceFold :: Fold BDD BDD Source #

reduce :: BDD -> BDD Source #

eval :: BDD -> [Bool] -> Bool Source #

ifthenelse :: (Bool, [Bool]) -> Either [Bool] [Bool] Source #

returnBDD :: Bool -> BDD Source #

bead :: BDD -> BDD -> BDD Source #

neg :: BDD -> BDD Source #

(-&-) :: BDD -> BDD -> BDD Source #

(-|-) :: BDD -> BDD -> BDD Source #