packages feed

Cabal revisions of Ranged-sets-0.4.0

Hackage metadata revisions edit the .cabal file after upload; each diff below is one revision.

revision 1
-name: Ranged-sets-version: 0.4.0-cabal-version: 1.24-build-type: Simple-license: BSD3-license-file: LICENSE.txt-copyright: Paul Johnson, 2005, 2006, 2007, 2008, 2019-maintainer: paul@cogito.org.uk-stability: beta-homepage: https://github.com/PaulJohnson/Ranged-sets-package-url:-bug-reports:-synopsis: Ranged sets for Haskell-description: A ranged set is an ordered list of ranges.  This allows sets such as all reals x such that:-             .-             > (0.25 < x <= 0.75 or 1.4 <= x < 2.3 or 4.5 < x)-             .-             Alternatively you can have all strings s such that:-             .-             >    ("F" <= s < "G")-category: Data-author: Paul Johnson-extra-source-files: CHANGES.txt README.txt--library-    build-depends: HUnit -any, QuickCheck >=2, base >=4 && <5-    exposed-modules: Data.Ranged Data.Ranged.Ranges-                 Data.Ranged.RangedSet Data.Ranged.Boundaries-    exposed: True-    buildable: True-    default-language: Haskell2010---Test-suite properties-    type: exitcode-stdio-1.0-    default-language: Haskell2010-    main-is: Main.hs-    hs-source-dirs: tests .-    other-modules: Data.Ranged Data.Ranged.Ranges-                 Data.Ranged.RangedSet Data.Ranged.Boundaries-    build-depends:-        base >= 4 && < 5,-        HUnit,-        QuickCheck-    +name: Ranged-sets
+version: 0.4.0
+x-revision: 1
+cabal-version: 1.24
+build-type: Simple
+license: BSD3
+license-file: LICENSE.txt
+copyright: Paul Johnson, 2005, 2006, 2007, 2008, 2019
+maintainer: paul@cogito.org.uk
+stability: beta
+homepage: https://github.com/PaulJohnson/Ranged-sets
+package-url:
+bug-reports:
+synopsis: Ranged sets for Haskell
+description: A ranged set is an ordered list of ranges.  This allows sets such as all reals x such that:
+             .
+             > (0.25 < x <= 0.75 or 1.4 <= x < 2.3 or 4.5 < x)
+             .
+             Alternatively you can have all strings s such that:
+             .
+             >    ("F" <= s < "G")
+category: Data
+author: Paul Johnson
+extra-source-files: CHANGES.txt README.txt
+
+library
+    build-depends: HUnit -any, QuickCheck >=2, base >=4 && <5
+    exposed-modules: Data.Ranged Data.Ranged.Ranges
+                 Data.Ranged.RangedSet Data.Ranged.Boundaries
+    exposed: True
+    buildable: True
+    default-language: Haskell2010
+
+
+Test-suite properties
+    type: exitcode-stdio-1.0
+    default-language: Haskell2010
+    main-is: Main.hs
+    hs-source-dirs: tests .
+    other-modules: Data.Ranged Data.Ranged.Ranges
+                 Data.Ranged.RangedSet Data.Ranged.Boundaries
+    build-depends:
+        base >= 4.11 && < 5,
+        HUnit,
+        QuickCheck
+    
revision 2
 name: Ranged-sets
 version: 0.4.0
-x-revision: 1
+x-revision: 2
 cabal-version: 1.24
 build-type: Simple
 license: BSD3
 extra-source-files: CHANGES.txt README.txt
 
 library
-    build-depends: HUnit -any, QuickCheck >=2, base >=4 && <5
+    build-depends: HUnit -any, QuickCheck >=2, base >=4.11 && <5
     exposed-modules: Data.Ranged Data.Ranged.Ranges
                  Data.Ranged.RangedSet Data.Ranged.Boundaries
     exposed: True