| definition: |
lookupNode :: NodeID -> Graph -> Node
lookupNode ni (Graph nodes _ _) =
maybe (error $ "Node with id `" ++ show ni ++ "` not found!")
id
(lookup ni nodes)
|
| demand: |
argument 2 |
| deterministic: |
deterministic operation |
| documentation: |
-- Looks up a node in a graph (where redirections are considered). |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,{Graph}) |-> _}
|
| name: |
lookupNode |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
Prelude.Int -> Graph -> Node |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |