transformers 0.6.0.3 → 0.6.0.4

raw patch · 25 files changed

+50/−47 lines, 25 files

Files

• Control/Applicative/Backwards.hs +2/−2
• Control/Applicative/Lift.hs +2/−2
• Control/Monad/Trans/Accum.hs +2/−2
• Control/Monad/Trans/Cont.hs +2/−2
• Control/Monad/Trans/Except.hs +2/−2
• Control/Monad/Trans/Identity.hs +2/−2
• Control/Monad/Trans/Maybe.hs +2/−2
• Control/Monad/Trans/RWS/CPS.hs +2/−2
• Control/Monad/Trans/RWS/Lazy.hs +2/−2
• Control/Monad/Trans/RWS/Strict.hs +2/−2
• Control/Monad/Trans/Reader.hs +2/−2
• Control/Monad/Trans/Select.hs +2/−2
• Control/Monad/Trans/State/Lazy.hs +2/−2
• Control/Monad/Trans/State/Strict.hs +2/−2
• Control/Monad/Trans/Writer/CPS.hs +2/−2
• Control/Monad/Trans/Writer/Lazy.hs +2/−2
• Control/Monad/Trans/Writer/Strict.hs +2/−2
• Data/Functor/Constant.hs +2/−2
• Data/Functor/Reverse.hs +2/−2
• changelog +3/−0
• legacy/pre709/Data/Functor/Identity.hs +2/−2
• legacy/pre711/Data/Functor/Compose.hs +2/−2
• legacy/pre711/Data/Functor/Product.hs +2/−2
• legacy/pre711/Data/Functor/Sum.hs +2/−2
• transformers.cabal +1/−1

@@ -31,7 +31,7 @@ #if MIN_VERSION_base(4,12,0) import Data.Functor.Contravariant #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -47,7 +47,7 @@ newtype Backwards f a = Backwards { forwards :: f a } #if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)-#elif __GLASGOW_HASKELL__ >= 702+#elif __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -41,7 +41,7 @@ import Data.Monoid (Monoid(..)) import Data.Traversable (Traversable(traverse)) #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -50,7 +50,7 @@ data Lift f a = Pure a | Other (f a) #if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)-#elif __GLASGOW_HASKELL__ >= 702+#elif __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -71,7 +71,7 @@ #if !MIN_VERSION_base(4,8,0) import Data.Monoid #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -134,7 +134,7 @@ -- --  * a writer monad transformer with the extra ability to read all previous output. newtype AccumT w m a = AccumT (w -> m (a, w))-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -59,7 +59,7 @@ #if MIN_VERSION_base(4,9,0) import qualified Control.Monad.Fail as Fail #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -140,7 +140,7 @@ -- 'ContT' is not a functor on the category of monads, and many operations -- cannot be lifted through it. newtype ContT r m a = ContT { runContT :: (a -> m r) -> m r }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -74,7 +74,7 @@ import Data.Monoid (Monoid(mempty, mappend)) import Data.Traversable (Traversable(traverse)) #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -128,7 +128,7 @@ newtype ExceptT e m a = ExceptT (m (Either e a)) #if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)-#elif __GLASGOW_HASKELL__ >= 702+#elif __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -55,7 +55,7 @@ import Data.Traversable (Traversable(traverse)) #endif import Prelude hiding (foldr, foldr1, foldl, foldl1, null, length)-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -63,7 +63,7 @@ newtype IdentityT f a = IdentityT { runIdentityT :: f a } #if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)-#elif __GLASGOW_HASKELL__ >= 702+#elif __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -65,7 +65,7 @@ import Data.Foldable (Foldable(foldMap)) import Data.Traversable (Traversable(traverse)) #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -80,7 +80,7 @@ newtype MaybeT m a = MaybeT { runMaybeT :: m (Maybe a) } #if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)-#elif __GLASGOW_HASKELL__ >= 702+#elif __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -83,7 +83,7 @@ #if MIN_VERSION_base(4,9,0) import qualified Control.Monad.Fail as Fail #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -149,7 +149,7 @@ -- collecting an output of type @w@ and updating a state of type @s@ -- to an inner monad @m@. newtype RWST r w s m a = RWST { unRWST :: r -> s -> w -> m (a, s, w) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -80,7 +80,7 @@ #if !(MIN_VERSION_base(4,8,0)) import Data.Monoid #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -143,7 +143,7 @@ -- collecting an output of type @w@ and updating a state of type @s@ -- to an inner monad @m@. newtype RWST r w s m a = RWST { runRWST :: r -> s -> m (a, s, w) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif -- | Evaluate a computation with the given initial state and environment,

