| definition: |
findDGNode :: DGGraph -> NodeID -> DGNode
findDGNode graph nid =
let mnode = find ((== nid) . nodeIDDG) graph
in case mnode of
Nothing -> error ("Invalid NodeID in DG-graph: " ++ show nid ++
"\n" ++ show graph)
Just node -> node
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
findDGNode |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
[DGNode] -> Prelude.Int -> DGNode |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |