| definition: |
ufold :: ((Context a b) -> c -> c) -> c -> Graph a b -> c
ufold f u g | isEmpty g = u
| otherwise = f c (ufold f u g')
where (c,g') = matchAny g
|
| demand: |
argument 3 |
| deterministic: |
deterministic operation |
| documentation: |
--- Fold a function over the graph. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_) |-> _}
|
| name: |
ufold |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(([(a, Prelude.Int)], Prelude.Int, b, [(a, Prelude.Int)]) -> c -> c) -> c -> Graph b a -> c |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |