| definition: |
constructDGraph' :: Graph -> [(NodeID,String)] -> Int -> NodeID -> (DNode, Int)
constructDGraph' graph cmap maxDepth curr =
(newDNode currNode, if length depths == 0 then maxDepth else minimum depths)
where
currNode = findNode graph curr
(children, depths) = if maxDepth <= (-1) -- render one more level which isn't fully rendered
then ([], []) -- this can show that the tree would not end there
else unzip $ map (constructDGraph' graph cmap (maxDepth - 1)) (getNodeChildren currNode)
nodeWidth = max 1 (sum (map width children))
newDNode (Node ntype nid label _ ac res) =
DNode ntype
nid
label
children
(((fromMaybe "black") . (lookup nid)) cmap)
(calcFillColor ac res)
nodeWidth
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_,_,_) |-> {(,)}}
|
| name: |
constructDGraph' |
| precedence: |
no precedence defined |
| result-values: |
{(,)}
|
| signature: |
[Node] -> [(Prelude.Int, String)] -> Prelude.Int -> Prelude.Int -> (DNode, Prelude.Int) |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |