Safe Haskell	None
Language	Haskell2010

Agda.Utils.StrictState

Description

This is a plain strict state monad, where state update, monadic binding and return are all strict. If you only need a single strict state effect, use this module.

Do not use Control.Monad.State.Strict for the same purpose; it's not even strict in state updates and is much less amenable to GHC optimizations than this module.

Documentation

newtype State s a Source #

Constructors

State
Fields runState# :: s -> (# a, s #)

Instances

Instances details

Applicative (State s) Source #
Instance details Defined in Agda.Utils.StrictState Methods pure :: a -> State s a # (<>) :: State s (a -> b) -> State s a -> State s b # liftA2 :: (a -> b -> c) -> State s a -> State s b -> State s c # (>) :: State s a -> State s b -> State s b # (<*) :: State s a -> State s b -> State s a #
Functor (State s) Source #
Instance details Defined in Agda.Utils.StrictState Methods fmap :: (a -> b) -> State s a -> State s b # (<$) :: a -> State s b -> State s a #
Monad (State s) Source #
Instance details Defined in Agda.Utils.StrictState Methods (>>=) :: State s a -> (a -> State s b) -> State s b # (>>) :: State s a -> State s b -> State s b # return :: a -> State s a #

put :: s -> State s () Source #

get :: State s s Source #

gets :: (s -> a) -> State s a Source #

modify :: (s -> s) -> State s () Source #

execState :: State s a -> s -> s Source #

runState :: State s a -> s -> (a, s) Source #

evalState :: State s a -> s -> a Source #