Copyright	(C) 2021 Ryan Scott
License	BSD-style (see the file LICENSE)
Maintainer	Ryan Scott
Stability	Experimental
Portability	GHC
Safe Haskell	Trustworthy
Language	GHC2021

Data.Eliminator.Monoid

Description

Eliminator functions for data types in Data.Monoid. All of these are re-exported from Data.Eliminator with the following exceptions:

First and Last are not re-exported from Data.Eliminator, as they clash with eliminators of the same names in Data.Eliminator.Functor and Data.Eliminator.Semigroup.
Sum and Product are not re-exported from Data.Eliminator, as they clash with eliminators of the same names in Data.Eliminator.Functor.

Documentation

elimAll :: forall (p :: All ~> Type) (s :: All). Sing s -> (forall (f0 :: Bool). Sing f0 -> Apply p ('All f0)) -> Apply p s Source #

type family ElimAll (p :: All ~> Type) (s :: All) (p1 :: forall (f0 :: Bool) -> Apply p ('All f0)) :: Apply p s where ... Source #

Equations

ElimAll p ('All s0) (useThis :: forall (f0 :: Bool) -> Apply p ('All f0)) = useThis s0

elimAny :: forall (p :: Any ~> Type) (s :: Any). Sing s -> (forall (f0 :: Bool). Sing f0 -> Apply p ('Any f0)) -> Apply p s Source #

type family ElimAny (p :: Any ~> Type) (s :: Any) (p1 :: forall (f0 :: Bool) -> Apply p ('Any f0)) :: Apply p s where ... Source #

Equations

ElimAny p ('Any s0) (useThis :: forall (f0 :: Bool) -> Apply p ('Any f0)) = useThis s0

elimDual :: forall a (p :: Dual a ~> Type) (s :: Dual a). Sing s -> (forall (f0 :: a). Sing f0 -> Apply p ('Dual f0)) -> Apply p s Source #

type family ElimDual (p :: Dual a ~> Type) (s :: Dual a) (p1 :: forall (f0 :: a) -> Apply p ('Dual f0)) :: Apply p s where ... Source #

Equations

ElimDual (p :: Dual a ~> Type) ('Dual s0 :: Dual a) (useThis :: forall (f0 :: a) -> Apply p ('Dual f0)) = useThis s0

elimFirst :: forall a (p :: First a ~> Type) (s :: First a). Sing s -> (forall (f0 :: Maybe a). Sing f0 -> Apply p ('First f0)) -> Apply p s Source #

type family ElimFirst (p :: First a ~> Type) (s :: First a) (p1 :: forall (f0 :: Maybe a) -> Apply p ('First f0)) :: Apply p s where ... Source #

Equations

ElimFirst (p :: First a ~> Type) ('First s0 :: First a) (useThis :: forall (f0 :: Maybe a) -> Apply p ('First f0)) = useThis s0

elimLast :: forall a (p :: Last a ~> Type) (s :: Last a). Sing s -> (forall (f0 :: Maybe a). Sing f0 -> Apply p ('Last f0)) -> Apply p s Source #

type family ElimLast (p :: Last a ~> Type) (s :: Last a) (p1 :: forall (f0 :: Maybe a) -> Apply p ('Last f0)) :: Apply p s where ... Source #

Equations

ElimLast (p :: Last a ~> Type) ('Last s0 :: Last a) (useThis :: forall (f0 :: Maybe a) -> Apply p ('Last f0)) = useThis s0

elimProduct :: forall a (p :: Product a ~> Type) (s :: Product a). Sing s -> (forall (f0 :: a). Sing f0 -> Apply p ('Product f0)) -> Apply p s Source #

type family ElimProduct (p :: Product a ~> Type) (s :: Product a) (p1 :: forall (f0 :: a) -> Apply p ('Product f0)) :: Apply p s where ... Source #

Equations

ElimProduct (p :: Product a ~> Type) ('Product s0 :: Product a) (useThis :: forall (f0 :: a) -> Apply p ('Product f0)) = useThis s0

elimSum :: forall a (p :: Sum a ~> Type) (s :: Sum a). Sing s -> (forall (f0 :: a). Sing f0 -> Apply p ('Sum f0)) -> Apply p s Source #

type family ElimSum (p :: Sum a ~> Type) (s :: Sum a) (p1 :: forall (f0 :: a) -> Apply p ('Sum f0)) :: Apply p s where ... Source #

Equations

ElimSum (p :: Sum a ~> Type) ('Sum s0 :: Sum a) (useThis :: forall (f0 :: a) -> Apply p ('Sum f0)) = useThis s0