incremental-sat-solver 0.1.4 → 0.1.5

raw patch · 2 files changed

+11/−2 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• Data/Boolean/SatSolver.hs +10/−1
• incremental-sat-solver.cabal +1/−1

@@ -23,7 +23,7 @@    newSatSolver, isSolved,  -  lookupVar, assertTrue, branchOnVar, selectBranchVar, solve+  lookupVar, assertTrue, branchOnVar, selectBranchVar, solve, isSolvable    ) where @@ -92,6 +92,15 @@ solve solver   | isSolved solver = return solver   | otherwise = branchOnUnbound (selectBranchVar solver) solver >>= solve++-- |+-- This predicate tells whether the stored constraints are+-- solvable. Use with care! This might be an inefficient operation. It+-- tries to find a solution using backtracking and returns @True@ if+-- and only if that fails.+-- +isSolvable :: SatSolver -> Bool+isSolvable = not . null . solve   -- private helper functions

@@ -1,5 +1,5 @@ Name:          incremental-sat-solver-Version:       0.1.4+Version:       0.1.5 Cabal-Version: >= 1.6 Synopsis:      Simple, Incremental SAT Solving as a Library Description:   This Haskell library provides an implementation of the