Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- module Control.Monad.Trans.Accum
- accumS :: (Functor m, Monad m) => Automaton m (w, a) (w, b) -> Automaton (AccumT w m) a b
- runAccumS :: (Functor m, Monad m) => Automaton (AccumT w m) a b -> Automaton m (w, a) (w, b)
- runAccumS_ :: (Functor m, Monoid w, Monad m) => Automaton (AccumT w m) a b -> Automaton m a (w, b)
- runAccumS__ :: (Functor m, Monoid w, Monad m) => Automaton (AccumT w m) a b -> Automaton m a b
Documentation
module Control.Monad.Trans.Accum
runAccumS :: (Functor m, Monad m) => Automaton (AccumT w m) a b -> Automaton m (w, a) (w, b) Source #
:: (Functor m, Monoid w, Monad m) | |
=> Automaton (AccumT w m) a b | An automaton with a global accumulation state effect |
-> Automaton m a (w, b) |
Convert global accumulation state to internal state of an Automaton
.
The current state is output on every step.
runAccumS__ :: (Functor m, Monoid w, Monad m) => Automaton (AccumT w m) a b -> Automaton m a b Source #
Like runAccumS_
, but don't output the current accum.