-
Make
Leaf :: Bool -> BDD a
as a basic constructor instead ofF
/T
(in case of BDD) andEmpty
/Base
(in case of ZDD), and removeF
/T
. -
ZDD.toList
now returns sorted list -
Change signature of
fold
andfold'
of BDD- Before:
b -> b -> (Int -> b -> b -> b) -> BDD a -> b
- After:
(Int -> b -> b -> b) -> (Bool -> b) -> BDD a -> b
- Before:
-
Change signature of
fold
andfold'
of ZDD (ditto) -
Add
HasCallStack
to some functions that are expected to raise excpetions
-
Introduce signature functor type (
Sig
) -
Add new operations:
- BDD:
- fixed point operators
lfp
andgfp
- satisfiability related functions:
anySat
,allSat
,anySatComplete
,allSatComplete
,countSat
,uniformSatM
- pseudo-boolean constraint functions:
pbAtLeast
,pbAtMost
,pbExactly
,pbExactlyIntegral
- fixed point operators
- ZDD:
combinations
- pseudo-boolean constraint functions:
subsetsAtLeast
,subsetsAtMost
,subsetsExactly
,subsetsExactlyIntegral
- Both BDD and ZDD
numNodes
unfoldHashable
andunfoldOrd
- BDD:
- Fix laziness of
fold
andfold'
-
Introduced
doctest
-
Add other-extensions fields to
package.yaml