Fix some warnings

src/ToySolver/Converter/SAT2KSAT.hs

@@ -21,14 +21,11 @@ module ToySolver.Converter.SAT2KSAT
 
 import Control.Monad
 import Control.Monad.ST
-import Data.Array.MArray
-import Data.Array.ST
 import Data.Foldable (toList)
 import Data.Sequence ((<|), (|>))
 import qualified Data.Sequence as Seq
 import Data.STRef
 
-import ToySolver.Converter.Base
 import ToySolver.Converter.Tseitin
 import qualified ToySolver.FileFormat.CNF as CNF
 import ToySolver.SAT.Formula

src/ToySolver/Converter/Tseitin.hs

@@ -1,4 +1,3 @@
-
 {-# OPTIONS_GHC -Wall #-}
 {-# OPTIONS_HADDOCK show-extensions #-}
 {-# LANGUAGE TypeFamilies #-}

src/ToySolver/FileFormat/CNF.hs

@@ -239,7 +239,7 @@ toOldWCNF (NewWCNF cs)
   , wcnfClauses = [(fromMaybe top w, c) | (w, c) <- cs]
   }
   where
-    top = sum [w | (Just w, c) <- cs] + 1
+    top = sum [w | (Just w, _c) <- cs] + 1
 
 toNewWCNF :: WCNF -> NewWCNF
 toNewWCNF wcnf = NewWCNF [(if w >= wcnfTopCost wcnf then Nothing else Just w, c) | (w, c) <- wcnfClauses wcnf]

src/ToySolver/SAT/Encoder/Cardinality/Internal/Totalizer.hs

@@ -34,7 +34,6 @@ module ToySolver.SAT.Encoder.Cardinality.Internal.Totalizer
 
 import Control.Monad
 import Control.Monad.Primitive
-import Control.Monad.State.Strict
 import qualified Data.IntSet as IntSet
 import Data.Map.Strict (Map)
 import qualified Data.Map.Strict as Map

src/ToySolver/SAT/PBO/BCD2.hs

@@ -217,7 +217,7 @@ solveWBO cxt solver opt = do
               _ -> do
                 let torelax     = unrelaxed `IntSet.intersection` failed
                     intersected = IntMap.elems (IntMap.restrictKeys sels failed)
-                    disjoint    = [core | (sel,(core,_)) <- IntMap.toList (IntMap.withoutKeys sels failed)]
+                    disjoint    = [core | (_sel,(core,_)) <- IntMap.toList (IntMap.withoutKeys sels failed)]
                 modifyIORef unrelaxedRef (`IntSet.difference` torelax)
                 modifyIORef relaxedRef (`IntSet.union` torelax)
                 delta <- do

test/Test/GraphShortestPath.hs

@@ -4,7 +4,6 @@
 module Test.GraphShortestPath (graphShortestPathTestGroup) where
 
 import Control.Monad
-import Data.Hashable
 import Data.Monoid
 import Test.Tasty
 import Test.Tasty.HUnit

test/Test/SAT.hs

@@ -617,7 +617,7 @@ case_setTerminateCallback = do
 
   m <- try (SAT.solve solver)
   case m of
-    Left (e :: SAT.Canceled) -> return ()
+    Left (_ :: SAT.Canceled) -> return ()
     Right x -> assertFailure ("Canceled should be thrown: " ++ show x)
 
 case_clearTerminateCallback :: IO ()

test/Test/SAT/MUS.hs

@@ -215,7 +215,7 @@ case_allMUSAssumptions_2_HYCAM = do
         , [y2,y3,y5,y7,y8,y11]
         , [y2,y4,y5,y6,y7,y8]  -- (*)
         ]
-      mcses =
+      _mcses =
         [ [y0,y1,y7]
         , [y0,y1,y8]
         , [y0,y3,y4]