License	BSD-style (see the file LICENSE)
Maintainer	sjoerd@w3future.com
Stability	experimental
Portability	non-portable
Safe Haskell	Safe
Language	Haskell98

Generics.OneLiner.Classes

Description

Synopsis

Documentation

class (Profunctor p, GenericUnitProfunctor p, GenericProductProfunctor p) => GenericRecordProfunctor p Source #

A generic function using a GenericRecordProfunctor works on any data type with exactly one constructor, a.k.a. records, with multiple fields (mult) or no fields (unit).

GenericRecordProfunctor is similar to ProductProfuctor from the product-profunctor package, but using types from GHC.Generics.

Instances

(Profunctor p, GenericUnitProfunctor p, GenericProductProfunctor p) => GenericRecordProfunctor p Source #

class (GenericRecordProfunctor p, GenericSumProfunctor p) => GenericNonEmptyProfunctor p Source #

A generic function using a GenericNonEmptyProfunctor works on any data type with at least one constructor.

Instances

(GenericRecordProfunctor p, GenericSumProfunctor p) => GenericNonEmptyProfunctor p Source #

class (GenericNonEmptyProfunctor p, GenericEmptyProfunctor p) => GenericProfunctor p Source #

A generic function using a GenericProfunctor works on any algebraic data type, including those with no constructors and constants.

Instances

(GenericNonEmptyProfunctor p, GenericEmptyProfunctor p) => GenericProfunctor p Source #

class Profunctor p => GenericUnitProfunctor p where Source #

Minimal complete definition

unit

Methods

