| definition: |
leftOf :: Pos -> Pos -> Bool
leftOf [] _ = False
leftOf (_:_) [] = False
leftOf (p:ps) (q:qs) = case compare p q of
LT -> True
EQ -> leftOf ps qs
GT -> False
|
| demand: |
argument 1 |
| deterministic: |
deterministic operation |
| documentation: |
--- Checks whether the first position is left from the second position. |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({[]},_) |-> {False} || ({:},{[]}) |-> {False} || ({:},{:}) |-> {False,True}}
|
| name: |
leftOf |
| precedence: |
no precedence defined |
| result-values: |
{False,True}
|
| signature: |
[Prelude.Int] -> [Prelude.Int] -> Prelude.Bool |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
possibly non-terminating |
| totally-defined: |
possibly non-reducible on same data term |