Data.Bounded

class (Ord a) <= Bounded a  where

The Bounded type class represents totally ordered types that have an upper and lower boundary.

Instances should satisfy the following law in addition to the Ord laws:

• Bounded: bottom <= a <= top

Members

• top :: a
• bottom :: a

Instances

• Bounded Boolean
• Bounded Int

  The Bounded Int instance has top :: Int equal to 2^31 - 1, and bottom :: Int equal to -2^31, since these are the largest and smallest integers representable by twos-complement 32-bit integers, respectively.

• Bounded Char

  Characters fall within the Unicode range.

• Bounded Ordering
• Bounded Unit
• Bounded Number
• Bounded (Proxy a)
• Bounded (Proxy2 a)
• Bounded (Proxy3 a)
• (RowToList row list, BoundedRecord list row row) => Bounded (Record row)

class (OrdRecord rowlist row) <= BoundedRecord rowlist row subrow | rowlist -> subrow where

Members

• topRecord :: forall rlproxy rproxy. rlproxy rowlist -> rproxy row -> Record subrow
• bottomRecord :: forall rlproxy rproxy. rlproxy rowlist -> rproxy row -> Record subrow

Instances

• BoundedRecord Nil row ()
• (IsSymbol key, Bounded focus, Cons key focus rowTail row, Cons key focus subrowTail subrow, BoundedRecord rowlistTail row subrowTail) => BoundedRecord (Cons key focus rowlistTail) row subrow

data Ordering

The Ordering data type represents the three possible outcomes of comparing two values:

LT - The first value is less than the second. GT - The first value is greater than the second. EQ - The first value is equal to the second.

Constructors

• LT
• GT
• EQ

Instances

• Eq Ordering
• Semigroup Ordering
• Show Ordering

class (Eq a) <= Ord a  where

The Ord type class represents types which support comparisons with a total order.

Ord instances should satisfy the laws of total orderings:

• Reflexivity: a <= a
• Antisymmetry: if a <= b and b <= a then a = b
• Transitivity: if a <= b and b <= c then a <= c

Members

• compare :: a -> a -> Ordering

Instances

• Ord Boolean
• Ord Int
• Ord Number
• Ord String
• Ord Char
• Ord Unit
• Ord Void
• Ord (Proxy a)
• Ord (Proxy2 a)
• Ord (Proxy3 a)
• (Ord a) => Ord (Array a)
• Ord Ordering
• (RowToList row list, OrdRecord list row) => Ord (Record row)

class (EqRecord rowlist row) <= OrdRecord rowlist row 

Instances

• OrdRecord Nil row
• (OrdRecord rowlistTail row, Cons key focus rowTail row, IsSymbol key, Ord focus) => OrdRecord (Cons key focus rowlistTail) row

Operator alias for Data.Ord.greaterThanOrEq (left-associative / precedence 4)

Operator alias for Data.Ord.greaterThan (left-associative / precedence 4)

Operator alias for Data.Ord.lessThanOrEq (left-associative / precedence 4)

Operator alias for Data.Ord.lessThan (left-associative / precedence 4)