Control.Monad.State.Layered

Documentation

type M = Monad

type State s = StateT s Identity

newtype StateT s m a

Constructors

StateT (StateT s m a)

Instances

(Setter k l m, TransStateData k l (StateT s) m) => Setter__ k False l (StateT s m)

Methods

put__ :: InferStateData False (StateT s m) m -> m ()

(M m, (~) Type (InferStateData k l (StateT s m)) s) => Setter__ k True l (StateT s m)

Methods

put__ :: InferStateData True (StateT s m) m -> m ()

(Getter k l m, TransStateData k l (StateT s) m) => Getter__ k False l (StateT s m)

Methods

get__ :: m (InferStateData False (StateT s m) m)

(M m, (~) Type (InferStateData k l (StateT s m)) s) => Getter__ k True l (StateT s m)

Methods

get__ :: m (InferStateData True (StateT s m) m)

Setter Type l m => Setter Type l (StateT s m)

Methods

put :: InferStateData l (StateT s m) m -> m ()

M m => Setter Type l (StateT l m)

Methods

put :: InferStateData l (StateT l m) m -> m ()

(M m, Setter__ k ok l (StateT s m), (~) Bool ok (MatchedBases k * l s)) => Setter k l (StateT s m)

Methods

put :: InferStateData l (StateT s m) m -> m ()

Getter Type l m => Getter Type l (StateT s m)

Methods

get :: m (InferStateData l (StateT s m) m)

M m => Getter Type l (StateT l m)

Methods

get :: m (InferStateData l (StateT l m) m)

(M m, Getter__ k ok l (StateT s m), (~) Bool ok (MatchedBases k * l s)) => Getter k l (StateT s m)

Methods

get :: m (InferStateData l (StateT s m) m)

MonadTrans (StateT s)

Methods

lift :: Monad m => m a -> StateT s m a

Monad m => Monad (StateT s m)

Methods

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

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

return :: a -> StateT s m a

fail :: String -> StateT s m a

Functor m => Functor (StateT s m)

Methods

fmap :: (a -> b) -> StateT s m a -> StateT s m b

(<$) :: a -> StateT s m b -> StateT s m a

MonadFix m => MonadFix (StateT s m)

Methods

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

MonadFail m => MonadFail (StateT s m)

Methods

fail :: String -> StateT s m a

Monad m => Applicative (StateT s m)

Methods

pure :: a -> StateT s m a

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

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

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

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

MonadPlus m => Alternative (StateT s m)

Methods

empty :: StateT s m a

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

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

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

MonadPlus m => MonadPlus (StateT s m)

Methods

mzero :: StateT s m a

mplus :: StateT s m a -> StateT s m a -> StateT s m a

MonadIO m => MonadIO (StateT s m)

Methods

liftIO :: IO a -> StateT s m a

MonadThrow m => MonadThrow (StateT s m)

Methods

throwM :: Exception e => e -> StateT s m a

MonadBranch m => MonadBranch (StateT s m)

Methods

branched :: StateT s m a -> StateT s m a

PrimMonad m => PrimMonad (StateT s m)

Associated Types

type PrimState (StateT s m :: * -> *) :: *

Methods

