| definition: |
updateNode :: Graph -> NodeID -> Node -> Graph
updateNode (Graph nodes mx root) nid newnode = Graph (map update nodes) mx root
where
update (ni, n) | ni == nid = (ni, newnode)
| otherwise = (ni, n)
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
-- Updates a node in a graph with new node information. |
| failfree: |
(_, _, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Graph},_,_) |-> {Graph}}
|
| name: |
updateNode |
| precedence: |
no precedence defined |
| result-values: |
{Graph}
|
| signature: |
Graph -> Prelude.Int -> Node -> Graph |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
possibly non-reducible on same data term |