|
definition:
|
evalFamily :: Traversable a a -> (a -> Maybe a) -> a -> a
evalFamily tr f = mapFamily tr g
where g x = maybe x (mapFamily tr g) (f x)
|
|
demand:
|
no demanded arguments
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
--- Applies the given function to each member of the family of a value
--- as long as possible. On each member of the family of the result the given
--- function will yield `Nothing`.
--- Proceeds bottom-up.
---
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_) |-> {.._#lambda508}}
|
|
name:
|
evalFamily
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{.._#lambda508}
|
|
signature:
|
(a -> ([a], [a] -> a)) -> (a -> Prelude.Maybe a) -> a -> a
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
reducible on all ground data terms
|