base-compat-batteries 0.10.1 → 0.10.2
raw patch · 6 files changed
+55/−6 lines, 6 filesdep +contravariantdep ~base-compatPVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependencies added: contravariant
Dependency ranges changed: base-compat
API changes (from Hackage documentation)
+ Data.List.NonEmpty.Compat: infixl 9 !!
+ Data.Monoid.Compat: All :: Bool -> All
+ Data.Monoid.Compat: Alt :: f a -> Alt
+ Data.Monoid.Compat: Any :: Bool -> Any
+ Data.Monoid.Compat: Dual :: a -> Dual a
+ Data.Monoid.Compat: Endo :: a -> a -> Endo a
+ Data.Monoid.Compat: First :: Maybe a -> First a
+ Data.Monoid.Compat: Last :: Maybe a -> Last a
+ Data.Monoid.Compat: Product :: a -> Product a
+ Data.Monoid.Compat: Sum :: a -> Sum a
+ Data.Monoid.Compat: [appEndo] :: Endo a -> a -> a
+ Data.Monoid.Compat: [getAll] :: All -> Bool
+ Data.Monoid.Compat: [getAlt] :: Alt -> f a
+ Data.Monoid.Compat: [getAny] :: Any -> Bool
+ Data.Monoid.Compat: [getDual] :: Dual a -> a
+ Data.Monoid.Compat: [getFirst] :: First a -> Maybe a
+ Data.Monoid.Compat: [getLast] :: Last a -> Maybe a
+ Data.Monoid.Compat: [getProduct] :: Product a -> a
+ Data.Monoid.Compat: [getSum] :: Sum a -> a
+ Data.Monoid.Compat: class Semigroup a => Monoid a
+ Data.Monoid.Compat: mappend :: Monoid a => a -> a -> a
+ Data.Monoid.Compat: mconcat :: Monoid a => [a] -> a
+ Data.Monoid.Compat: mempty :: Monoid a => a
+ Data.Monoid.Compat: newtype All
+ Data.Monoid.Compat: newtype Any
+ Data.Monoid.Compat: newtype Dual a
+ Data.Monoid.Compat: newtype Endo a
+ Data.Monoid.Compat: newtype First a
+ Data.Monoid.Compat: newtype Last a
+ Data.Monoid.Compat: newtype Product a
+ Data.Monoid.Compat: newtype Sum a
+ Data.Monoid.Compat: newtype Alt (f :: k -> *) (a :: k) :: forall k. () => k -> * -> k -> *
- Data.Functor.Compat: (<&>) :: Functor f => f a -> (a -> b) -> f b
+ Data.Functor.Compat: (<&>) :: Functor f => f a -> a -> b -> f b
- Data.Functor.Compat: fmap :: Functor f => (a -> b) -> f a -> f b
+ Data.Functor.Compat: fmap :: Functor f => a -> b -> f a -> f b
- Data.List.NonEmpty.Compat: break :: () => (a -> Bool) -> NonEmpty a -> ([a], [a])
+ Data.List.NonEmpty.Compat: break :: () => a -> Bool -> NonEmpty a -> ([a], [a])
- Data.List.NonEmpty.Compat: data NonEmpty a :: * -> *
+ Data.List.NonEmpty.Compat: data NonEmpty a
- Data.List.NonEmpty.Compat: dropWhile :: () => (a -> Bool) -> NonEmpty a -> [a]
+ Data.List.NonEmpty.Compat: dropWhile :: () => a -> Bool -> NonEmpty a -> [a]
- Data.List.NonEmpty.Compat: filter :: () => (a -> Bool) -> NonEmpty a -> [a]
+ Data.List.NonEmpty.Compat: filter :: () => a -> Bool -> NonEmpty a -> [a]
- Data.List.NonEmpty.Compat: groupAllWith :: Ord b => (a -> b) -> [a] -> [NonEmpty a]
+ Data.List.NonEmpty.Compat: groupAllWith :: Ord b => a -> b -> [a] -> [NonEmpty a]
- Data.List.NonEmpty.Compat: groupAllWith1 :: Ord b => (a -> b) -> NonEmpty a -> NonEmpty NonEmpty a
+ Data.List.NonEmpty.Compat: groupAllWith1 :: Ord b => a -> b -> NonEmpty a -> NonEmpty NonEmpty a
- Data.List.NonEmpty.Compat: groupBy :: Foldable f => (a -> a -> Bool) -> f a -> [NonEmpty a]
+ Data.List.NonEmpty.Compat: groupBy :: Foldable f => a -> a -> Bool -> f a -> [NonEmpty a]
- Data.List.NonEmpty.Compat: groupBy1 :: () => (a -> a -> Bool) -> NonEmpty a -> NonEmpty NonEmpty a
+ Data.List.NonEmpty.Compat: groupBy1 :: () => a -> a -> Bool -> NonEmpty a -> NonEmpty NonEmpty a
- Data.List.NonEmpty.Compat: groupWith :: (Foldable f, Eq b) => (a -> b) -> f a -> [NonEmpty a]
+ Data.List.NonEmpty.Compat: groupWith :: (Foldable f, Eq b) => a -> b -> f a -> [NonEmpty a]
- Data.List.NonEmpty.Compat: groupWith1 :: Eq b => (a -> b) -> NonEmpty a -> NonEmpty NonEmpty a
+ Data.List.NonEmpty.Compat: groupWith1 :: Eq b => a -> b -> NonEmpty a -> NonEmpty NonEmpty a
- Data.List.NonEmpty.Compat: iterate :: () => (a -> a) -> a -> NonEmpty a
+ Data.List.NonEmpty.Compat: iterate :: () => a -> a -> a -> NonEmpty a
- Data.List.NonEmpty.Compat: map :: () => (a -> b) -> NonEmpty a -> NonEmpty b
+ Data.List.NonEmpty.Compat: map :: () => a -> b -> NonEmpty a -> NonEmpty b
- Data.List.NonEmpty.Compat: nubBy :: () => (a -> a -> Bool) -> NonEmpty a -> NonEmpty a
+ Data.List.NonEmpty.Compat: nubBy :: () => a -> a -> Bool -> NonEmpty a -> NonEmpty a
- Data.List.NonEmpty.Compat: partition :: () => (a -> Bool) -> NonEmpty a -> ([a], [a])
+ Data.List.NonEmpty.Compat: partition :: () => a -> Bool -> NonEmpty a -> ([a], [a])
- Data.List.NonEmpty.Compat: scanl :: Foldable f => (b -> a -> b) -> b -> f a -> NonEmpty b
+ Data.List.NonEmpty.Compat: scanl :: Foldable f => b -> a -> b -> b -> f a -> NonEmpty b
- Data.List.NonEmpty.Compat: scanl1 :: () => (a -> a -> a) -> NonEmpty a -> NonEmpty a
+ Data.List.NonEmpty.Compat: scanl1 :: () => a -> a -> a -> NonEmpty a -> NonEmpty a
- Data.List.NonEmpty.Compat: scanr :: Foldable f => (a -> b -> b) -> b -> f a -> NonEmpty b
+ Data.List.NonEmpty.Compat: scanr :: Foldable f => a -> b -> b -> b -> f a -> NonEmpty b
- Data.List.NonEmpty.Compat: scanr1 :: () => (a -> a -> a) -> NonEmpty a -> NonEmpty a
+ Data.List.NonEmpty.Compat: scanr1 :: () => a -> a -> a -> NonEmpty a -> NonEmpty a
- Data.List.NonEmpty.Compat: sortBy :: () => (a -> a -> Ordering) -> NonEmpty a -> NonEmpty a
+ Data.List.NonEmpty.Compat: sortBy :: () => a -> a -> Ordering -> NonEmpty a -> NonEmpty a
- Data.List.NonEmpty.Compat: sortWith :: Ord o => (a -> o) -> NonEmpty a -> NonEmpty a
+ Data.List.NonEmpty.Compat: sortWith :: Ord o => a -> o -> NonEmpty a -> NonEmpty a
- Data.List.NonEmpty.Compat: span :: () => (a -> Bool) -> NonEmpty a -> ([a], [a])
+ Data.List.NonEmpty.Compat: span :: () => a -> Bool -> NonEmpty a -> ([a], [a])
- Data.List.NonEmpty.Compat: takeWhile :: () => (a -> Bool) -> NonEmpty a -> [a]
+ Data.List.NonEmpty.Compat: takeWhile :: () => a -> Bool -> NonEmpty a -> [a]
- Data.List.NonEmpty.Compat: unfold :: () => (a -> (b, Maybe a)) -> a -> NonEmpty b
+ Data.List.NonEmpty.Compat: unfold :: () => a -> (b, Maybe a) -> a -> NonEmpty b
- Data.List.NonEmpty.Compat: unfoldr :: () => (a -> (b, Maybe a)) -> a -> NonEmpty b
+ Data.List.NonEmpty.Compat: unfoldr :: () => a -> (b, Maybe a) -> a -> NonEmpty b
- Data.List.NonEmpty.Compat: zipWith :: () => (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c
+ Data.List.NonEmpty.Compat: zipWith :: () => a -> b -> c -> NonEmpty a -> NonEmpty b -> NonEmpty c
- Data.Semigroup.Compat: Endo :: (a -> a) -> Endo a
+ Data.Semigroup.Compat: Endo :: a -> a -> Endo a
- Data.Semigroup.Compat: data Arg a b :: * -> * -> *
+ Data.Semigroup.Compat: data Arg a b
- Data.Semigroup.Compat: newtype All :: *
+ Data.Semigroup.Compat: newtype All
- Data.Semigroup.Compat: newtype Any :: *
+ Data.Semigroup.Compat: newtype Any
- Data.Semigroup.Compat: newtype Dual a :: * -> *
+ Data.Semigroup.Compat: newtype Dual a
- Data.Semigroup.Compat: newtype Endo a :: * -> *
+ Data.Semigroup.Compat: newtype Endo a
- Data.Semigroup.Compat: newtype First a :: * -> *
+ Data.Semigroup.Compat: newtype First a
- Data.Semigroup.Compat: newtype Last a :: * -> *
+ Data.Semigroup.Compat: newtype Last a
- Data.Semigroup.Compat: newtype Max a :: * -> *
+ Data.Semigroup.Compat: newtype Max a
- Data.Semigroup.Compat: newtype Min a :: * -> *
+ Data.Semigroup.Compat: newtype Min a
- Data.Semigroup.Compat: newtype Option a :: * -> *
+ Data.Semigroup.Compat: newtype Option a
- Data.Semigroup.Compat: newtype Product a :: * -> *
+ Data.Semigroup.Compat: newtype Product a
- Data.Semigroup.Compat: newtype Sum a :: * -> *
+ Data.Semigroup.Compat: newtype Sum a
- Data.Semigroup.Compat: newtype WrappedMonoid m :: * -> *
+ Data.Semigroup.Compat: newtype WrappedMonoid m
- Data.Semigroup.Compat: option :: () => b -> (a -> b) -> Option a -> b
+ Data.Semigroup.Compat: option :: () => b -> a -> b -> Option a -> b
- Data.Void.Compat: data Void :: *
+ Data.Void.Compat: data Void
- Type.Reflection.Compat: withTypeable :: forall (a :: k) (r :: TYPE rep). () => TypeRep a -> (Typeable a => r) -> r
+ Type.Reflection.Compat: withTypeable :: () => TypeRep a -> Typeable a -> r -> r
Files
- CHANGES.markdown +12/−3
- base-compat-batteries.cabal +11/−3
- src/Control/Exception/Compat.hs +6/−0
- src/Control/Exception/Compat/Repl/Batteries.hs +8/−0
- src/Data/Functor/Contravariant/Compat.hs +10/−0
- src/Data/Functor/Contravariant/Compat/Repl/Batteries.hs +8/−0
CHANGES.markdown view
@@ -1,7 +1,16 @@+## Changes in 0.10.2 [2018.07.02]+ - Sync with `base-4.12`/GHC 8.6+ - Introduce the `Data.Functor.Contravariant.Compat` module, which+ reexports `Data.Functor.Contravariant` from `base` (if using GHC 8.6 or+ later) or the `contravariant` library (if using an earlier version of GHC).+ - This coincides with the `base-compat-0.10.2` release. Refer to the+ [`base-compat` changelog](https://github.com/haskell-compat/base-compat/blob/master/base-compat/CHANGES.markdown#changes-in-0102-20180702)+ for more details.+ ## Changes in 0.10.1 [2018.04.10]-- Add `Data.List.NonEmpty.Compat`.-- Reexport `(Data.Semigroup.<>)` from `Data.Monoid.Compat`.-- Tighten lower bounds of compat package dependencies.+ - Add `Data.List.NonEmpty.Compat`.+ - Reexport `(Data.Semigroup.<>)` from `Data.Monoid.Compat`.+ - Tighten lower bounds of compat package dependencies. - This coincides with the `base-compat-0.10.1` release. Refer to the [`base-compat` changelog](https://github.com/haskell-compat/base-compat/blob/master/base-compat/CHANGES.markdown#changes-in-0101-20180410) for more details.
base-compat-batteries.cabal view
@@ -1,5 +1,5 @@ name: base-compat-batteries-version: 0.10.1+version: 0.10.2 license: MIT license-file: LICENSE copyright: (c) 2012-2018 Simon Hengel,@@ -42,7 +42,8 @@ , GHC == 7.10.1, GHC == 7.10.2, GHC == 7.10.3 , GHC == 8.0.1, GHC == 8.0.2 , GHC == 8.2.1, GHC == 8.2.2- , GHC == 8.4.1+ , GHC == 8.4.1, GHC == 8.4.2, GHC == 8.4.3+ , GHC == 8.6.1 extra-source-files: CHANGES.markdown, README.markdown source-repository head@@ -55,7 +56,7 @@ -Wall build-depends: base >= 4.3 && < 5,- base-compat >= 0.10.1 && < 0.11+ base-compat == 0.10.2 if !impl(ghc >= 7.8) build-depends: tagged >= 0.8.5 && < 0.9@@ -72,6 +73,9 @@ if !impl(ghc >= 8.2) build-depends: bifunctors >= 5.5.2 && < 5.6+ if !impl(ghc >= 8.6)+ build-depends:+ contravariant >= 1.5 && < 1.6 ghc-options: -fno-warn-duplicate-exports @@ -81,6 +85,7 @@ exposed-modules: Control.Concurrent.Compat Control.Concurrent.MVar.Compat+ Control.Exception.Compat Control.Monad.Compat Control.Monad.Fail.Compat Control.Monad.IO.Class.Compat@@ -98,6 +103,7 @@ Data.Functor.Compat Data.Functor.Compose.Compat Data.Functor.Const.Compat+ Data.Functor.Contravariant.Compat Data.Functor.Identity.Compat Data.Functor.Product.Compat Data.Functor.Sum.Compat@@ -136,6 +142,7 @@ Control.Concurrent.Compat.Repl.Batteries Control.Concurrent.MVar.Compat.Repl.Batteries+ Control.Exception.Compat.Repl.Batteries Control.Monad.Compat.Repl.Batteries Control.Monad.Fail.Compat.Repl.Batteries Control.Monad.IO.Class.Compat.Repl.Batteries@@ -154,6 +161,7 @@ Data.Functor.Compose.Compat.Repl.Batteries Data.Functor.Const.Compat.Repl.Batteries Data.Functor.Identity.Compat.Repl.Batteries+ Data.Functor.Contravariant.Compat.Repl.Batteries Data.Functor.Product.Compat.Repl.Batteries Data.Functor.Sum.Compat.Repl.Batteries Data.IORef.Compat.Repl.Batteries
+ src/Control/Exception/Compat.hs view
@@ -0,0 +1,6 @@+{-# LANGUAGE CPP, NoImplicitPrelude, PackageImports #-}+module Control.Exception.Compat (+ module Base+) where++import "base-compat" Control.Exception.Compat as Base
+ src/Control/Exception/Compat/Repl/Batteries.hs view
@@ -0,0 +1,8 @@+{-# LANGUAGE PackageImports #-}+{-# OPTIONS_GHC -fno-warn-dodgy-exports -fno-warn-unused-imports #-}+-- | Reexports "Control.Exception.Compat"+-- from a globally unique namespace.+module Control.Exception.Compat.Repl.Batteries (+ module Control.Exception.Compat+) where+import "this" Control.Exception.Compat
+ src/Data/Functor/Contravariant/Compat.hs view
@@ -0,0 +1,10 @@+{-# LANGUAGE CPP, NoImplicitPrelude, PackageImports #-}+module Data.Functor.Contravariant.Compat (+ module Base+ ) where++#if MIN_VERSION_base(4,12,0)+import "base-compat" Data.Functor.Contravariant.Compat as Base+#else+import "contravariant" Data.Functor.Contravariant as Base+#endif
+ src/Data/Functor/Contravariant/Compat/Repl/Batteries.hs view
@@ -0,0 +1,8 @@+{-# LANGUAGE PackageImports #-}+{-# OPTIONS_GHC -fno-warn-dodgy-exports -fno-warn-unused-imports #-}+-- | Reexports "Data.Functor.Contravariant.Compat"+-- from a globally unique namespace.+module Data.Functor.Contravariant.Compat.Repl.Batteries (+ module Data.Functor.Contravariant.Compat+) where+import "this" Data.Functor.Contravariant.Compat