Data.Exists

Documentation

data Exists (f :: k -> *) :: * where

Constructors

Exists :: f x -> Exists f

Instances

Eq (Exists (MetaVarI :: Atom kon -> Type))

Defined in Data.HDiff.MetaVar

Methods

(==) :: Exists MetaVarI -> Exists MetaVarI -> Bool

(/=) :: Exists MetaVarI -> Exists MetaVarI -> Bool

Eq (Exists (MetaVarIK ki))

Defined in Data.HDiff.MetaVar

Methods

(==) :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Bool

(/=) :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Bool

(EqHO ki, TestEquality ki) => Eq (Exists (Holes ki codes (MetaVarIK ki)))

Defined in Data.HDiff.Change.Classify

Methods

(==) :: Exists (Holes ki codes (MetaVarIK ki)) -> Exists (Holes ki codes (MetaVarIK ki)) -> Bool

(/=) :: Exists (Holes ki codes (MetaVarIK ki)) -> Exists (Holes ki codes (MetaVarIK ki)) -> Bool

Ord (Exists (MetaVarI :: Atom kon -> Type))

Defined in Data.HDiff.MetaVar

Methods

compare :: Exists MetaVarI -> Exists MetaVarI -> Ordering

(<) :: Exists MetaVarI -> Exists MetaVarI -> Bool

(<=) :: Exists MetaVarI -> Exists MetaVarI -> Bool

(>) :: Exists MetaVarI -> Exists MetaVarI -> Bool

(>=) :: Exists MetaVarI -> Exists MetaVarI -> Bool

max :: Exists MetaVarI -> Exists MetaVarI -> Exists MetaVarI

min :: Exists MetaVarI -> Exists MetaVarI -> Exists MetaVarI

Ord (Exists (MetaVarIK ki))

Defined in Data.HDiff.MetaVar

Methods

compare :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Ordering

(<) :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Bool

(<=) :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Bool

(>) :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Bool

(>=) :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Bool

max :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Exists (MetaVarIK ki)

min :: Exists (MetaVarIK ki) -> Exists (MetaVarIK ki) -> Exists (MetaVarIK ki)

(forall (i :: k). Show (x i)) => Show (Exists x)

Defined in Data.Exists

Methods

showsPrec :: Int -> Exists x -> ShowS

show :: Exists x -> String

showList :: [Exists x] -> ShowS

exMap :: (forall x. f x -> g x) -> Exists f -> Exists g

exMapM :: Monad m => (forall x. f x -> m (g x)) -> Exists f -> m (Exists g)

exElim :: (forall x. f x -> a) -> Exists f -> a