Hello community,

here is the log from the commit of package ghc-integer-logarithms for 
openSUSE:Factory checked in at 2018-05-30 12:10:12
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/ghc-integer-logarithms (Old)
 and      /work/SRC/openSUSE:Factory/.ghc-integer-logarithms.new (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Package is "ghc-integer-logarithms"

Wed May 30 12:10:12 2018 rev:5 rq:607829 version:1.0.2.1

Changes:
--------
--- 
/work/SRC/openSUSE:Factory/ghc-integer-logarithms/ghc-integer-logarithms.changes
    2017-09-15 21:52:07.338746995 +0200
+++ 
/work/SRC/openSUSE:Factory/.ghc-integer-logarithms.new/ghc-integer-logarithms.changes
       2018-05-30 12:26:13.812487099 +0200
@@ -1,0 +2,7 @@
+Mon May 14 17:02:11 UTC 2018 - [email protected]
+
+- Update integer-logarithms to version 1.0.2.1.
+  - GHC-8.4.1 compatible release
+  - Bump dependencies' bounds
+
+-------------------------------------------------------------------

Old:
----
  integer-logarithms-1.0.2.tar.gz

New:
----
  integer-logarithms-1.0.2.1.tar.gz

++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Other differences:
------------------
++++++ ghc-integer-logarithms.spec ++++++
--- /var/tmp/diff_new_pack.eWu1JS/_old  2018-05-30 12:26:15.336435742 +0200
+++ /var/tmp/diff_new_pack.eWu1JS/_new  2018-05-30 12:26:15.340435607 +0200
@@ -1,7 +1,7 @@
 #
 # spec file for package ghc-integer-logarithms
 #
-# Copyright (c) 2017 SUSE LINUX GmbH, Nuernberg, Germany.
+# Copyright (c) 2018 SUSE LINUX GmbH, Nuernberg, Germany.
 #
 # All modifications and additions to the file contributed by third parties
 # remain the property of their copyright owners, unless otherwise agreed
@@ -19,7 +19,7 @@
 %global pkg_name integer-logarithms
 %bcond_with tests
 Name:           ghc-%{pkg_name}
-Version:        1.0.2
+Version:        1.0.2.1
 Release:        0
 Summary:        Integer logarithms
 License:        MIT
@@ -77,7 +77,7 @@
 %ghc_pkg_recache
 
 %files -f %{name}.files
-%doc LICENSE
+%license LICENSE
 
 %files devel -f %{name}-devel.files
 %doc changelog.md readme.md

++++++ integer-logarithms-1.0.2.tar.gz -> integer-logarithms-1.0.2.1.tar.gz 
++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/integer-logarithms-1.0.2/changelog.md 
new/integer-logarithms-1.0.2.1/changelog.md
--- old/integer-logarithms-1.0.2/changelog.md   2017-07-07 14:03:58.000000000 
+0200
+++ new/integer-logarithms-1.0.2.1/changelog.md 2018-03-07 09:30:25.000000000 
+0100
@@ -1,3 +1,9 @@
+1.0.2.1
+-------
+
+- GHC-8.4.1 compatible release
+- Bump dependencies' bounds
+
 1.0.2
 -----
 
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/integer-logarithms-1.0.2/integer-logarithms.cabal 
new/integer-logarithms-1.0.2.1/integer-logarithms.cabal
--- old/integer-logarithms-1.0.2/integer-logarithms.cabal       2017-07-07 
14:03:58.000000000 +0200
+++ new/integer-logarithms-1.0.2.1/integer-logarithms.cabal     2018-03-07 
09:30:25.000000000 +0100
@@ -1,5 +1,5 @@
 name:               integer-logarithms
-version:            1.0.2
+version:            1.0.2.1
 cabal-version:      >= 1.10
 author:             Daniel Fischer
 copyright:          (c) 2011 Daniel Fischer
@@ -30,7 +30,8 @@
   GHC==7.8.4,
   GHC==7.10.3,
   GHC==8.0.2,
-  GHC==8.2.1
+  GHC==8.2.2,
+  GHC==8.4.1
 
 extra-source-files  : readme.md changelog.md
 
@@ -48,7 +49,7 @@
   default-language: Haskell2010
   hs-source-dirs: src
   build-depends:
-    base >= 4.3 && < 4.11,
+    base >= 4.3 && < 4.12,
     array >= 0.3 && < 0.6,
     ghc-prim < 0.6
   if impl(ghc >= 7.10)
@@ -96,12 +97,12 @@
   build-depends:
     base,
     integer-logarithms,
-    tasty >= 0.10 && < 0.12,
+    tasty >= 0.10 && < 1.1,
     tasty-smallcheck >= 0.8 && < 0.9,
-    tasty-quickcheck >= 0.8 && < 0.10,
-    tasty-hunit >= 0.9 && < 0.10,
-    QuickCheck >= 2.10 && < 2.11,
-    smallcheck >= 1.1 && < 1.2
+    tasty-quickcheck >= 0.8 && < 0.11,
+    tasty-hunit >= 0.9 && < 0.11,
+    QuickCheck >= 2.10 && < 2.12,
+    smallcheck >= 1.1.3 && < 1.2
   if !impl(ghc >= 7.10)
     build-depends: nats >= 1.1 && <1.2
 
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' 
old/integer-logarithms-1.0.2/test-suite/Math/NumberTheory/TestUtils.hs 
new/integer-logarithms-1.0.2.1/test-suite/Math/NumberTheory/TestUtils.hs
--- old/integer-logarithms-1.0.2/test-suite/Math/NumberTheory/TestUtils.hs      
2017-07-07 14:03:58.000000000 +0200
+++ new/integer-logarithms-1.0.2.1/test-suite/Math/NumberTheory/TestUtils.hs    
2018-03-07 09:30:25.000000000 +0100
@@ -11,7 +11,6 @@
 {-# LANGUAGE FlexibleInstances          #-}
 {-# LANGUAGE GeneralizedNewtypeDeriving #-}
 {-# LANGUAGE MultiParamTypeClasses      #-}
-{-# LANGUAGE StandaloneDeriving         #-}
 
 {-# OPTIONS_GHC -fno-warn-orphans #-}
 
@@ -22,15 +21,12 @@
   , testSmallAndQuick
   ) where
 
-import Test.SmallCheck.Series (cons2)
 import Test.Tasty
 import Test.Tasty.SmallCheck as SC
 import Test.Tasty.QuickCheck as QC hiding (Positive, NonNegative, generate, 
getNonNegative)
 import Test.SmallCheck.Series (Positive(..), NonNegative(..), Serial(..), 
Series, generate)
 
 import Control.Applicative
-import Data.Word
-import Numeric.Natural
 
 testSmallAndQuick
   :: SC.Testable IO a
@@ -42,21 +38,6 @@
   ]
 
 -------------------------------------------------------------------------------
--- Serial monadic actions
-
-instance Monad m => Serial m Word where
-  series =
-    generate (\d -> if d >= 0 then pure 0 else empty) <|> nats
-    where
-      nats = generate $ \d -> if d > 0 then [1 .. fromInteger (toInteger d)] 
else empty
-
-instance Monad m => Serial m Natural where
-  series =
-    generate (\d -> if d >= 0 then pure 0 else empty) <|> nats
-    where
-      nats = generate $ \d -> if d > 0 then [1 .. fromInteger (toInteger d)] 
else empty
-
--------------------------------------------------------------------------------
 -- Power
 
 newtype Power a = Power { getPower :: a }


Reply via email to