| definition: |
moveLn :: Pos -> Line -> Pos moveLn (Pos f a x y) n = Pos f a (x+n) y |
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Pos},_) |-> {Pos}}
|
| name: |
moveLn |
| precedence: |
no precedence defined |
| result-values: |
{Pos}
|
| signature: |
Pos -> Prelude.Int -> Pos |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |