CurryInfo: icurry-3.2.0 / ICurry.Interpreter.replaceNodeArg

 
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"

 argument 1

 deterministic operation

 
Replaces the i-th successor of node `nid` by node `narg`.

 (_, _, _, _)

 referentially transparent operation

 no fixity defined

 {(_,_,_,_) |-> {Graph}}

 replaceNodeArg

 no precedence defined

 {Graph}

 ICurry.Graph.Graph -> Prelude.Int -> Prelude.Int -> Prelude.Int
-> ICurry.Graph.Graph

 operation might suspend on free variables

 possibly non-terminating

 possibly non-reducible on same data term