unit :: p (U1 a) (U1 a') Source #

Instances

Applicative f => GenericUnitProfunctor (Star f) Source #
Methods unit :: Star f (U1 * a) (U1 * a') Source #
Functor f => GenericUnitProfunctor (Costar f) Source #
Methods unit :: Costar f (U1 * a) (U1 * a') Source #
GenericUnitProfunctor (Tagged *) Source #
Methods unit :: Tagged * (U1 * a) (U1 * a') Source #
Applicative f => GenericUnitProfunctor (Zip f) Source #
Methods unit :: Zip f (U1 * a) (U1 * a') Source #
GenericUnitProfunctor (Ctor *) Source #
Methods unit :: Ctor * (U1 * a) (U1 * a') Source #
GenericUnitProfunctor ((->) LiftedRep LiftedRep) Source #
Methods unit :: (LiftedRep -> LiftedRep) (U1 * a) (U1 * a') Source #
Applicative f => GenericUnitProfunctor (Joker * * f) Source #
Methods unit :: Joker * * f (U1 * a) (U1 * a') Source #
Divisible f => GenericUnitProfunctor (Clown * * f) Source #
Methods unit :: Clown * * f (U1 * a) (U1 * a') Source #
(GenericUnitProfunctor p, GenericUnitProfunctor q) => GenericUnitProfunctor (Product * * p q) Source #
Methods unit :: Product * * p q (U1 * a) (U1 * a') Source #
(Applicative f, GenericUnitProfunctor p) => GenericUnitProfunctor (Tannen * * * f p) Source #
Methods unit :: Tannen * * * f p (U1 * a) (U1 * a') Source #
(Functor f, Applicative g, Profunctor p, GenericUnitProfunctor p) => GenericUnitProfunctor (Biff * * * * p f g) Source #
Methods unit :: Biff * * * * p f g (U1 * a) (U1 * a') Source #

class Profunctor p => GenericProductProfunctor p where Source #

Minimal complete definition

mult

Methods

mult :: p (f a) (f' a') -> p (g a) (g' a') -> p ((f :*: g) a) ((f' :*: g') a') Source #

Instances

Applicative f => GenericProductProfunctor (Star f) Source #
Methods mult :: Star f (f a) (f' a') -> Star f (g a) (g' a') -> Star f ((* :: f) g a) (( :*: f') g' a') Source #
Functor f => GenericProductProfunctor (Costar f) Source #
Methods mult :: Costar f (f a) (f' a') -> Costar f (g a) (g' a') -> Costar f ((* :: f) g a) (( :*: f') g' a') Source #
GenericProductProfunctor (Tagged *) Source #
Methods mult :: Tagged * (f a) (f' a') -> Tagged * (g a) (g' a') -> Tagged * ((* :: f) g a) (( :*: f') g' a') Source #
Applicative f => GenericProductProfunctor (Zip f) Source #
Methods mult :: Zip f (f a) (f' a') -> Zip f (g a) (g' a') -> Zip f ((* :: f) g a) (( :*: f') g' a') Source #
GenericProductProfunctor (Ctor *) Source #
Methods mult :: Ctor * (f a) (f' a') -> Ctor * (g a) (g' a') -> Ctor * ((* :: f) g a) (( :*: f') g' a') Source #
GenericProductProfunctor ((->) LiftedRep LiftedRep) Source #
Methods mult :: (LiftedRep -> LiftedRep) (f a) (f' a') -> (LiftedRep -> LiftedRep) (g a) (g' a') -> (LiftedRep -> LiftedRep) ((* :: f) g a) (( :*: f') g' a') Source #
Applicative f => GenericProductProfunctor (Joker * * f) Source #
Methods mult :: Joker * * f (f a) (f' a') -> Joker * * f (g a) (g' a') -> Joker * * f ((* :: f) g a) (( :*: f') g' a') Source #
Divisible f => GenericProductProfunctor (Clown * * f) Source #
Methods mult :: Clown * * f (f a) (f' a') -> Clown * * f (g a) (g' a') -> Clown * * f ((* :: f) g a) (( :*: f') g' a') Source #
(GenericProductProfunctor p, GenericProductProfunctor q) => GenericProductProfunctor (Product * * p q) Source #
Methods mult :: Product * * p q (f a) (f' a') -> Product * * p q (g a) (g' a') -> Product * * p q ((* :: f) g a) (( :*: f') g' a') Source #
(Applicative f, GenericProductProfunctor p) => GenericProductProfunctor (Tannen * * * f p) Source #
Methods mult :: Tannen * * * f p (f a) (f' a') -> Tannen * * * f p (g a) (g' a') -> Tannen * * * f p ((* :: f) g a) (( :*: f') g' a') Source #
(Functor f, Applicative g, Profunctor p, GenericProductProfunctor p) => GenericProductProfunctor (Biff * * * * p f g) Source #
Methods mult :: Biff * * * * p f g (f a) (f' a') -> Biff * * * * p f g (g a) (g' a') -> Biff * * * * p f g ((* :: f) g a) (( :*: f') g' a') Source #

class Profunctor p => GenericSumProfunctor p where Source #

Minimal complete definition

plus

Methods

plus :: p (f a) (f' a') -> p (g a) (g' a') -> p ((f :+: g) a) ((f' :+: g') a') Source #

Instances

Applicative f => GenericSumProfunctor (Star f) Source #
Methods plus :: Star f (f a) (f' a') -> Star f (g a) (g' a') -> Star f ((* :+: f) g a) ((* :+: f') g' a') Source #
Alternative f => GenericSumProfunctor (Zip f) Source #
Methods plus :: Zip f (f a) (f' a') -> Zip f (g a) (g' a') -> Zip f ((* :+: f) g a) ((* :+: f') g' a') Source #
GenericSumProfunctor (Ctor *) Source #
Methods plus :: Ctor * (f a) (f' a') -> Ctor * (g a) (g' a') -> Ctor * ((* :+: f) g a) ((* :+: f') g' a') Source #
GenericSumProfunctor ((->) LiftedRep LiftedRep) Source #
Methods plus :: (LiftedRep -> LiftedRep) (f a) (f' a') -> (LiftedRep -> LiftedRep) (g a) (g' a') -> (LiftedRep -> LiftedRep) ((* :+: f) g a) ((* :+: f') g' a') Source #
Alternative f => GenericSumProfunctor (Joker * * f) Source #
Methods plus :: Joker * * f (f a) (f' a') -> Joker * * f (g a) (g' a') -> Joker * * f ((* :+: f) g a) ((* :+: f') g' a') Source #
Decidable f => GenericSumProfunctor (Clown * * f) Source #
Methods plus :: Clown * * f (f a) (f' a') -> Clown * * f (g a) (g' a') -> Clown * * f ((* :+: f) g a) ((* :+: f') g' a') Source #
(GenericSumProfunctor p, GenericSumProfunctor q) => GenericSumProfunctor (Product * * p q) Source #
Methods plus :: Product * * p q (f a) (f' a') -> Product * * p q (g a) (g' a') -> Product * * p q ((* :+: f) g a) ((* :+: f') g' a') Source #
(Applicative f, GenericSumProfunctor p) => GenericSumProfunctor (Tannen * * * f p) Source #
Methods plus :: Tannen * * * f p (f a) (f' a') -> Tannen * * * f p (g a) (g' a') -> Tannen * * * f p ((* :+: f) g a) ((* :+: f') g' a') Source #

class Profunctor p => GenericEmptyProfunctor p where Source #

Minimal complete definition

identity, zero

Methods

identity :: p a a Source #

zero :: p (V1 a) (V1 a') Source #

Instances

Applicative f => GenericEmptyProfunctor (Star f) Source #
Methods identity :: Star f a a Source # zero :: Star f (V1 * a) (V1 * a') Source #
Alternative f => GenericEmptyProfunctor (Zip f) Source #
Methods identity :: Zip f a a Source # zero :: Zip f (V1 * a) (V1 * a') Source #
GenericEmptyProfunctor (Ctor *) Source #
Methods identity :: Ctor * a a Source # zero :: Ctor * (V1 * a) (V1 * a') Source #
GenericEmptyProfunctor ((->) LiftedRep LiftedRep) Source #
Methods identity :: (LiftedRep -> LiftedRep) a a Source # zero :: (LiftedRep -> LiftedRep) (V1 * a) (V1 * a') Source #
Alternative f => GenericEmptyProfunctor (Joker * * f) Source #
Methods identity :: Joker * * f a a Source # zero :: Joker * * f (V1 * a) (V1 * a') Source #
Decidable f => GenericEmptyProfunctor (Clown * * f) Source #
Methods identity :: Clown * * f a a Source # zero :: Clown * * f (V1 * a) (V1 * a') Source #
(GenericEmptyProfunctor p, GenericEmptyProfunctor q) => GenericEmptyProfunctor (Product * * p q) Source #
Methods identity :: Product * * p q a a Source # zero :: Product * * p q (V1 * a) (V1 * a') Source #
(Applicative f, GenericEmptyProfunctor p) => GenericEmptyProfunctor (Tannen * * * f p) Source #
Methods identity :: Tannen * * * f p a a Source # zero :: Tannen * * * f p (V1 * a) (V1 * a') Source #

newtype Zip f a b Source #

Constructors

Zip
Fields runZip :: a -> a -> f b

Instances

Functor f => Profunctor (Zip f) Source #
Methods dimap :: (a -> b) -> (c -> d) -> Zip f b c -> Zip f a d # lmap :: (a -> b) -> Zip f b c -> Zip f a c # rmap :: (b -> c) -> Zip f a b -> Zip f a c # (#.) :: Coercible * c b => (b -> c) -> Zip f a b -> Zip f a c # (.#) :: Coercible * b a => Zip f b c -> (a -> b) -> Zip f a c #
Alternative f => GenericEmptyProfunctor (Zip f) Source #
Methods identity :: Zip f a a Source # zero :: Zip f (V1 * a) (V1 * a') Source #
Alternative f => GenericSumProfunctor (Zip f) Source #
Methods plus :: Zip f (f a) (f' a') -> Zip f (g a) (g' a') -> Zip f ((* :+: f) g a) ((* :+: f') g' a') Source #
Applicative f => GenericProductProfunctor (Zip f) Source #
Methods mult :: Zip f (f a) (f' a') -> Zip f (g a) (g' a') -> Zip f ((* :: f) g a) (( :*: f') g' a') Source #
Applicative f => GenericUnitProfunctor (Zip f) Source #
Methods unit :: Zip f (U1 * a) (U1 * a') Source #

absurd :: V1 a -> b Source #

e1 :: (f a -> b) -> (g a -> b) -> (f :+: g) a -> b Source #

fst1 :: (f :*: g) a -> f a Source #

snd1 :: (f :*: g) a -> g a Source #