indexed-traversable-instances 0.1.2 → 0.1.2.1

raw patch · 2 files changed

+13/−8 lines, 2 filesdep −transformersdep ~QuickCheckdep ~basedep ~quickcheck-instancesPVP: major bump suggested

API removals or changes: PVP suggests a major version bump

Dependencies removed: transformers

Dependency ranges changed: QuickCheck, base, quickcheck-instances

API changes (from Hackage documentation)

Files

• indexed-traversable-instances.cabal +9/−8
• tests/main.hs +4/−0

@@ -1,6 +1,6 @@ cabal-version:      1.12 name:               indexed-traversable-instances-version:            0.1.2+version:            0.1.2.1 build-type:         Simple license:            BSD2 license-file:       LICENSE@@ -27,9 +27,11 @@    || ==9.0.2    || ==9.2.8    || ==9.4.8-   || ==9.6.5-   || ==9.8.2+   || ==9.6.6+   || ==9.8.4    || ==9.10.1+   || ==9.12.4+   || ==9.14.1  source-repository head   type:     git@@ -40,7 +42,7 @@   default-language: Haskell2010   hs-source-dirs:   src   build-depends:-      base                  >=4.12     && <4.21+      base                  >=4.12     && <4.23     , indexed-traversable   >=0.1.4    && <0.2     , OneTuple              >=0.3      && <0.5     , tagged                >=0.8.6    && <0.9@@ -70,12 +72,11 @@     , indexed-traversable     , indexed-traversable-instances     , OneTuple-    , transformers     , unordered-containers     , vector    build-depends:-      QuickCheck            >=2.14.2   && <2.15-    , quickcheck-instances  >=0.3.29   && <0.4+      QuickCheck            >=2.14.2   && <2.19+    , quickcheck-instances  >=0.3.29   && <0.5     , tasty                 >=1.2.3    && <1.6-    , tasty-quickcheck      >=0.10.1.1 && <0.11+    , tasty-quickcheck      >=0.10.1.1 && <0.12

@@ -13,12 +13,14 @@ import Test.Tasty            (TestTree, defaultMain, testGroup) import Test.Tasty.QuickCheck (testProperty) +#if MIN_VERSION_base(4,16,0) #if MIN_VERSION_OneTuple(0,4,0) import Data.Tuple.Solo     (Solo (MkSolo)) #else import Data.Tuple.Solo     (Solo (Solo)) #define MkSolo Solo #endif+#endif  import qualified Data.HashMap.Lazy as HM import qualified Data.Map          as Map@@ -50,7 +52,9 @@     , battery $ mkT (HM.keys :: forall a. HM.HashMap I a -> [I])     , battery $ mkT (zipWith const [0 ..] . toList :: forall a. Seq.Seq a -> [Int])     , battery $ mkT $ zipWith const [0 ..] . V.toList+#if MIN_VERSION_base(4,16,0)     , battery $ mkT $ \(MkSolo _) -> [()]+#endif #if MIN_VERSION_containers(0,6,3)     , battery $ mkT IntMap.keys #endif