Safe Haskell	None
Language	Haskell2010

Data.MediaBus.Basics.Monotone

Synopsis

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.

Minimal complete definition

succeeds

Methods

succeeds :: a -> a -> Bool Source #

Instances

LocalOrd Int Source #
Methods succeeds :: Int -> Int -> Bool Source #
LocalOrd Int8 Source #
Methods succeeds :: Int8 -> Int8 -> Bool Source #
LocalOrd Int16 Source #
Methods succeeds :: Int16 -> Int16 -> Bool Source #
LocalOrd Int32 Source #
Methods succeeds :: Int32 -> Int32 -> Bool Source #
LocalOrd Int64 Source #
Methods succeeds :: Int64 -> Int64 -> Bool Source #
LocalOrd Word8 Source #
Methods succeeds :: Word8 -> Word8 -> Bool Source #
LocalOrd Word16 Source #
Methods succeeds :: Word16 -> Word16 -> Bool Source #
LocalOrd Word32 Source #
Methods succeeds :: Word32 -> Word32 -> Bool Source #
LocalOrd Word64 Source #
Methods succeeds :: Word64 -> Word64 -> Bool Source #
LocalOrd s => LocalOrd (SeqNum s) Source #
Methods succeeds :: SeqNum s -> SeqNum s -> Bool Source #
LocalOrd w => LocalOrd (Ticks rate w) Source #
Methods succeeds :: Ticks rate w -> Ticks rate w -> Bool Source #
LocalOrd (ClockTimeDiff * UtcClock) Source #
Methods succeeds :: ClockTimeDiff * UtcClock -> ClockTimeDiff * UtcClock -> Bool Source #