make unused code compile

2 files changed, 9 insertions, 8 deletions

diff --git a/kiki.cabal b/kiki.cabal
index 1eca45b..25b2373 100644
--- a/kiki.cabal
+++ b/kiki.cabal
@@ -73,7 +73,8 @@ library
                      SuperOrd,
                      FunctorToMaybe,
                      GnuPGAgent,
-                     ByteStringUtil
+                     ByteStringUtil,
+                     IntMapClass
     other-modules:   TimeUtil,
                      ControlMaybe,
                      Compat,
@@ -87,7 +88,8 @@ library
                      asn1-types,
                      binary,
                      bytestring,
-                     containers,
+                     containers >= 0.5.3,
+                     deepseq,
                      directory,
                      filepath,
                      network,
diff --git a/IntMapClass.hs b/lib/IntMapClass.hs
index 81382aa..c5e6a88 100644
--- a/IntMapClass.hs
+++ b/lib/IntMapClass.hs
@@ -28,6 +28,7 @@ newtype IMap k a = IMap { intmap :: IntMap a }
     , Ord
     , Read
     , Show
+    , Semigroup
     , Monoid
     , NFData
     )
@@ -152,11 +153,11 @@ unionWith f = adaptm_m_m (IntMap.unionWith f)
 unionWithKey :: Coercible Int k => (k -> a -> a -> a) -> IMap k a -> IMap k a -> IMap k a
 unionWithKey f = adaptm_m_m (IntMap.unionWithKey $ f . coerce)
 
-unions :: Coercible [IMap k a] [IntMap a] => [IMap k a] -> IMap k a
-unions ms = IMap $ IntMap.unions (coerce ms)
+-- unions :: Coercible [IMap k a] [IntMap a] => [IMap k a] -> IMap k a
+-- unions ms = IMap $ IntMap.unions (coerce ms)
 
-unionsWith :: Coercible [IMap k a] [IntMap a] => (a->a->a) -> [IMap k a] -> IMap k a
-unionsWith f ms = IMap $ IntMap.unionsWith f (coerce ms)
+-- unionsWith :: Coercible [IMap k a] [IntMap a] => (a->a->a) -> [IMap k a] -> IMap k a
+-- unionsWith f ms = IMap $ IntMap.unionsWith f (coerce ms)
 
 difference = adaptm_m_m IntMap.difference
 
@@ -236,10 +237,8 @@ foldlWithKey ::
   Coercible Int k => (x -> k -> a -> x) -> x -> IMap k a -> x
 foldlWithKey f a = adapt_m (IntMap.foldlWithKey f' a) where f' a = f a . coerce
 
-#if MIN_VERSION_containers(0,5,3)
 foldMapWithKey :: (Monoid m, Coercible k Int) => (k -> a -> m) -> IMap k a -> m
 foldMapWithKey f = adapt_m (IntMap.foldMapWithKey $ f . coerce)
-#endif
 
 foldr' :: (a -> x -> x) -> x -> IMap k a -> x
 foldr' f b = adapt_m (IntMap.foldr' f b)