| definition: |
cmpInteger :: BinInt -> BinInt -> Ordering cmpInteger Zero Zero = EQ cmpInteger Zero (Pos _) = LT cmpInteger Zero (Neg _) = GT cmpInteger (Pos _) Zero = GT cmpInteger (Pos x) (Pos y) = cmpNat x y cmpInteger (Pos _) (Neg _) = GT cmpInteger (Neg _) Zero = LT cmpInteger (Neg _) (Pos _) = LT cmpInteger (Neg x) (Neg y) = cmpNat y x |
| demand: |
arguments 1 2 |
| deterministic: |
deterministic operation |
| documentation: |
--- Comparison on BinInt, O(min (m, n)) |
| failfree: |
(_, _) |
| indeterministic: |
referentially transparent operation |
| infix: |
no fixity defined |
| iotype: |
{({Zero},{Zero}) |-> {EQ} || ({Zero},{Pos}) |-> {LT} || ({Zero},{Neg}) |-> {GT} || ({Pos},{Zero}) |-> {GT} || ({Pos},{Pos}) |-> {EQ,GT,LT} || ({Pos},{Neg}) |-> {GT} || ({Neg},{Zero}) |-> {LT} || ({Neg},{Pos}) |-> {LT} || ({Neg},{Neg}) |-> {EQ,GT,LT}}
|
| name: |
cmpInteger |
| precedence: |
no precedence defined |
| result-values: |
{EQ,GT,LT}
|
| signature: |
BinInt -> BinInt -> Prelude.Ordering |
| solution-complete: |
operation might suspend on free variables |
| terminating: |
yes |
| totally-defined: |
reducible on all ground data terms |