primitive :: (State# (PrimState (StateT s m)) -> (#TupleRep [RuntimeRep], LiftedRep, State# (PrimState (StateT s m)), a#)) -> StateT s m a

Wrapped (StateT s m a)

Associated Types

type Unwrapped (StateT s m a) :: *

Methods

_Wrapped' :: Iso' (StateT s m a) (Unwrapped (StateT s m a))

(~) * (StateT s1 m1 a1) t => Rewrapped (StateT s2 m2 a2) t

type PrimState (StateT s m)

type PrimState (StateT s m) = PrimState m

type Unwrapped (StateT s m a)

type Unwrapped (StateT s m a) = StateT s m a

type States ss = StatesT ss Identity

type family StatesT ss m where ...

Equations

StatesT '[] m = m

StatesT (s ': ss) m = StateT s (StatesT ss m)

type InferStateData (l :: k) m = InferStateData' k l m

type family InferStateData' k (l :: k) m where ...

Equations

InferStateData' Type l m = l

InferStateData' k l m = StateData l m

type TransStateData l t m = InferStateData l (t m) ~ InferStateData l m

type family StateData l m where ...

Equations

StateData l (StateT s m) = If (MatchedBases l s) s (StateData l m)

StateData l (t m) = StateData l m

type family MatchedBases (a :: ka) (b :: kb) :: Bool where ...

Equations

MatchedBases (a :: k) (b :: k) = a == b

MatchedBases (a :: k) (b t :: l) = MatchedBases a b

MatchedBases (a :: k) (b :: l) = False

type Monad l m = (Getter l m, Setter l m)

class M m => Getter l m where

Minimal complete definition

get

Methods

get :: m (InferStateData l m)

Instances

(M (t m), MonadTrans t, Getter k l m, TransStateData k l t m) => Getter k l (t m)

Methods

get :: m (InferStateData l (t m) m)

Getter Type l m => Getter Type l (StateT s m)

Methods

get :: m (InferStateData l (StateT s m) m)

M m => Getter Type l (StateT l m)

Methods

get :: m (InferStateData l (StateT l m) m)

(M m, Getter__ k ok l (StateT s m), (~) Bool ok (MatchedBases k * l s)) => Getter k l (StateT s m)

Methods

get :: m (InferStateData l (StateT s m) m)

class M m => Setter l m where

Minimal complete definition

put

Methods

put :: InferStateData l m -> m ()

Instances

(M (t m), MonadTrans t, Setter k l m, TransStateData k l t m) => Setter k l (t m)

Methods

put :: InferStateData l (t m) m -> m ()

Setter Type l m => Setter Type l (StateT s m)

Methods

put :: InferStateData l (StateT s m) m -> m ()

M m => Setter Type l (StateT l m)

Methods

put :: InferStateData l (StateT l m) m -> m ()

(M m, Setter__ k ok l (StateT s m), (~) Bool ok (MatchedBases k * l s)) => Setter k l (StateT s m)

Methods

put :: InferStateData l (StateT s m) m -> m ()

class M m => Getter__ (ok :: Bool) l m where

Minimal complete definition

get__

Methods

get__ :: m (InferStateData l m)

Instances

(Getter k l m, TransStateData k l (StateT s) m) => Getter__ k False l (StateT s m)

Methods

get__ :: m (InferStateData False (StateT s m) m)

(M m, (~) Type (InferStateData k l (StateT s m)) s) => Getter__ k True l (StateT s m)

Methods

get__ :: m (InferStateData True (StateT s m) m)

class M m => Setter__ (ok :: Bool) l m where

Minimal complete definition

put__

Methods

put__ :: InferStateData l m -> m ()

Instances

(Setter k l m, TransStateData k l (StateT s) m) => Setter__ k False l (StateT s m)

Methods

put__ :: InferStateData False (StateT s m) m -> m ()

(M m, (~) Type (InferStateData k l (StateT s m)) s) => Setter__ k True l (StateT s m)

Methods

put__ :: InferStateData True (StateT s m) m -> m ()

type MonadStates ss m = (Getters ss m, Setters ss m)

type Getters ss m = Monads__ Getter ss m

type Setters ss m = Monads__ Setter ss m

type family Monads__ p ss m :: Constraint where ...

Equations

Monads__ p (s ': ss) m = (p s m, Monads__ p ss m)

Monads__ p '[] m = ()

gets :: forall l m s a. (Getter l m, s ~ InferStateData l m) => Lens' s a -> m a

type family TopStateData m where ...

Equations

TopStateData (StateT s m) = s

TopStateData (t m) = TopStateData m

type Monad' m = (Getter' m, Setter' m)

type Getter' m = Getter (TopStateData m) m

type Setter' m = Setter (TopStateData m) m

get' :: forall m. Getter' m => m (TopStateData m)

put' :: forall m. Setter' m => TopStateData m -> m ()

gets' :: forall m s a. (Getter' m, s ~ TopStateData m) => Lens' s a -> m a

stateT :: (s -> m (a, s)) -> StateT s m a

runT :: forall s m a. StateT s m a -> s -> m (a, s)

evalT :: forall s m a. Monad m => StateT s m a -> s -> m a

execT :: forall s m a. Monad m => StateT s m a -> s -> m s

runDefT :: forall s m a. Default s => StateT s m a -> m (a, s)

evalDefT :: forall s m a. (Monad m, Default s) => StateT s m a -> m a

execDefT :: forall s m a. (Monad m, Default s) => StateT s m a -> m s

run :: forall s a. State s a -> s -> (a, s)

eval :: forall s a. State s a -> s -> a

exec :: forall s a. State s a -> s -> s

runDef :: forall s a. Default s => State s a -> (a, s)

evalDef :: forall s a. Default s => State s a -> a

execDef :: forall s a. Default s => State s a -> s

type InferMonadState s l m = (Monad l m, s ~ InferStateData l m)

modifyM :: forall l s m a. InferMonadState s l m => (s -> m (a, s)) -> m a

modifyM_ :: forall l s m a. InferMonadState s l m => (s -> m s) -> m ()

modify :: forall l s m a. InferMonadState s l m => (s -> (a, s)) -> m a

modify_ :: forall l s m a. InferMonadState s l m => (s -> s) -> m ()

sub :: forall l s m a. InferMonadState s l m => m a -> m a

with :: forall l s m a. InferMonadState s l m => s -> m a -> m a

withModified :: forall l s m a. InferMonadState s l m => (s -> s) -> m a -> m a

withModifiedM :: forall l s m a. InferMonadState s l m => (s -> m s) -> m a -> m a

type TopMonadState s m = (Monad' m, s ~ TopStateData m)

modifyM' :: forall s m a. TopMonadState s m => (s -> m (a, s)) -> m a

modifyM'_ :: forall s m a. TopMonadState s m => (s -> m s) -> m ()

modify' :: forall s m a. TopMonadState s m => (s -> (a, s)) -> m a

modify'_ :: forall s m a. TopMonadState s m => (s -> s) -> m ()

sub' :: forall s m a. TopMonadState s m => m a -> m a

with' :: forall s m a. TopMonadState s m => s -> m a -> m a

withModified' :: forall s m a. TopMonadState s m => (s -> s) -> m a -> m a

withModifiedM' :: forall s m a. TopMonadState s m => (s -> m s) -> m a -> m a

mapT :: (m (a, s) -> n (b, s)) -> StateT s m a -> StateT s n b