@@ -83,7 +83,7 @@ #if !(MIN_VERSION_base(4,8,0)) import Data.Monoid #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -146,7 +146,7 @@ -- collecting an output of type @w@ and updating a state of type @s@ -- to an inner monad @m@. newtype RWST r w s m a = RWST { runRWST :: r -> s -> m (a, s, w) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -67,7 +67,7 @@ #if (MIN_VERSION_base(4,2,0)) && !(MIN_VERSION_base(4,8,0)) import Data.Functor ((<$)) #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -119,7 +119,7 @@ newtype ReaderT r m a = ReaderT { runReaderT :: r -> m a } #if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)-#elif __GLASGOW_HASKELL__ >= 702+#elif __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -54,7 +54,7 @@ import qualified Control.Monad.Fail as Fail #endif import Data.Functor.Identity-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -84,7 +84,7 @@ -- 'SelectT' is not a functor on the category of monads, and many operations -- cannot be lifted through it. newtype SelectT r m a = SelectT ((a -> m r) -> m a)-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -88,7 +88,7 @@ import qualified Control.Monad.Fail as Fail #endif import Control.Monad.Fix-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -163,7 +163,7 @@ -- the final state of the first computation as the initial state of -- the second. newtype StateT s m a = StateT { runStateT :: s -> m (a,s) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -85,7 +85,7 @@ import qualified Control.Monad.Fail as Fail #endif import Control.Monad.Fix-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -160,7 +160,7 @@ -- the final state of the first computation as the initial state of -- the second. newtype StateT s m a = StateT { runStateT :: s -> m (a,s) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -69,7 +69,7 @@ #if MIN_VERSION_base(4,9,0) import qualified Control.Monad.Fail as Fail #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -120,7 +120,7 @@ -- combines the outputs of the subcomputations using 'mappend'.  newtype WriterT w m a = WriterT { unWriterT :: w -> m (a, w) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -74,7 +74,7 @@ import Data.Traversable (Traversable(traverse)) #endif import Prelude hiding (null, length)-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -122,7 +122,7 @@ -- The 'return' function produces the output 'mempty', while @>>=@ -- combines the outputs of the subcomputations using 'mappend'. newtype WriterT w m a = WriterT { runWriterT :: m (a, w) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -77,7 +77,7 @@ import Data.Traversable (Traversable(traverse)) #endif import Prelude hiding (null, length)-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -125,7 +125,7 @@ -- The 'return' function produces the output 'mempty', while @>>=@ -- combines the outputs of the subcomputations using 'mappend'. newtype WriterT w m a = WriterT { runWriterT :: m (a, w) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -54,7 +54,7 @@ #if __GLASGOW_HASKELL__ >= 800 import Data.Data #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -66,7 +66,7 @@ #endif #if __GLASGOW_HASKELL__ >= 710         , Generic, Generic1-#elif __GLASGOW_HASKELL__ >= 702+#elif __GLASGOW_HASKELL__ >= 704         , Generic #endif         )

@@ -44,7 +44,7 @@ import Data.Traversable (Traversable(traverse)) #endif import Data.Monoid-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -53,7 +53,7 @@ newtype Reverse f a = Reverse { getReverse :: f a } #if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)-#elif __GLASGOW_HASKELL__ >= 702+#elif __GLASGOW_HASKELL__ >= 704     deriving (Generic) #endif 

@@ -1,5 +1,8 @@ -*-change-log-*- +0.6.0.4 Ross Paterson <R.Paterson@city.ac.uk> Feb 2022+	* Restrict deriving (Generic) to GHC >= 7.4+ 0.6.0.3 Ross Paterson <R.Paterson@city.ac.uk> Feb 2022 	* Restrict MonadTrans constraint to GHC >= 8.8 

@@ -61,7 +61,7 @@ #endif import Data.Ix (Ix(..)) import Foreign (Storable(..), castPtr)-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -71,7 +71,7 @@ #if __GLASGOW_HASKELL__ >= 700              , Data, Typeable #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704              , Generic #endif #if __GLASGOW_HASKELL__ >= 706

@@ -45,7 +45,7 @@ #endif import Data.Foldable (Foldable(foldMap)) import Data.Traversable (Traversable(traverse))-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif @@ -56,7 +56,7 @@ -- but the composition of monads is not always a monad. newtype Compose f g a = Compose { getCompose :: f (g a) } -#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 deriving instance Generic (Compose f g a)  instance Functor f => Generic1 (Compose f g) where

@@ -50,14 +50,14 @@ #endif import Data.Monoid (mappend) import Data.Traversable (Traversable(traverse))-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif  -- | Lifted product of functors. data Product f g a = Pair (f a) (g a) -#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 deriving instance Generic (Product f g a)  instance Generic1 (Product f g) where

@@ -45,14 +45,14 @@ #endif import Data.Monoid (mappend) import Data.Traversable (Traversable(traverse))-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 import GHC.Generics #endif  -- | Lifted sum of functors. data Sum f g a = InL (f a) | InR (g a) -#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 704 deriving instance Generic (Sum f g a)  instance Generic1 (Sum f g) where

@@ -1,5 +1,5 @@ name:         transformers-version:      0.6.0.3+version:      0.6.0.4 license:      BSD3 license-file: LICENSE author:       Andy Gill, Ross Paterson