| definition: |
flow :: (Node,Node) -> Grappa String ()
flow (n1,n2) = flElem (n1,n2)
flow (n1,n2) = flElem (n1,n) *>
flow (n,n2)
where n free
|
| demand: |
argument 1 |
| deterministic: |
possibly non-deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({(,)}) |-> {<*>,edge}}
|
| name: |
flow |
| precedence: |
no precedence defined |
| result-values: |
{<*>,edge}
|
| signature: |
(Prelude.Int, Prelude.Int) -> [(String, [Prelude.Int])] -> ((), [(String, [Prelude.Int])]) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |