range-set-list 0.0.7 → 0.1.0.0

raw patch · 4 files changed

+40/−51 lines, 4 filesdep ~basedep ~tastydep ~tasty-quickcheckPVP ok

version bump matches the API change (PVP)

Dependency ranges changed: base, tasty, tasty-quickcheck

API changes (from Hackage documentation)

Files

• .gitignore +0/−1
• .travis.yml +0/−12
• range-set-list.cabal +39/−37
• src/Data/RangeSet/List.hs +1/−1

@@ -1,1 +0,0 @@-dist/

@@ -1,12 +0,0 @@-language: haskell-ghc:-  - 7.4-  - 7.6-  - 7.8--before_install:-  - cabal install packdeps--script:-  - cabal test --show-details=always-  - packdeps range-set-list.cabal

@@ -1,48 +1,50 @@+-- This file has been generated from package.yaml by hpack version 0.7.1.+--+-- see: https://github.com/sol/hpack+ name:                range-set-list-version:             0.0.7+version:             0.1.0.0 synopsis:            Memory efficient sets with continuous ranges of elements.-description:         Memory efficient sets with continuous ranges of elements. List based implementation. Interface mimics "Data.Set" interface where possible.-homepage:            https://github.com/phadej/range-set-list+description:         Memory efficient sets with continuous ranges of elements. List based implementation. Interface mimics 'Data.Set' interface where possible.+homepage:            https://github.com/phadej/range-set-list#readme bug-reports:         https://github.com/phadej/range-set-list/issues license:             MIT license-file:        LICENSE-stability:           experimental-author:              Oleg Grenrus-maintainer:          oleg.grenrus@iki.fi-copyright:           Copyright (c) 2013 Oleg Grenrus-category:            Data Structures+author:              Oleg Grenrus <oleg.grenrus@iki.fi>+maintainer:          Oleg Grenrus <oleg.grenrus@iki.fi>+category:            Documentation+tested-with:         GHC==7.4.2, GHC==7.6.3, GHC==7.8.4, GHC==7.10.2 build-type:          Simple-cabal-version:       >=1.10-extra-source-files:  .gitignore-                     .travis.yml-                     README.md-                     CHANGELOG.md+cabal-version:       >= 1.10 -flag optimized-  default: True+extra-source-files:+  CHANGELOG.md+  README.md +source-repository head+  type: git+  location: https://github.com/phadej/range-set-list+ library-  exposed-modules:     Data.RangeSet.List-  build-depends:       base >=4.5 && <5-  default-language:    Haskell98-  hs-source-dirs:      src-  ghc-options:         -Wall-                       -fwarn-tabs-  if flag(optimized)-    ghc-options:       -funbox-strict-fields-                       -O2-                       -fspec-constr-count=6-                       -fmax-simplifier-iterations=10-                       -fdicts-cheap+  hs-source-dirs:+    src+  ghc-options: -Wall -fwarn-tabs+  build-depends:+    base >=4.5 && <4.9+  exposed-modules:+    Data.RangeSet.List+  default-language: Haskell2010  test-suite test-  default-language:    Haskell2010-  type:                exitcode-stdio-1.0-  hs-source-dirs:      tests-  main-is:             Tests.hs-  ghc-options:         -Wall-  build-depends:       base >=4.5 && <5,-                       containers >= 0.5 && <0.6,-                       tasty >= 0.8,-                       tasty-quickcheck == 0.8.0.3,-                       range-set-list+  type: exitcode-stdio-1.0+  main-is: Tests.hs+  hs-source-dirs:+    tests+  ghc-options: -Wall -fwarn-tabs+  build-depends:+    base >=4.5 && <4.9,+    containers        >=0.5 && <0.6,+    tasty             >=0.8 && <0.12,+    tasty-quickcheck  >=0.8 && <0.9,+    range-set-list+  default-language: Haskell2010

@@ -216,7 +216,7 @@ findMin (RSet ((x, _) : _))  = x findMin _                    = error "RangeSet.List.findMin: empty set" --- | /O(n)/. The minimal element of a set.+-- | /O(n)/. The maximal element of a set. findMax :: RSet a -> a findMax (RSet rs) = findMax' rs   where findMax' [(_, x)]  = x