|
definition:
|
replaceNodeArg :: Graph -> NodeID -> Int -> NodeID -> Graph
replaceNodeArg g nid i narg = case lookupNode nid g of
ConsNode c ns -> updateNode g nid (ConsNode c (replace narg i ns))
FuncNode f ns -> updateNode g nid (FuncNode f (replace narg i ns))
PartNode f m ns -> updateNode g nid (PartNode f m (replace narg i ns))
ChoiceNode _ _ _ -> error "replaceNodeArg: ChoiceNode"
FreeNode -> error "replaceNodeArg: FreeNode"
|
|
demand:
|
argument 1
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- Replaces the i-th successor of node `nid` by node `narg`.
|
|
failfree:
|
(_, _, _, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,_,_,_) |-> {Graph}}
|
|
name:
|
replaceNodeArg
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
{Graph}
|
|
signature:
|
ICurry.Graph.Graph -> Prelude.Int -> Prelude.Int -> Prelude.Int
-> ICurry.Graph.Graph
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|