Safe Haskell | None |
---|---|
Language | Haskell2010 |
- class LocalOrd a where
Documentation
class LocalOrd a where Source #
Class of numbers that are monotone increasing having only a relative order, that is not necessarily transitive.
For example, a series of Word8
values: 0 64 128 192 0 64 128 ...
could be
interpreted as a monotone series of consecutive increasing values, that wrap
around after 255. But note that the Ord
instance is not sufficient to
express that 0
succeeds
192
, since Ord
ensures complete transitivity
and therefore 0 < 192
.
LocalOrd Int Source # | |
LocalOrd Int8 Source # | |
LocalOrd Int16 Source # | |
LocalOrd Int32 Source # | |
LocalOrd Int64 Source # | |
LocalOrd Word8 Source # | |
LocalOrd Word16 Source # | |
LocalOrd Word32 Source # | |
LocalOrd Word64 Source # | |
LocalOrd s => LocalOrd (SeqNum s) Source # | |
LocalOrd w => LocalOrd (Ticks rate w) Source # | |
LocalOrd (ClockTimeDiff * UtcClock) Source # | |