obdd 0.6.0 → 0.6.1

raw patch · 2 files changed

+5/−3 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

examples/Weight.hs +2/−0
obdd.cabal +3/−3

examples/Weight.hs view

@@ -1,5 +1,7 @@ {- +NOTE: the following comment is lying, see https://github.com/jwaldmann/haskell-obdd/issues/5+ The minimal number of knights needed to occupy or attack every square on an n×n chessboard (i.e., domination numbers for the n×n knight graphs)

obdd.cabal view

@@ -1,5 +1,5 @@ Name:                obdd-Version:             0.6.0+Version:             0.6.1 Cabal-Version:       >= 1.8 Build-type: Simple Synopsis:            Ordered Reduced Binary Decision Diagrams@@ -8,7 +8,7 @@   an efficient representation for formulas in propositional logic.   .   This is mostly educational.-  The BDDs do not share nodes and this might introduce inefficiencies.+  The BDDs do not share nodes (there is no persistent BDD base) and this might introduce inefficiencies.   .   An important (for me, in teaching) feature is   that I can immediately draw the BDD to an X11 window (via graphviz).@@ -20,7 +20,7 @@   > let f [] = false; f (x:y:zs) = x && y || f zs   > display P.$ f P.$ P.map variable [1,2,3,4,5,6]   > display P.$ f P.$ P.map variable [1,4,2,5,3,6]-+  .   If you want better performance,   use <http://vlsi.colorado.edu/%7Efabio/CUDD/ CUDD>   <https://hackage.haskell.org/package/cudd Haskell bindings>,