| definition: |
dotifyDefTree :: (f -> String) -> DefTree f -> String
dotifyDefTree s dt = "digraph definitional_tree {\n"
++ " graph [margin=0.0];\n"
++ " node [fontname=\"Menlo\",fontsize=10.0,shape=box];\n"
++ unlines (map showNode ns)
++ " edge [fontname=\"Menlo\",fontsize=7.0,arrowhead=none];\n"
++ unlines (map showEdge es)
++ "}"
where
(ns, es) = toGraph dt
showNode (n, p, t) =
" " ++ showVarIdx n ++ " [label=<" ++ showTermWithPos s (p, t) ++ ">];"
showEdge (b, (n1, _, _), (n2, _, _)) =
let opts = if b then " [arrowhead=normal];" else ";"
in " " ++ showVarIdx n1 ++ " -> " ++ showVarIdx n2 ++ opts
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Transforms a definitional tree into a graphical representation by using --- the *DOT graph description language*. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
dotifyDefTree |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a -> String) -> DefTree a -> String |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |