Control.Monad.Transformerless.State

newtype State s a

Constructors

• State (s -> Tuple a s)

Instances

• Newtype (State s a) _
• Semigroupoid State

  This satisfies associativity and get <<< x = x <<< get, but neither is the same as x. This is because composition of two States uses neither in the computation of the final state.

• Functor (State s)
• Apply (State s)
• Applicative (State s)
• Alt (State s)
• Bind (State s)
• Monad (State s)
• Lazy (State s a)
• MonadRec (State s)

runState :: forall a s. State s a -> s -> Tuple a s

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

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

mapState :: forall b a s. (Tuple a s -> Tuple b s) -> State s a -> State s b

mapS :: forall b a s. (a -> b) -> State s a -> State s b

Operator alias for Control.Monad.Transformerless.State.mapS (left-associative / precedence 4)

applyS :: forall b a s. State s (a -> b) -> State s a -> State s b

Operator alias for Control.Monad.Transformerless.State.applyS (left-associative / precedence 4)

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

bindS :: forall b a s. State s a -> (a -> State s b) -> State s b

Operator alias for Control.Monad.Transformerless.State.bindS (left-associative / precedence 1)

deferS :: forall a s. (Unit -> State s a) -> State s a

tailRecS :: forall b a s. (a -> State s (Step a b)) -> a -> State s b

get :: forall s. State s s

gets :: forall a s. (s -> a) -> State s a

put :: forall s. s -> State s Unit

modify :: forall s. (s -> s) -> State s Unit