Ersatz.Orderable

Documentation

class Equatable t => Orderable t where

Instances for this class for arbitrary types can be automatically derived from Generic.

Minimal complete definition

Nothing

Methods

(<?) :: t -> t -> Bit infix 4

Compare for less-than within the SAT problem.

(<=?) :: t -> t -> Bit infix 4

Compare for less-than or equal-to within the SAT problem.

(>=?) :: t -> t -> Bit infix 4

Compare for greater-than or equal-to within the SAT problem.

(>?) :: t -> t -> Bit infix 4

Compare for greater-than within the SAT problem.

Instances

Orderable Bit

Orderable Bits

Orderable Bit8

Orderable Bit7

Orderable Bit6

Orderable Bit5

Orderable Bit4

Orderable Bit3

Orderable Bit2

Orderable Bit1

Orderable BitChar

Orderable a => Orderable [a]

Lexicographic order

Orderable a => Orderable (Maybe a)

(Orderable a, Orderable b) => Orderable (Either a b)

(Orderable a, Orderable b) => Orderable (a, b)

(Orderable a, Orderable b, Orderable c) => Orderable (a, b, c)

(Orderable a, Orderable b, Orderable c, Orderable d) => Orderable (a, b, c, d)

(Orderable a, Orderable b, Orderable c, Orderable d, Orderable e) => Orderable (a, b, c, d, e)

(Orderable a, Orderable b, Orderable c, Orderable d, Orderable e, Orderable f) => Orderable (a, b, c, d, e, f)

(Orderable a, Orderable b, Orderable c, Orderable d, Orderable e, Orderable f, Orderable g) => Orderable (a, b, c, d, e, f, g)

class GEquatable f => GOrderable f where

Methods

(<?#) :: f a -> f a -> Bit

(<=?#) :: f a -> f a -> Bit

Instances

GOrderable V1

GOrderable U1

Orderable a => GOrderable (K1 i a)

(GOrderable f, GOrderable g) => GOrderable ((:+:) f g)

(GOrderable f, GOrderable g) => GOrderable ((:*:) f g)

GOrderable f => GOrderable (M1 i c f)