Modulelinear-base-0.4.0Haskell2010

Data.Ord.Linear.Internal.Ord

1 type
1 class
2 values

Packagelinear-base-0.4.0
Exports4
LanguageHaskell2010
LicenceMIT
SourceOrd.hs

classclass Eq a => Ord a where

Linear Orderings

Linear orderings provide a strict order. The laws for (<=) for all a,b,c:

reflexivity: a \leq a
antisymmetry: (a \leq b) \land (b \leq a) \rightarrow (a = b)
transitivity: (a \leq b) \land (b \leq c) \rightarrow (a \leq c)

and these "agree" with <:

x <= y = not (y > x)
x >= y = not (y < x)

Unlike in the non-linear setting, a linear compare doesn't follow from <= since it requires calls: one to <= and one to ==. However, from a linear compare it is easy to implement the others. Hence, the minimal complete definition only contains compare.

Methods

compare :: a %1 -> a %1 -> Orderinginfix 4
compare x y returns an Ordering which is one of GT (greater than), EQ (equal), or LT (less than) which should be understood as "x is (compare x y) y".
(<=) :: a %1 -> a %1 -> Boolinfix 4
(<) :: a %1 -> a %1 -> Boolinfix 4
(>) :: a %1 -> a %1 -> Boolinfix 4
(>=) :: a %1 -> a %1 -> Boolinfix 4

Instances22Ord, …

Ord Int16Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord Int32Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord Int64Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord Int8Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord Word16Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord Word32Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord Word64Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord Word8Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord BoolDefined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord CharDefined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord DoubleDefined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord IntDefined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord OrderingDefined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord ()Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
Ord a => Ord (Ur a)Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
(Ord a, Movable a) => Ord (MovableOrd a)Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
(Consumable a, Ord a) => Ord (Maybe a)Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
(Consumable a, Ord a) => Ord [a]Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
(Ord a, Ord b) => Ord (a, b)Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
(Consumable a, Consumable b, Ord a, Ord b) => Ord (Either a b)Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
(Ord a, Ord b, Ord c) => Ord (a, b, c)Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
(Ord a, Ord b, Ord c, Ord d) => Ord (a, b, c, d)Defined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord

datadata Ordering

LT EQ GT

Instances30Bounded, Enum, Data, Read, Show, Ix, …

Bounded OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Enum
Enum OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Enum
Eq OrderingDefined in ghc-prim-0.12.0 · GHC.Classes
Data OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Data.Data
Ord OrderingDefined in ghc-prim-0.12.0 · GHC.Classes
Read OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Read
Show OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Show
Ix OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Ix
Generic OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Generics
Semigroup OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Base
Monoid OrderingDefined in ghc-internal-9.1003.0 · GHC.Internal.Base
NFData OrderingDefined in deepseq-1.5.0.0 · Control.DeepSeq
Pretty OrderingDefined in pretty-1.1.3.6 · Text.PrettyPrint.Annotated.HughesPJClass
Pretty OrderingDefined in pretty-1.1.3.6 · Text.PrettyPrint.HughesPJClass
Finite OrderingDefined in random-1.2.1.3 · System.Random.GFinite
Arbitrary OrderingDefined in QuickCheck-2.15.0.1 · Test.QuickCheck.Arbitrary
CoArbitrary OrderingDefined in QuickCheck-2.15.0.1 · Test.QuickCheck.Arbitrary
Function OrderingDefined in QuickCheck-2.15.0.1 · Test.QuickCheck.Function
Binary OrderingDefined in binary-0.8.9.3 · Data.Binary.Class
Hashable OrderingDefined in hashable-1.4.7.0 · Data.Hashable.Class
Generic OrderingDefined in linear-generics-0.2.3 · Generics.Linear.Instances.Base · orphan
Monoid OrderingDefined in linear-base-0.4.0 · Data.Monoid.Linear.Internal.Monoid
Consumable OrderingDefined in linear-base-0.4.0 · Data.Unrestricted.Linear.Internal.Consumable
Dupable OrderingDefined in linear-base-0.4.0 · Data.Unrestricted.Linear.Internal.Dupable
Semigroup OrderingDefined in linear-base-0.4.0 · Data.Monoid.Linear.Internal.Semigroup
Movable OrderingDefined in linear-base-0.4.0 · Data.Unrestricted.Linear.Internal.Movable
Eq OrderingDefined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Eq
Ord OrderingDefined in linear-base-0.4.0 · Data.Ord.Linear.Internal.Ord
type Rep Ordering = D1 ('MetaData "Ordering" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "LT" 'PrefixI 'False) U1 :+: (C1 ('MetaCons "EQ" 'PrefixI 'False) U1 :+: C1 ('MetaCons "GT" 'PrefixI 'False) U1))Defined in ghc-internal-9.1003.0 · GHC.Internal.Generics
type Rep Ordering = D1 ('MetaData "Ordering" "GHC.Types" "ghc-prim" 'False) (C1 ('MetaCons "LT" 'PrefixI 'False) U1 :+: (C1 ('MetaCons "EQ" 'PrefixI 'False) U1 :+: C1 ('MetaCons "GT" 'PrefixI 'False) U1))Defined in linear-generics-0.2.3 · Generics.Linear.Instances.Base · orphan

valuemin :: (Dupable a, Ord a) => a %1 -> a %1 -> a

min x y returns the smaller input, or y in case of a tie.

valuemax :: (Dupable a, Ord a) => a %1 -> a %1 -> a

max x y returns the larger input, or y in case of a tie.