| definition: |
dotifyNarrowingTree :: (f -> String) -> NarrowingTree f -> String
dotifyNarrowingTree s ng
= "digraph NarrowingTree {\n\t"
++ "node [fontname=Helvetica,fontsize=10,shape=box];\n"
++ (unlines (map showNode ns))
++ "\tedge [fontname=Helvetica,fontsize=10];\n"
++ (unlines (map showEdge es)) ++ "}"
where
(ns, es) = toGraph ng
showNode (n, t) = "\t" ++ (showVarIdx n) ++ " [label=\"" ++ (showTerm s t)
++ "\"];"
showEdge ((n1, t), sub, (n2, _))
= "\t" ++ (showVarIdx n1) ++ " -> " ++ (showVarIdx n2) ++ " [label=\""
++ (showSubst s (restrictSubst sub (tVars t))) ++ "\"];"
|
| demand: |
no demanded arguments |
| deterministic: |
deterministic operation |
| documentation: |
--- Transforms a narrowing tree into a graphical representation by using the --- *DOT graph description language*. |
| failfree: |
<FAILING> |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{(_,_) |-> _}
|
| name: |
dotifyNarrowingTree |
| precedence: |
no precedence defined |
| result-values: |
_ |
| signature: |
(a -> String) -> NarrowingTree a -> String |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |