Control.Monad.Indexed.Trans.State

The indexed state transformer: each StateT _ i j term takes an input of type i and gives an output of type j.

Documentation

newtype StateT f i j a

Constructors

StateT

Fields

• runStateT :: i -> f (a, j)

Instances

Monad m => Bind (StateT m :: Type -> Type -> Type -> Type)

Defined in Control.Monad.Indexed.Trans.State

Methods

join :: forall (i :: k) (j :: k) (k :: k) a. StateT m i j (StateT m j k a) -> StateT m i k a

(>>=) :: forall (i :: k) (j :: k) a (k :: k) b. StateT m i j a -> (a -> StateT m j k b) -> StateT m i k b

Monad m => Apply (StateT m :: Type -> Type -> Type -> Type)

Defined in Control.Monad.Indexed.Trans.State

Methods

(<*>) :: forall (i :: k) (j :: k) a b (k :: k). StateT m i j (a -> b) -> StateT m j k a -> StateT m i k b

(*>) :: forall (i :: k) (j :: k) a (k :: k) b. StateT m i j a -> StateT m j k b -> StateT m i k b

(<*) :: forall (i :: k) (j :: k) a (k :: k) b. StateT m i j a -> StateT m j k b -> StateT m i k a

liftA2 :: forall a b c (i :: k) (j :: k) (k :: k). (a -> b -> c) -> StateT m i j a -> StateT m j k b -> StateT m i k c

Monad m => Monad (StateT m k k)

Defined in Control.Monad.Indexed.Trans.State

Methods

(>>=) :: StateT m k k a -> (a -> StateT m k k b) -> StateT m k k b

(>>) :: StateT m k k a -> StateT m k k b -> StateT m k k b

return :: a -> StateT m k k a

Functor f => Functor (StateT f i j)

Defined in Control.Monad.Indexed.Trans.State

Methods

fmap :: (a -> b) -> StateT f i j a -> StateT f i j b

(<$) :: a -> StateT f i j b -> StateT f i j a

MonadFix m => MonadFix (StateT m k k)

Defined in Control.Monad.Indexed.Trans.State

Methods

mfix :: (a -> StateT m k k a) -> StateT m k k a

Monad m => Applicative (StateT m k k)

Defined in Control.Monad.Indexed.Trans.State

Methods

pure :: a -> StateT m k k a

(<*>) :: StateT m k k (a -> b) -> StateT m k k a -> StateT m k k b

liftA2 :: (a -> b -> c) -> StateT m k k a -> StateT m k k b -> StateT m k k c

(*>) :: StateT m k k a -> StateT m k k b -> StateT m k k b

(<*) :: StateT m k k a -> StateT m k k b -> StateT m k k a

MonadPlus m => Alternative (StateT m k k)

Defined in Control.Monad.Indexed.Trans.State

Methods

empty :: StateT m k k a

(<|>) :: StateT m k k a -> StateT m k k a -> StateT m k k a

some :: StateT m k k a -> StateT m k k [a]

many :: StateT m k k a -> StateT m k k [a]

MonadPlus m => MonadPlus (StateT m k k)

Defined in Control.Monad.Indexed.Trans.State

Methods

mzero :: StateT m k k a

mplus :: StateT m k k a -> StateT m k k a -> StateT m k k a

lift :: Functor f => f a -> StateT f k k a

mapStateT :: (f (a, j) -> g (b, k)) -> StateT f i j a -> StateT g i k b

modify :: Applicative p => (i -> j) -> StateT p i j i

modifyF :: Functor f => (i -> f j) -> StateT f i j i

get :: Applicative p => StateT p k k k

put :: Applicative p => j -> StateT p i j ()

liftCallCC :: CallCC f g h (a, i) (b, j) (c, k) (d, l) -> CallCC (StateT f e j) (StateT g i k) (StateT h i l) a b c d

liftCatch :: Catch e f g h (a, i) (b, j) (c, k) -> Catch e (StateT f l i) (StateT g l j) (StateT h l k) a b c

liftListen :: Functor f => Listen w f (a, j) b -> Listen w (StateT f i j) a (i -> b)

liftPass :: Functor f => Pass z f g (a, k) (b, j) -> Pass z (StateT f i k) (StateT g i j) a b