|
definition: |
constructDGGraph' :: [(NodeID, [NodeID])] -> M.Map NodeID Int -> Graph
-> NodeID -> DGGraph
constructDGGraph' _ _ [] _ = []
constructDGGraph' predMap depthMap (node:nodes) root =
(newDGNode node) : (constructDGGraph' predMap newDepthMap nodes root)
where
newDepthMap = getNodeDepth predMap depthMap [] root (getNodeId node)
depth = fromMaybe (error "Error in getNodeDepth") $
M.lookup (getNodeId node) newDepthMap
newDGNode (Node ntype nid label chld ac res) =
DGNode ntype nid label chld "black" (calcFillColor ac res) depth
|
|
demand: |
argument 3 |
|
deterministic: |
deterministic operation |
|
failfree: |
<FAILING> |
|
indeterministic: |
referentially transparent operation |
|
infix: |
no fixity defined |
|
iotype: |
{(_,_,{[]},_) |-> {[]} || (_,_,{:},_) |-> {:}}
|
|
name: |
constructDGGraph' |
|
precedence: |
no precedence defined |
|
result-values: |
{:,[]}
|
|
signature: |
[(Prelude.Int, [Prelude.Int])] -> Data.Map.Map Prelude.Int Prelude.Int -> [Node] -> Prelude.Int -> [DGNode] |
|
solution-complete: |
operation might suspend on free variables |
|
terminating: |
possibly non-terminating |
|
totally-defined: |
possibly non-reducible on same data term |