| definition: |
viewDependencyGraph :: [(String,[(String,String)],[String])] -> IO ()
viewDependencyGraph deps = viewDotGraph $ dgraph "dependencies" nodes edges
where
nodes = map (\ (n,a,_) -> Node n a) deps ++
map (\ n -> Node n [])
(concatMap (\ (_,_,ts) -> ts) deps \\ map (\ (n,_,_) -> n) deps)
edges = map (\ (s,t) -> Edge s t [])
(nub (concatMap (\ (p,_,ds) -> map (\d -> (p,d)) ds) deps))
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_) |-> _}
|
| name: |
viewDependencyGraph |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
[(String, [(String, String)], [String])] -> Prelude.IO () |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |