| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Relation.Binary.Comparison
Documentation
Methods
(≤) :: a -> a -> Bool infix 4 #
(≥) :: a -> a -> Bool infix 4 #
Instances
| Preord Bool # | |
| Preord Char # | |
| Preord Int # | |
| Preord Int8 # | |
| Preord Int16 # | |
| Preord Int32 # | |
| Preord Int64 # | |
| Preord Integer # | |
| Preord Natural # | |
| Preord Ordering # | |
| Preord Word # | |
| Preord Word8 # | |
| Preord Word16 # | |
| Preord Word32 # | |
| Preord Word64 # | |
| Preord () # | |
| Preord a => Preord (Maybe a) # | |
| Preord (Sum Natural) # | |
| Preord a => Preord (Down a) # | |
| Bits a => Preord (Min (BitSet a)) # | |
| Bits a => Preord (Max (BitSet a)) # | |
| Preord a => Preord (Lexical (Maybe a)) # | |
| (Preord a, Preord b) => Preord (Lexical (Either a b)) # | |
| (PartialOrd a, PartialOrd b) => Preord (Lexical (a, b)) # | |
| (PartialOrd a, PartialOrd b, PartialOrd c) => Preord (Lexical (a, b, c)) # | |
| Bits a => Preord (BitSet a) # | |
| (Preord a, Preord b) => Preord (Either a b) # | |
| (Preord a, Preord b) => Preord (a, b) # | |
| (Preord a, Preord b, Preord c) => Preord (a, b, c) # | |
Instances
| PartialEq Bool # | |
| PartialEq Char # | |
| PartialEq Int # | |
| PartialEq Int8 # | |
| PartialEq Int16 # | |
| PartialEq Int32 # | |
| PartialEq Int64 # | |
| PartialEq Integer # | |
| PartialEq Natural # | |
| PartialEq Ordering # | |
| PartialEq Word # | |
| PartialEq Word8 # | |
| PartialEq Word16 # | |
| PartialEq Word32 # | |
| PartialEq Word64 # | |
| PartialEq () # | |
| PartialEq a => PartialEq [a] # | |
| PartialEq a => PartialEq (Maybe a) # | |
| PartialEq a => PartialEq (Ratio a) # | |
| PartialEq (Sum Natural) # | |
| PartialEq a => PartialEq (Down a) # | |
| Bits a => PartialEq (Min (BitSet a)) # | |
| Bits a => PartialEq (Max (BitSet a)) # | |
| PartialEq a => PartialEq (Lexical a) # | |
| Bits a => PartialEq (BitSet a) # | |
| (PartialEq a, PartialEq b) => PartialEq (Either a b) # | |
| (PartialEq a, PartialEq b) => PartialEq (a, b) # | |
| (PartialEq a, PartialEq b, PartialEq c) => PartialEq (a, b, c) # | |
class (Preord a, PartialEq a) => Eq a #
Instances
class (Preord a, PartialEq a) => PartialOrd a where #
Minimal complete definition
Nothing
Methods
tryCompare :: a -> a -> Maybe Ordering #
Instances
class (PartialOrd a, Eq a) => Ord a where #
Minimal complete definition
Nothing
Instances
| Ord Bool # | |
| Ord Char # | |
| Ord Int # | |
| Ord Int8 # | |
| Ord Int16 # | |
| Ord Int32 # | |
| Ord Int64 # | |
| Ord Integer # | |
| Ord Natural # | |
| Ord Ordering # | |
| Ord Word # | |
| Ord Word8 # | |
| Ord Word16 # | |
| Ord Word32 # | |
| Ord Word64 # | |
| Ord () # | |
Defined in Relation.Binary.Comparison | |
| Ord (Sum Natural) # | |
| Ord a => Ord (Down a) # | |
| Ord a => Ord (Lexical (Maybe a)) # | |
| (Ord a, Ord b) => Ord (Lexical (Either a b)) # | |
| (Ord a, Ord b) => Ord (Lexical (a, b)) # | |
| (Ord a, Ord b, Ord c) => Ord (Lexical (a, b, c)) # | |
Constructors
| Lexical a |
Instances
class (Monoid a, Abelian a, PartialOrd a) => Monus a where #