Safe Haskell	Safe
Language	Haskell2010

Data.PartialOrder

Synopsis

class PartialOrder a where
- pcompare :: a -> a -> Maybe Ordering
- comparable :: a -> a -> Bool
- lte :: a -> a -> Bool
- gte :: a -> a -> Bool
- lt :: a -> a -> Bool
- gt :: a -> a -> Bool
- eq :: a -> a -> Bool

Documentation

class PartialOrder a where #

Partially ordered values. The default instance just lifts compare to pcompare, i.e. all values should be comparable.

Minimal complete definition

Nothing

Methods

pcompare :: a -> a -> Maybe Ordering #

default pcompare :: Ord a => a -> a -> Maybe Ordering #

comparable :: a -> a -> Bool #

lte :: a -> a -> Bool #

gte :: a -> a -> Bool #

lt :: a -> a -> Bool #

gt :: a -> a -> Bool #

eq :: a -> a -> Bool #

Instances

Instances details

PartialOrder TypeOrder #
Instance details Defined in Test.Expr.Types Methods pcompare :: TypeOrder -> TypeOrder -> Maybe Ordering # comparable :: TypeOrder -> TypeOrder -> Bool # lte :: TypeOrder -> TypeOrder -> Bool # gte :: TypeOrder -> TypeOrder -> Bool # lt :: TypeOrder -> TypeOrder -> Bool # gt :: TypeOrder -> TypeOrder -> Bool # eq :: TypeOrder -> TypeOrder -> Bool #
PartialOrder Integer #
Instance details Defined in Data.PartialOrder Methods pcompare :: Integer -> Integer -> Maybe Ordering # comparable :: Integer -> Integer -> Bool # lte :: Integer -> Integer -> Bool # gte :: Integer -> Integer -> Bool # lt :: Integer -> Integer -> Bool # gt :: Integer -> Integer -> Bool # eq :: Integer -> Integer -> Bool #
PartialOrder () #
Instance details Defined in Data.PartialOrder Methods pcompare :: () -> () -> Maybe Ordering # comparable :: () -> () -> Bool # lte :: () -> () -> Bool # gte :: () -> () -> Bool # lt :: () -> () -> Bool # gt :: () -> () -> Bool # eq :: () -> () -> Bool #
PartialOrder Bool #
Instance details Defined in Data.PartialOrder Methods pcompare :: Bool -> Bool -> Maybe Ordering # comparable :: Bool -> Bool -> Bool # lte :: Bool -> Bool -> Bool # gte :: Bool -> Bool -> Bool # lt :: Bool -> Bool -> Bool # gt :: Bool -> Bool -> Bool # eq :: Bool -> Bool -> Bool #
PartialOrder Char #
Instance details Defined in Data.PartialOrder Methods pcompare :: Char -> Char -> Maybe Ordering # comparable :: Char -> Char -> Bool # lte :: Char -> Char -> Bool # gte :: Char -> Char -> Bool # lt :: Char -> Char -> Bool # gt :: Char -> Char -> Bool # eq :: Char -> Char -> Bool #
PartialOrder Double #
Instance details Defined in Data.PartialOrder Methods pcompare :: Double -> Double -> Maybe Ordering # comparable :: Double -> Double -> Bool # lte :: Double -> Double -> Bool # gte :: Double -> Double -> Bool # lt :: Double -> Double -> Bool # gt :: Double -> Double -> Bool # eq :: Double -> Double -> Bool #
PartialOrder Float #
Instance details Defined in Data.PartialOrder Methods pcompare :: Float -> Float -> Maybe Ordering # comparable :: Float -> Float -> Bool # lte :: Float -> Float -> Bool # gte :: Float -> Float -> Bool # lt :: Float -> Float -> Bool # gt :: Float -> Float -> Bool # eq :: Float -> Float -> Bool #
PartialOrder Int #
Instance details Defined in Data.PartialOrder Methods pcompare :: Int -> Int -> Maybe Ordering # comparable :: Int -> Int -> Bool # lte :: Int -> Int -> Bool # gte :: Int -> Int -> Bool # lt :: Int -> Int -> Bool # gt :: Int -> Int -> Bool # eq :: Int -> Int -> Bool #
PartialOrder Word #
Instance details Defined in Data.PartialOrder Methods pcompare :: Word -> Word -> Maybe Ordering # comparable :: Word -> Word -> Bool # lte :: Word -> Word -> Bool # gte :: Word -> Word -> Bool # lt :: Word -> Word -> Bool # gt :: Word -> Word -> Bool # eq :: Word -> Word -> Bool #
PartialOrder a => PartialOrder [a] #
Instance details Defined in Data.PartialOrder Methods pcompare :: [a] -> [a] -> Maybe Ordering # comparable :: [a] -> [a] -> Bool # lte :: [a] -> [a] -> Bool # gte :: [a] -> [a] -> Bool # lt :: [a] -> [a] -> Bool # gt :: [a] -> [a] -> Bool # eq :: [a] -> [a] -> Bool #
(PartialOrder a, PartialOrder b) => PartialOrder (a, b) #
Instance details Defined in Data.PartialOrder Methods pcompare :: (a, b) -> (a, b) -> Maybe Ordering # comparable :: (a, b) -> (a, b) -> Bool # lte :: (a, b) -> (a, b) -> Bool # gte :: (a, b) -> (a, b) -> Bool # lt :: (a, b) -> (a, b) -> Bool # gt :: (a, b) -> (a, b) -> Bool # eq :: (a, b) -> (a, b) -> Bool #
(PartialOrder a, PartialOrder b, PartialOrder c) => PartialOrder (a, b, c) #
Instance details Defined in Data.PartialOrder Methods pcompare :: (a, b, c) -> (a, b, c) -> Maybe Ordering # comparable :: (a, b, c) -> (a, b, c) -> Bool # lte :: (a, b, c) -> (a, b, c) -> Bool # gte :: (a, b, c) -> (a, b, c) -> Bool # lt :: (a, b, c) -> (a, b, c) -> Bool # gt :: (a, b, c) -> (a, b, c) -> Bool # eq :: (a, b, c) -> (a, b, c) -> Bool #
(PartialOrder a, PartialOrder b, PartialOrder c, PartialOrder d) => PartialOrder (a, b, c, d) #
Instance details Defined in Data.PartialOrder Methods pcompare :: (a, b, c, d) -> (a, b, c, d) -> Maybe Ordering # comparable :: (a, b, c, d) -> (a, b, c, d) -> Bool # lte :: (a, b, c, d) -> (a, b, c, d) -> Bool # gte :: (a, b, c, d) -> (a, b, c, d) -> Bool # lt :: (a, b, c, d) -> (a, b, c, d) -> Bool # gt :: (a, b, c, d) -> (a, b, c, d) -> Bool # eq :: (a, b, c, d) -> (a, b, c, d) -> Bool #