Data.OrdP

some-1.0.6: Existential type: Some

Safe Haskell | Safe
Language | Haskell2010

Data.OrdP

Synopsis

- class (EqP f, forall (a :: k). Ord (f a)) => OrdP (f :: k -> Type) where
  - comparep :: forall (a :: k) (b :: k). f a -> f b -> Ordering

# Documentation

class (EqP f, forall (a :: k). Ord (f a)) => OrdP (f :: k -> Type) where #

Heterogenous lifted total order.

This class is stronger version of `Ord1` from `base`

    class (forall a. Ord a => Ord (f a)) => Ord1 f where
        liftCompare :: (a -> b -> Ordering) -> f a -> f b -> Ordering

Since: 1.0.5

Methods

comparep :: forall (a :: k) (b :: k). f a -> f b -> Ordering #

#### Instances

Instances details

OrdP SNat # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a :: Nat) (b :: Nat). SNat a -> SNat b -> Ordering #
OrdP SChar # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a :: Char) (b :: Char). SChar a -> SChar b -> Ordering #
OrdP SSymbol # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a :: Symbol) (b :: Symbol). SSymbol a -> SSymbol b -> Ordering #
OrdP (Proxy :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a :: k) (b :: k). Proxy a -> Proxy b -> Ordering #
OrdP (TypeRep :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a :: k) (b :: k). TypeRep a -> TypeRep b -> Ordering #
Ord a => OrdP (Const a :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a0 :: k) (b :: k). Const a a0 -> Const a b -> Ordering #
OrdP ((:~:) a :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a0 :: k) (b :: k). (a :~: a0) -> (a :~: b) -> Ordering #
(OrdP a, OrdP b) => OrdP (Product a b :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a0 :: k) (b0 :: k). Product a b a0 -> Product a b b0 -> Ordering #
(OrdP a, OrdP b) => OrdP (Sum a b :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a0 :: k) (b0 :: k). Sum a b a0 -> Sum a b b0 -> Ordering #
OrdP ((:~~:) a :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a0 :: k) (b :: k). (a :~~: a0) -> (a :~~: b) -> Ordering #
(OrdP a, OrdP b) => OrdP (a :*: b :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a0 :: k) (b0 :: k). (a :*: b) a0 -> (a :*: b) b0 -> Ordering #
(OrdP f, OrdP g) => OrdP (f :+: g :: k -> Type) # |
Instance details Defined in Data.OrdP Methods comparep :: forall (a :: k) (b :: k). (f :+: g) a -> (f :+: g) b -> Ordering #