|
definition:
|
replaceChoiceIDs :: [(NodeID,Node)] -> FingerPrint -> [(NodeID,Int)]
replaceChoiceIDs _ [] = []
replaceChoiceIDs nodes ((cn,cm):ms) =
map (\x -> (x,cm))
(filter ((flip (choiceReachableFrom nodes ((cn,cm):ms) [])) 1)
(lookupChoiceNodeIds nodes cn)) ++
(replaceChoiceIDs nodes ms)
|
|
demand:
|
argument 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- replace the ChoiceIDs in a given fingeprint with actual NodeIDs from a given graph
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{(_,{[]}) |-> {[]} || (_,{:}) |-> _}
|
|
name:
|
replaceChoiceIDs
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
[(Prelude.Int, ICurry.Graph.Node)] -> [(Prelude.Int, Prelude.Int)]
-> [(Prelude.Int, Prelude.Int)]
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|