enummapset 0.7.1.0 → 0.7.2.0
raw patch · 6 files changed
+18/−15 lines, 6 filesdep ~aesondep ~containersdep ~deepseqPVP ok
version bump matches the API change (PVP)
Dependency ranges changed: aeson, containers, deepseq
API changes (from Hackage documentation)
Files
- Data/EnumMap/Base.hs +1/−1
- Data/EnumMap/Lazy.hs +1/−1
- Data/EnumMap/Strict.hs +1/−1
- Data/EnumSet.hs +1/−1
- enummapset.cabal +8/−5
- tests/intset-properties.hs +6/−6
Data/EnumMap/Base.hs view
@@ -165,7 +165,7 @@ , maxViewWithKey ) where -import Prelude hiding ( filter, foldr, foldl, lookup, map, null )+import Prelude hiding ( Foldable(..), filter, lookup, map ) import qualified Prelude as P import Control.Applicative ( Applicative, liftA )
Data/EnumMap/Lazy.hs view
@@ -165,6 +165,6 @@ , maxViewWithKey ) where -import Prelude hiding (filter, foldl, foldr, lookup, map, null)+import Prelude hiding (Foldable(..), filter, lookup, map) import Data.EnumMap.Base
Data/EnumMap/Strict.hs view
@@ -165,7 +165,7 @@ , maxViewWithKey ) where -import Prelude hiding (filter, foldl, foldr, lookup, map, null)+import Prelude hiding (Foldable(..), filter, lookup, map) import qualified Prelude as P import Control.Arrow (first, second, (***))
Data/EnumSet.hs view
@@ -98,7 +98,7 @@ ) where -import Prelude hiding ( filter, foldl, foldr, lookup, map, null )+import Prelude hiding ( Foldable(..), filter, lookup, map ) import qualified Prelude as P import Data.IntSet ( IntSet )
enummapset.cabal view
@@ -1,5 +1,5 @@ name: enummapset-version: 0.7.1.0+version: 0.7.2.0 synopsis: IntMap and IntSet with Enum keys/elements. description: This package contains simple wrappers around 'Data.IntMap' and 'Data.IntSet' with 'Enum' keys and elements respectively.@@ -14,7 +14,10 @@ , GHC==8.8.4 , GHC==8.10.7 , GHC==9.0.2- , GHC==9.2.2+ , GHC==9.2.8+ , GHC==9.4.8+ , GHC==9.6.3+ , GHC==9.8.1 author: Michal Terepeta and others maintainer: Mikolaj Konarski <mikolaj.konarski@funktory.com> category: Data Structures@@ -44,9 +47,9 @@ build-depends: base >= 4.6 && < 5,- aeson,+ aeson >= 1.3 && < 2.3, containers >= 0.5.11 && < 0.7,- deepseq >= 1.2 && < 1.5+ deepseq >= 1.2 && < 1.6 if impl(ghc < 8.0) build-depends: semigroups >=0.1 && <1.0@@ -92,6 +95,6 @@ test-framework, test-framework-hunit, test-framework-quickcheck2- + if impl(ghc < 8.0) build-depends: semigroups
tests/intset-properties.hs view
@@ -13,7 +13,7 @@ import Data.Monoid (mempty) import qualified Data.Set as Set import Data.Word (Word)-import Prelude hiding (filter, foldl, foldr, lookup, map, null)+import Prelude hiding (Foldable(..), filter, lookup, map) import Test.Framework import Test.Framework.Providers.HUnit import Test.Framework.Providers.QuickCheck2@@ -167,7 +167,7 @@ prop_Member :: [Int] -> Int -> Bool prop_Member xs n = let m = fromList xs- in all (\k -> k `member` m == (k `elem` xs)) (n : xs)+ in all (\k -> k `member` m == (k `List.elem` xs)) (n : xs) prop_NotMember :: [Int] -> Int -> Bool prop_NotMember xs n =@@ -334,10 +334,10 @@ where sz = size s prop_findMax :: EnumSet Int -> Property-prop_findMax s = not (null s) ==> findMax s == maximum (toList s)+prop_findMax s = not (null s) ==> findMax s == List.maximum (toList s) prop_findMin :: EnumSet Int -> Property-prop_findMin s = not (null s) ==> findMin s == minimum (toList s)+prop_findMin s = not (null s) ==> findMin s == List.minimum (toList s) prop_ord :: EnumSet Int -> EnumSet Int -> Bool prop_ord s1 s2 = s1 `compare` s2 == toList s1 `compare` toList s2@@ -363,12 +363,12 @@ prop_maxView :: EnumSet Int -> Bool prop_maxView s = case maxView s of Nothing -> null s- Just (m,s') -> m == maximum (toList s) && s == insert m s' && m `notMember` s'+ Just (m,s') -> m == List.maximum (toList s) && s == insert m s' && m `notMember` s' prop_minView :: EnumSet Int -> Bool prop_minView s = case minView s of Nothing -> null s- Just (m,s') -> m == minimum (toList s) && s == insert m s' && m `notMember` s'+ Just (m,s') -> m == List.minimum (toList s) && s == insert m s' && m `notMember` s' prop_split :: EnumSet Int -> Int -> Property prop_split s i = case split i s of