CurryInfo: icurry-3.2.0 / TermGraph.SVG.constructDGGraph'

definition: Info
 
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: Info
 argument 3
deterministic: Info
 deterministic operation
failfree: Info
 <FAILING>
indeterministic: Info
 referentially transparent operation
infix: Info
 no fixity defined
iotype: Info
 {(_,_,{[]},_) |-> {[]} || (_,_,{:},_) |-> {:}}
name: Info
 constructDGGraph'
precedence: Info
 no precedence defined
result-values: Info
 {:,[]}
signature: Info
 [(Prelude.Int, [Prelude.Int])] -> Data.Map.Map Prelude.Int Prelude.Int -> [Node]
-> Prelude.Int -> [DGNode]
solution-complete: Info
 operation might suspend on free variables
terminating: Info
 possibly non-terminating
totally-defined: Info
 possibly non-reducible on same data term