split 0.2.3.4 → 0.2.3.5
raw patch · 4 files changed
+30/−5 lines, 4 filesdep ~base
Dependency ranges changed: base
Files
- CHANGES +9/−0
- README +1/−1
- split.cabal +19/−3
- test/Properties.hs +1/−1
CHANGES view
@@ -1,3 +1,12 @@+* 0.2.3.5 (11 August 2022)++ - Change base upper bound to < 5.+ - Test with GHC 9.2 and 9.4.++* 0.2.3.4-r1 (22 February 2021)++ - Allow base-4.15 for GHC-9.0+ * 0.2.3.4 (22 February 2020) - Allow base-4.14 for GHC-8.10
README view
@@ -9,7 +9,7 @@ There are no dependencies other than the base package. Data.List.Split has been tested with versions of GHC from 6.8.3 up- through 8.0.1. It is completely Haskell2010 (probably also+ through 9.0.1. It is completely Haskell2010 (probably also Haskell98) compliant, so it probably builds with other compilers as well.
split.cabal view
@@ -1,5 +1,5 @@ Name: split-Version: 0.2.3.4+Version: 0.2.3.5 Stability: stable Description: A collection of various methods for splitting@@ -35,7 +35,23 @@ Category: List Build-type: Simple Cabal-Version: >= 1.10-Tested-with: GHC ==7.0.4 || ==7.2.2 || ==7.4.2 || ==7.6.3 || ==7.8.4 || ==7.10.3 || ==8.0.2 || ==8.2.2 || ==8.4.4 || ==8.6.5 || ==8.8.2 || ==8.10.1+Tested-with:+ GHC == 7.0.4+ GHC == 7.2.2+ GHC == 7.4.2+ GHC == 7.6.3+ GHC == 7.8.4+ GHC == 7.10.3+ GHC == 8.0.2+ GHC == 8.2.2+ GHC == 8.4.4+ GHC == 8.6.5+ GHC == 8.8.4+ GHC == 8.10.7+ GHC == 9.0.1+ GHC == 9.2.4+ GHC == 9.4.1+ Bug-reports: https://github.com/byorgey/split/issues Test-suite split-tests@@ -51,7 +67,7 @@ Library ghc-options: -Wall- build-depends: base < 4.15+ build-depends: base < 5 exposed-modules: Data.List.Split, Data.List.Split.Internals default-language: Haskell2010 Hs-source-dirs: src
test/Properties.hs view
@@ -368,7 +368,7 @@ 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+ -- precondition (length elements `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