CurryInfo: transformers-3.0.0 / Control.Monad.Trans.State.put

definition:
put :: Monad m => s -> StateT s m ()
put s = StateT $ \_ -> return ((), s)
demand:
no demanded arguments
deterministic:
deterministic operation
failfree:
(_, _)
indeterministic:
referentially transparent operation
infix:
no fixity defined
iotype:
{(_,_) |-> _}
name:
put
precedence:
no precedence defined
result-values:
_
signature:
Prelude.Monad b => a -> StateT a b ()
solution-complete:
operation might suspend on free variables
terminating:
yes
totally-defined:
reducible on all ground data terms