Hello community,

here is the log from the commit of package ghc-split for openSUSE:Factory 
checked in at 2016-05-17 17:14:45
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/ghc-split (Old)
 and      /work/SRC/openSUSE:Factory/.ghc-split.new (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++

Package is "ghc-split"

Changes:
--------
--- /work/SRC/openSUSE:Factory/ghc-split/ghc-split.changes      2016-01-22 
01:08:24.000000000 +0100
+++ /work/SRC/openSUSE:Factory/.ghc-split.new/ghc-split.changes 2016-05-17 
17:14:47.000000000 +0200
@@ -1,0 +2,7 @@
+Wed May  4 07:29:07 UTC 2016 - [email protected]
+
+- update to 0.2.3.1
+* Fix a test case which was causing occasional spurious test suite
+    failures due to too many discarded tests.
+
+-------------------------------------------------------------------

Old:
----
  split-0.2.3.tar.gz

New:
----
  split-0.2.3.1.tar.gz

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

Other differences:
------------------
++++++ ghc-split.spec ++++++
--- /var/tmp/diff_new_pack.nu3jYQ/_old  2016-05-17 17:14:48.000000000 +0200
+++ /var/tmp/diff_new_pack.nu3jYQ/_new  2016-05-17 17:14:48.000000000 +0200
@@ -21,7 +21,7 @@
 %bcond_with tests
 
 Name:           ghc-split
-Version:        0.2.3
+Version:        0.2.3.1
 Release:        0
 Summary:        Combinator library for splitting lists
 License:        BSD-3-Clause

++++++ split-0.2.3.tar.gz -> split-0.2.3.1.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/split-0.2.3/CHANGES new/split-0.2.3.1/CHANGES
--- old/split-0.2.3/CHANGES     2016-01-12 16:34:45.000000000 +0100
+++ new/split-0.2.3.1/CHANGES   2016-05-03 04:13:41.000000000 +0200
@@ -1,3 +1,9 @@
+* 0.2.3.1 (2 May 2016)
+
+  - Fix a test case which was causing occasional spurious test suite
+    failures due to too many discarded tests.  Thanks to Doug
+    Beardsley and Peter Simons for reporting the issue.
+
 * 0.2.3 (12 January 2016)
 
   - New function 'divvy' (with associated tests) from Tim Washington.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/split-0.2.3/split.cabal new/split-0.2.3.1/split.cabal
--- old/split-0.2.3/split.cabal 2016-01-12 16:34:45.000000000 +0100
+++ new/split-0.2.3.1/split.cabal       2016-05-03 04:13:41.000000000 +0200
@@ -1,5 +1,5 @@
 Name:                split
-Version:             0.2.3
+Version:             0.2.3.1
 Stability:           stable
 
 Description:         A collection of various methods for splitting
@@ -35,7 +35,7 @@
 Category:            List
 Build-type:          Simple
 Cabal-Version:       >= 1.10
-Tested-with:         GHC ==7.0.4, GHC ==7.2.1, GHC ==7.4.*, GHC ==7.6.1, GHC 
==7.8.3, GHC==7.10.3
+Tested-with:         GHC ==7.0.4, GHC ==7.2.1, GHC ==7.4.*, GHC ==7.6.1, GHC 
==7.8.3, GHC==7.10.3, GHC==8.0.1
 Bug-reports:         http://hub.darcs.net/byorgey/split/issues
 
 Test-suite split-tests
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn' 
'--exclude=.svnignore' old/split-0.2.3/test/Properties.hs 
new/split-0.2.3.1/test/Properties.hs
--- old/split-0.2.3/test/Properties.hs  2016-01-12 16:34:45.000000000 +0100
+++ new/split-0.2.3.1/test/Properties.hs        2016-05-03 04:13:41.000000000 
+0200
@@ -363,8 +363,14 @@
 prop_chop_words s = words s' == (filter (not . null) . chop (span (not . 
isSpace) . dropWhile isSpace) $ s')
   where s' = map unEltWS s
 
-prop_divvy_evenly :: [Elt] -> Positive Int -> Property
-prop_divvy_evenly elems (Positive n) = (length elems `mod` n == 0) ==> concat 
(divvy n n elems) == elems
+prop_divvy_evenly :: [Elt] -> Positive Int -> Bool
+prop_divvy_evenly elems (Positive n) = concat (divvy n n elems') == elems'
+  where
+    -- Chop off the smallest possible tail of elems to make the length
+    -- evenly divisible by n.  This property used to have a
+    -- precondition (length elemens `mod` n == 0), but that led to too
+    -- many discarded test cases and occasional test suite failures.
+    elems' = take ((length elems `div` n) * n) elems
 
 prop_divvy_discard_remainder :: [Elt] -> Positive Int -> Bool
 prop_divvy_discard_remainder elems (Positive n) =


Reply via email to