CurryInfo: icurry-3.3.0 / TermGraph.SVG.getNodeDepth
demand: 
|
argument 2 |
|
deterministic:
|
deterministic operation |
|
failfree:
|
<FAILING> |
|
indeterministic:
|
referentially transparent operation |
|
infix:
|
no fixity defined |
|
iotype:
|
{(_,_,_,_,_) |-> _}
|
|
name:
|
getNodeDepth |
|
precedence:
|
no precedence defined |
|
result-values:
|
_ |
|
signature:
|
[(Prelude.Int, [Prelude.Int])] -> Data.Map.Map Prelude.Int Prelude.Int -> [Prelude.Int] -> Prelude.Int -> Prelude.Int -> Data.Map.Map Prelude.Int Prelude.Int |
|
solution-complete:
|
operation might suspend on free variables |
|
terminating:
|
possibly non-terminating |
|
totally-defined:
|
possibly non-reducible on same data term |