| definition: |
mapState :: ((a, s) -> (b, s)) -> State s a -> State s b mapState f = mapStateT (return . f . runIdentity) |
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
_ |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> {mapStateT}}
|
| name: |
mapState |
| precedence: |
no precedence defined |
| result-values: |
{mapStateT}
|
| signature: |
((a, b) -> (c, b)) -> StateT b Data.Functor.Identity.Identity a -> StateT b Data.Functor.Identity.Identity c |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
reducible on all ground data terms |