|
definition:
|
vertDist :: Span -> Span -> Int
vertDist NoSpan NoSpan = 0
vertDist NoSpan (Span {}) = 0
vertDist (Span {}) NoSpan = 0
vertDist (Span s1 e1) (Span s2 e2) =
case rowDist e1 s2 of
x | x >= 0 -> x
| e1 <= e2 -> 0 -- they overlap
| otherwise -> - (rowDist e2 s1)
|
|
demand:
|
arguments 1 2
|
|
deterministic:
|
deterministic operation
|
|
documentation:
|
-- | Computes a "vertical distance" between two spans.
-- It is either the row distance of the start end end positions or
-- zero, if the spans overlap.
|
|
failfree:
|
(_, _)
|
|
indeterministic:
|
referentially transparent operation
|
|
infix:
|
no fixity defined
|
|
iotype:
|
{({NoSpan},{NoSpan}) |-> {0} || ({NoSpan},{Span}) |-> {0} || ({Span},{NoSpan}) |-> {0} || ({Span},{Span}) |-> _}
|
|
name:
|
vertDist
|
|
precedence:
|
no precedence defined
|
|
result-values:
|
_
|
|
signature:
|
Span -> Span -> Prelude.Int
|
|
solution-complete:
|
operation might suspend on free variables
|
|
terminating:
|
possibly non-terminating
|
|
totally-defined:
|
possibly non-reducible on same data term
|