Generics.MultiRec.Eq

Generic equality.

Generic equality

class HEq phi f where

Minimal complete definition

heq

Methods

heq :: (forall ix. phi ix -> r ix -> r ix -> Bool) -> phi ix -> f r ix -> f r ix -> Bool

Instances

HEq phi U

Methods

heq :: (forall ix. phi ix -> r ix -> r ix -> Bool) -> phi ix -> U r ix -> U r ix -> Bool

Eq a => HEq phi (K a)

For constant types, we make use of the standard equality function.

Methods

heq :: (forall ix. phi ix -> r ix -> r ix -> Bool) -> phi ix -> K a r ix -> K a r ix -> Bool

El phi xi => HEq phi (I xi)

Methods

heq :: (forall ix. phi ix -> r ix -> r ix -> Bool) -> phi ix -> I xi r ix -> I xi r ix -> Bool

(Constructor c, HEq phi f) => HEq phi (C c f)

Methods

heq :: (forall ix. phi ix -> r ix -> r ix -> Bool) -> phi ix -> C c f r ix -> C c f r ix -> Bool

HEq phi f => HEq phi ((:>:) f ix)

Methods

heq :: (forall ix0. phi ix0 -> r ix0 -> r ix0 -> Bool) -> phi ix -> (f :>: ix) r ix -> (f :>: ix) r ix -> Bool

(Eq1 f, HEq phi g) => HEq phi ((:.:) f g)

Methods

heq :: (forall ix. phi ix -> r ix -> r ix -> Bool) -> phi ix -> (f :.: g) r ix -> (f :.: g) r ix -> Bool

(HEq phi f, HEq phi g) => HEq phi ((:*:) f g)

Methods

heq :: (forall ix. phi ix -> r ix -> r ix -> Bool) -> phi ix -> (f :*: g) r ix -> (f :*: g) r ix -> Bool

(HEq phi f, HEq phi g) => HEq phi ((:+:) f g)

Methods

heq :: (forall ix. phi ix -> r ix -> r ix -> Bool) -> phi ix -> (f :+: g) r ix -> (f :+: g) r ix -> Bool

class Eq1 f where

Minimal complete definition

eq1

Methods

eq1 :: (a -> a -> Bool) -> f a -> f a -> Bool

Instances

Eq1 []

Methods

eq1 :: (a -> a -> Bool) -> [a] -> [a] -> Bool

Eq1 Maybe

Methods

eq1 :: (a -> a -> Bool) -> Maybe a -> Maybe a -> Bool

eq :: (Fam phi, HEq phi (PF phi)) => phi ix -> ix -> ix -> Bool