CurryInfo: base-3.4.0 / Control.Search.SetFunctions.foldValues
definition: 
|
foldValues :: (a -> a -> a) -> a -> Values a -> a foldValues f z s = foldr f z (valuesOf s) |
|
demand:
|
argument 3 |
|
deterministic:
|
deterministic operation |
|
documentation:
|
Accumulates all elements of a multiset of values by applying a binary operation. This is similarly to fold on lists, but the binary operation must be **commutative** so that the result is independent of the order of applying this operation to all elements in the multiset. |
|
failfree:
|
(_, _, _) |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_) |-> _}
|
|
name:
|
foldValues |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
(a -> a -> a) -> a -> Values a -> a |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
yes |
|
totally-defined:
|
reducible on all ground data terms |