    {-# LANGUAGE CPP #-}
    #if __GLASGOW_HASKELL__ >= 709
    {-# LANGUAGE AutoDeriveTypeable #-}
    #endif
    -----------------------------------------------------------------------------
    -- |
    -- Module      :  Control.Monad.Trans.Identity
    -- Copyright   :  (c) 2007 Magnus Therning
    -- License     :  BSD-style (see the file LICENSE)
    --
    -- Maintainer  :  ross@soi.city.ac.uk
    -- Stability   :  experimental
    -- Portability :  portable
    --
    -- The identity monad transformer.
    --
    -- This is useful for functions parameterized by a monad transformer.
    -----------------------------------------------------------------------------

    module Control.Monad.Trans.Identity (
        -- * The identity monad transformer
        IdentityT(..),
        mapIdentityT,
        -- * Lifting other operations
        liftCatch,
        liftCallCC,
      ) where

    import Control.Monad.IO.Class (MonadIO(liftIO))
    import Control.Monad.Signatures
    import Control.Monad.Trans.Class (MonadTrans(lift))
    import Data.Functor.Classes

    import Control.Applicative
    import Control.Monad (MonadPlus(mzero, mplus))
    import Control.Monad.Fix (MonadFix(mfix))
    import Data.Foldable (Foldable(foldMap))
    import Data.Traversable (Traversable(traverse))

    -- | The trivial monad transformer, which maps a monad to an equivalent monad.
    newtype IdentityT f a = IdentityT { runIdentityT :: f a }

    instance (Eq1 f, Eq a) => Eq (IdentityT f a) where
        IdentityT x == IdentityT y = eq1 x y

    instance (Ord1 f, Ord a) => Ord (IdentityT f a) where
        compare (IdentityT x) (IdentityT y) = compare1 x y

    instance (Read1 f, Read a) => Read (IdentityT f a) where
        readsPrec = readsData $ readsUnary1 "IdentityT" IdentityT

    instance (Show1 f, Show a) => Show (IdentityT f a) where
        showsPrec d (IdentityT m) = showsUnary1 "IdentityT" d m

    instance (Eq1 f) => Eq1 (IdentityT f) where eq1 = (==)
    instance (Ord1 f) => Ord1 (IdentityT f) where compare1 = compare
    instance (Read1 f) => Read1 (IdentityT f) where readsPrec1 = readsPrec
    instance (Show1 f) => Show1 (IdentityT f) where showsPrec1 = showsPrec

    instance (Functor m) => Functor (IdentityT m) where
        fmap f = mapIdentityT (fmap f)

    instance (Foldable f) => Foldable (IdentityT f) where
        foldMap f (IdentityT a) = foldMap f a

    instance (Traversable f) => Traversable (IdentityT f) where
        traverse f (IdentityT a) = IdentityT <$> traverse f a

    instance (Applicative m) => Applicative (IdentityT m) where
        pure x = IdentityT (pure x)
        (<*>) = lift2IdentityT (<*>)

    instance (Alternative m) => Alternative (IdentityT m) where
        empty = IdentityT empty
        (<|>) = lift2IdentityT (<|>)

    instance (Monad m) => Monad (IdentityT m) where
        return = IdentityT . return
        m >>= k = IdentityT $ runIdentityT . k =<< runIdentityT m
        fail msg = IdentityT $ fail msg

    instance (MonadPlus m) => MonadPlus (IdentityT m) where
        mzero = IdentityT mzero
        mplus = lift2IdentityT mplus

    instance (MonadFix m) => MonadFix (IdentityT m) where
        mfix f = IdentityT (mfix (runIdentityT . f))

    instance (MonadIO m) => MonadIO (IdentityT m) where
        liftIO = IdentityT . liftIO

    instance MonadTrans IdentityT where
        lift = IdentityT

    -- | Lift a unary operation to the new monad.
    mapIdentityT :: (m a -> n b) -> IdentityT m a -> IdentityT n b
    mapIdentityT f = IdentityT . f . runIdentityT

    -- | Lift a binary operation to the new monad.
    lift2IdentityT ::
        (m a -> n b -> p c) -> IdentityT m a -> IdentityT n b -> IdentityT p c
    lift2IdentityT f a b = IdentityT (f (runIdentityT a) (runIdentityT b))

    -- | Lift a @callCC@ operation to the new monad.
    liftCallCC :: CallCC m a b -> CallCC (IdentityT m) a b
    liftCallCC callCC f =
        IdentityT $ callCC $ \ c -> runIdentityT (f (IdentityT . c))

    -- | Lift a @catchE@ operation to the new monad.
    liftCatch :: Catch e m a -> Catch e (IdentityT m) a
    liftCatch f m h = IdentityT $ f (runIdentityT m) (runIdentityT . h)