transformers 0.6.0.0 → 0.6.0.1

raw patch · 11 files changed

+32/−13 lines, 11 files

Files

• Control/Applicative/Backwards.hs +3/−1
• Control/Applicative/Lift.hs +3/−1
• Control/Monad/Trans/Except.hs +3/−1
• Control/Monad/Trans/Identity.hs +3/−1
• Control/Monad/Trans/Maybe.hs +3/−1
• Control/Monad/Trans/RWS/CPS.hs +1/−1
• Control/Monad/Trans/Reader.hs +3/−1
• Data/Functor/Constant.hs +6/−4
• Data/Functor/Reverse.hs +3/−1
• changelog +3/−0
• transformers.cabal +1/−1

@@ -45,8 +45,10 @@ -- | The same functor, but with an 'Applicative' instance that performs -- actions in the reverse order. newtype Backwards f a = Backwards { forwards :: f a }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)+#elif __GLASGOW_HASKELL__ >= 702+    deriving (Generic) #endif  instance (Eq1 f) => Eq1 (Backwards f) where

@@ -48,8 +48,10 @@ -- | Applicative functor formed by adding pure computations to a given -- applicative functor. data Lift f a = Pure a | Other (f a)-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)+#elif __GLASGOW_HASKELL__ >= 702+    deriving (Generic) #endif  instance (Eq1 f) => Eq1 (Lift f) where

@@ -126,8 +126,10 @@ -- value, while @>>=@ sequences two subcomputations, exiting on the -- first exception. newtype ExceptT e m a = ExceptT (m (Either e a))-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)+#elif __GLASGOW_HASKELL__ >= 702+    deriving (Generic) #endif  instance (Eq e, Eq1 m) => Eq1 (ExceptT e m) where

@@ -61,8 +61,10 @@  -- | The trivial monad transformer, which maps a monad to an equivalent monad. newtype IdentityT f a = IdentityT { runIdentityT :: f a }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)+#elif __GLASGOW_HASKELL__ >= 702+    deriving (Generic) #endif  instance (Eq1 f) => Eq1 (IdentityT f) where

@@ -78,8 +78,10 @@ -- value, while @>>=@ sequences two subcomputations, exiting if either -- computation does. newtype MaybeT m a = MaybeT { runMaybeT :: m (Maybe a) }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)+#elif __GLASGOW_HASKELL__ >= 702+    deriving (Generic) #endif  instance (Eq1 m) => Eq1 (MaybeT m) where

@@ -26,7 +26,7 @@ -- For a lazy version with the same interface, -- see "Control.Monad.Trans.RWS.Lazy". ------------------------------------------------------------------------------  + module Control.Monad.Trans.RWS.CPS (     -- * The RWS monad     RWS,

@@ -117,8 +117,10 @@ -- The 'return' function ignores the environment, while @>>=@ passes -- the inherited environment to both subcomputations. newtype ReaderT r m a = ReaderT { runReaderT :: r -> m a }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)+#elif __GLASGOW_HASKELL__ >= 702+    deriving (Generic) #endif  -- | Transform the computation inside a @ReaderT@.

@@ -1,5 +1,5 @@ {-# LANGUAGE CPP #-}-#if __GLASGOW_HASKELL__ >= 608+#if __GLASGOW_HASKELL__ >= 800 {-# LANGUAGE DeriveDataTypeable #-} #endif #if __GLASGOW_HASKELL__ >= 702@@ -51,7 +51,7 @@ import Data.Bitraversable (Bitraversable(..)) #endif import Prelude hiding (null, length)-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 800 import Data.Data #endif #if __GLASGOW_HASKELL__ >= 702@@ -61,11 +61,13 @@ -- | Constant functor. newtype Constant a b = Constant { getConstant :: a }     deriving (Eq, Ord-#if __GLASGOW_HASKELL__ >= 608+#if __GLASGOW_HASKELL__ >= 800         , Data #endif-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 710         , Generic, Generic1+#elif __GLASGOW_HASKELL__ >= 702+        , Generic #endif         ) 

@@ -51,8 +51,10 @@ -- | The same functor, but with 'Foldable' and 'Traversable' instances -- that process the elements in the reverse order. newtype Reverse f a = Reverse { getReverse :: f a }-#if __GLASGOW_HASKELL__ >= 702+#if __GLASGOW_HASKELL__ >= 710     deriving (Generic, Generic1)+#elif __GLASGOW_HASKELL__ >= 702+    deriving (Generic) #endif  instance (Eq1 f) => Eq1 (Reverse f) where

@@ -1,5 +1,8 @@ -*-change-log-*- +0.6.0.1 Ross Paterson <R.Paterson@city.ac.uk> Jul 2021+	* Backward compatability fixes+ 0.6.0.0 Ross Paterson <R.Paterson@city.ac.uk> Jul 2021 	* Added quantified constraint to MonadTrans (for GHC >= 8.6) 	* Added Generic and Data instances

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