CurryInfo: traversal-3.0.0 / Data.Traversal.evalFamilyM
definition: 
|
evalFamilyM :: Monad m => Traversable a a -> (a -> m (Maybe a)) -> a -> m a evalFamilyM tr f = mapFamilyM tr g where g a = f a >>= maybe (return a) (mapFamilyM tr g) |
|
demand:
|
no demanded arguments |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Monadic version of evalFamily |
|
failfree:
|
(_, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_) |-> {mapFamilyM}}
|
|
name:
|
evalFamilyM |
|
precedence:
|
no precedence defined |
|
result-values:
|
{mapFamilyM}
|
|
signature:
|
Prelude.Monad b => (a -> ([a], [a] -> a)) -> (a -> b (Prelude.Maybe a)) -> a -> b a |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
reducible on all ground data terms |