Copyright	(C) 2008-2011 Edward Kmett
License	BSD-style (see the file LICENSE)
Maintainer	Edward Kmett <ekmett@gmail.com>
Stability	provisional
Portability	portable
Safe Haskell	Safe
Language	Haskell2010

Control.Comonad.Trans.Identity

Description

Synopsis

newtype IdentityT (f :: k -> Type) (a :: k) = IdentityT {
- runIdentityT :: f a
}

Documentation

newtype IdentityT (f :: k -> Type) (a :: k) #

The trivial monad transformer, which maps a monad to an equivalent monad.

Constructors

IdentityT
Fields runIdentityT :: f a

Instances

Instances details

Generic1 (IdentityT f :: k -> Type)

Instance details

Defined in Control.Monad.Trans.Identity

Associated Types

type Rep1 (IdentityT f :: k -> Type)
Instance details Defined in Control.Monad.Trans.Identity type Rep1 (IdentityT f :: k -> Type) = D1 ('MetaData "IdentityT" "Control.Monad.Trans.Identity" "transformers-0.6.1.0-d712" 'True) (C1 ('MetaCons "IdentityT" 'PrefixI 'True) (S1 ('MetaSel ('Just "runIdentityT") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec1 f)))

Methods

from1 :: forall (a :: k). IdentityT f a -> Rep1 (IdentityT f) a #

to1 :: forall (a :: k). Rep1 (IdentityT f) a -> IdentityT f a #

ComonadEnv e w => ComonadEnv e (IdentityT w) Source #

Instance details

Defined in Control.Comonad.Env.Class

Methods

ask :: IdentityT w a -> e Source #

ComonadStore s w => ComonadStore s (IdentityT w) Source #

Instance details

Defined in Control.Comonad.Store.Class

Methods

pos :: IdentityT w a -> s Source #

peek :: s -> IdentityT w a -> a Source #

peeks :: (s -> s) -> IdentityT w a -> a Source #

seek :: s -> IdentityT w a -> IdentityT w a Source #

seeks :: (s -> s) -> IdentityT w a -> IdentityT w a Source #

experiment :: Functor f => (s -> f s) -> IdentityT w a -> f a Source #

ComonadTraced m w => ComonadTraced m (IdentityT w) Source #

Instance details

Defined in Control.Comonad.Traced.Class

Methods

trace :: m -> IdentityT w a -> a Source #

FoldableWithIndex i m => FoldableWithIndex i (IdentityT m)

Instance details

Defined in WithIndex

Methods

ifoldMap :: Monoid m0 => (i -> a -> m0) -> IdentityT m a -> m0 #

ifoldMap' :: Monoid m0 => (i -> a -> m0) -> IdentityT m a -> m0 #

ifoldr :: (i -> a -> b -> b) -> b -> IdentityT m a -> b #

ifoldl :: (i -> b -> a -> b) -> b -> IdentityT m a -> b #

ifoldr' :: (i -> a -> b -> b) -> b -> IdentityT m a -> b #

ifoldl' :: (i -> b -> a -> b) -> b -> IdentityT m a -> b #

FunctorWithIndex i m => FunctorWithIndex i (IdentityT m)

Instance details

Defined in WithIndex

Methods

imap :: (i -> a -> b) -> IdentityT m a -> IdentityT m b #

TraversableWithIndex i m => TraversableWithIndex i (IdentityT m)

Instance details

Defined in WithIndex

Methods

itraverse :: Applicative f => (i -> a -> f b) -> IdentityT m a -> f (IdentityT m b) #

ComonadHoist (IdentityT :: (Type -> Type) -> Type -> Type) Source #

Instance details

Defined in Control.Comonad.Hoist.Class

Methods

cohoist :: (Comonad w, Comonad v) => (forall x. w x -> v x) -> IdentityT w a -> IdentityT v a Source #

ComonadTrans (IdentityT :: (Type -> Type) -> Type -> Type) Source #

Instance details

Defined in Control.Comonad.Trans.Class

Methods

lower :: Comonad w => IdentityT w a -> w a Source #

MonadTrans (IdentityT :: (Type -> Type) -> Type -> Type)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

lift :: Monad m => m a -> IdentityT m a #

MonadFail m => MonadFail (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

fail :: String -> IdentityT m a #

MonadFix m => MonadFix (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

mfix :: (a -> IdentityT m a) -> IdentityT m a #

MonadIO m => MonadIO (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

liftIO :: IO a -> IdentityT m a #

MonadZip m => MonadZip (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

mzip :: IdentityT m a -> IdentityT m b -> IdentityT m (a, b) #

mzipWith :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c #

munzip :: IdentityT m (a, b) -> (IdentityT m a, IdentityT m b) #

Foldable f => Foldable (IdentityT f)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

fold :: Monoid m => IdentityT f m -> m #

foldMap :: Monoid m => (a -> m) -> IdentityT f a -> m #

foldMap' :: Monoid m => (a -> m) -> IdentityT f a -> m #

foldr :: (a -> b -> b) -> b -> IdentityT f a -> b #

foldr' :: (a -> b -> b) -> b -> IdentityT f a -> b #

foldl :: (b -> a -> b) -> b -> IdentityT f a -> b #

foldl' :: (b -> a -> b) -> b -> IdentityT f a -> b #

foldr1 :: (a -> a -> a) -> IdentityT f a -> a #

foldl1 :: (a -> a -> a) -> IdentityT f a -> a #

toList :: IdentityT f a -> [a] #

null :: IdentityT f a -> Bool #

length :: IdentityT f a -> Int #

elem :: Eq a => a -> IdentityT f a -> Bool #

maximum :: Ord a => IdentityT f a -> a #

minimum :: Ord a => IdentityT f a -> a #

sum :: Num a => IdentityT f a -> a #

product :: Num a => IdentityT f a -> a #

Foldable1 m => Foldable1 (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

fold1 :: Semigroup m0 => IdentityT m m0 -> m0 #

foldMap1 :: Semigroup m0 => (a -> m0) -> IdentityT m a -> m0 #

foldMap1' :: Semigroup m0 => (a -> m0) -> IdentityT m a -> m0 #

toNonEmpty :: IdentityT m a -> NonEmpty a #

maximum :: Ord a => IdentityT m a -> a #

minimum :: Ord a => IdentityT m a -> a #

head :: IdentityT m a -> a #

last :: IdentityT m a -> a #

foldrMap1 :: (a -> b) -> (a -> b -> b) -> IdentityT m a -> b #

foldlMap1' :: (a -> b) -> (b -> a -> b) -> IdentityT m a -> b #

foldlMap1 :: (a -> b) -> (b -> a -> b) -> IdentityT m a -> b #

foldrMap1' :: (a -> b) -> (a -> b -> b) -> IdentityT m a -> b #

Eq1 f => Eq1 (IdentityT f)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

liftEq :: (a -> b -> Bool) -> IdentityT f a -> IdentityT f b -> Bool #

Ord1 f => Ord1 (IdentityT f)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

liftCompare :: (a -> b -> Ordering) -> IdentityT f a -> IdentityT f b -> Ordering #

Read1 f => Read1 (IdentityT f)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (IdentityT f a) #

liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [IdentityT f a] #

liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (IdentityT f a) #

liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [IdentityT f a] #

Show1 f => Show1 (IdentityT f)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> IdentityT f a -> ShowS #

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [IdentityT f a] -> ShowS #

Contravariant f => Contravariant (IdentityT f)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

contramap :: (a' -> a) -> IdentityT f a -> IdentityT f a' #

(>$) :: b -> IdentityT f b -> IdentityT f a #

Traversable f => Traversable (IdentityT f)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

traverse :: Applicative f0 => (a -> f0 b) -> IdentityT f a -> f0 (IdentityT f b) #

sequenceA :: Applicative f0 => IdentityT f (f0 a) -> f0 (IdentityT f a) #

mapM :: Monad m => (a -> m b) -> IdentityT f a -> m (IdentityT f b) #

sequence :: Monad m => IdentityT f (m a) -> m (IdentityT f a) #

Alternative m => Alternative (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

empty :: IdentityT m a #

(<|>) :: IdentityT m a -> IdentityT m a -> IdentityT m a #

some :: IdentityT m a -> IdentityT m [a] #

many :: IdentityT m a -> IdentityT m [a] #

Applicative m => Applicative (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

pure :: a -> IdentityT m a #

(<*>) :: IdentityT m (a -> b) -> IdentityT m a -> IdentityT m b #

liftA2 :: (a -> b -> c) -> IdentityT m a -> IdentityT m b -> IdentityT m c #

(*>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #

(<*) :: IdentityT m a -> IdentityT m b -> IdentityT m a #

Functor m => Functor (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

fmap :: (a -> b) -> IdentityT m a -> IdentityT m b #

(<$) :: a -> IdentityT m b -> IdentityT m a #

Monad m => Monad (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

(>>=) :: IdentityT m a -> (a -> IdentityT m b) -> IdentityT m b #

(>>) :: IdentityT m a -> IdentityT m b -> IdentityT m b #

return :: a -> IdentityT m a #

MonadPlus m => MonadPlus (IdentityT m)

Instance details

Defined in Control.Monad.Trans.Identity

Methods

mzero :: IdentityT m a #

mplus :: IdentityT m a -> IdentityT m a -> IdentityT m a #

Comonad w => Comonad (IdentityT w) Source #

Instance details

Defined in Control.Comonad

Methods

extract :: IdentityT w a -> a Source #

duplicate :: IdentityT w a -> IdentityT w (IdentityT w a) Source #

extend :: (IdentityT w a -> b) -> IdentityT w a -> IdentityT w b Source #

ComonadApply w => ComonadApply (IdentityT w) Source #

Instance details

Defined in Control.Comonad

Methods

(<@>) :: IdentityT w (a -> b) -> IdentityT w a -> IdentityT w b Source #

(@>) :: IdentityT w a -> IdentityT w b -> IdentityT w b Source #

(<@) :: IdentityT w a -> IdentityT w b -> IdentityT w a Source #

Distributive g => Distributive (IdentityT g)

Instance details

Defined in Data.Distributive

Methods

distribute :: Functor f => f (IdentityT g a) -> IdentityT g (f a) #

collect :: Functor f => (a -> IdentityT g b) -> f a -> IdentityT g (f b) #

distributeM :: Monad m => m (IdentityT g a) -> IdentityT g (m a) #

collectM :: Monad m => (a -> IdentityT g b) -> m a -> IdentityT g (m b) #

Generic (IdentityT f a)

Instance details

Defined in Control.Monad.Trans.Identity

Associated Types

type Rep (IdentityT f a)
Instance details Defined in Control.Monad.Trans.Identity type Rep (IdentityT f a) = D1 ('MetaData "IdentityT" "Control.Monad.Trans.Identity" "transformers-0.6.1.0-d712" 'True) (C1 ('MetaCons "IdentityT" 'PrefixI 'True) (S1 ('MetaSel ('Just "runIdentityT") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (f a))))