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

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