Generics.OneLiner.Internal

Documentation

type family Constraints' (t :: * -> *) (c :: * -> Constraint) :: Constraint

Instances

type Constraints' V1 c

type Constraints' V1 c = ()

type Constraints' U1 c

type Constraints' U1 c = ()

type Constraints' (K1 i a) c

type Constraints' (K1 i a) c = c a

type Constraints' ((:+:) f g) c

type Constraints' ((:+:) f g) c = (Constraints' f c, Constraints' g c)

type Constraints' ((:*:) f g) c

type Constraints' ((:*:) f g) c = (Constraints' f c, Constraints' g c)

type Constraints' (M1 i t f) c

type Constraints' (M1 i t f) c = Constraints' f c

class ADT' t where

Minimal complete definition

generic'

Methods

generic' :: (Constraints' t c, GenericProfunctor p) => for c -> (forall s. c s => p s s) -> p (t x) (t x)

Instances

ADT' V1

Methods

generic' :: (Constraints' V1 c, GenericProfunctor p) => for c -> (forall s. c s => p s s) -> p (V1 x) (V1 x)

ADT' U1

Methods

generic' :: (Constraints' U1 c, GenericProfunctor p) => for c -> (forall s. c s => p s s) -> p (U1 x) (U1 x)

ADT' (K1 i v)

Methods

generic' :: (Constraints' (K1 i v) c, GenericProfunctor p) => for c -> (forall s. c s => p s s) -> p (K1 i v x) (K1 i v x)

(ADT' f, ADT' g) => ADT' ((:+:) f g)

Methods

generic' :: (Constraints' (f :+: g) c, GenericProfunctor p) => for c -> (forall s. c s => p s s) -> p ((f :+: g) x) ((f :+: g) x)

(ADT' f, ADT' g) => ADT' ((:*:) f g)

Methods

generic' :: (Constraints' (f :*: g) c, GenericProfunctor p) => for c -> (forall s. c s => p s s) -> p ((f :*: g) x) ((f :*: g) x)

ADT' f => ADT' (M1 i t f)

Methods

generic' :: (Constraints' (M1 i t f) c, GenericProfunctor p) => for c -> (forall s. c s => p s s) -> p (M1 i t f x) (M1 i t f x)

class ADTNonEmpty' t where

Minimal complete definition

nonEmpty'

Methods

nonEmpty' :: (Constraints' t c, GenericNonEmptyProfunctor p) => for c -> (forall s. c s => p s s) -> p (t x) (t x)

Instances

ADTNonEmpty' U1

Methods

nonEmpty' :: (Constraints' U1 c, GenericNonEmptyProfunctor p) => for c -> (forall s. c s => p s s) -> p (U1 x) (U1 x)

ADTNonEmpty' (K1 i v)

Methods

nonEmpty' :: (Constraints' (K1 i v) c, GenericNonEmptyProfunctor p) => for c -> (forall s. c s => p s s) -> p (K1 i v x) (K1 i v x)

(ADTNonEmpty' f, ADTNonEmpty' g) => ADTNonEmpty' ((:+:) f g)

Methods

nonEmpty' :: (Constraints' (f :+: g) c, GenericNonEmptyProfunctor p) => for c -> (forall s. c s => p s s) -> p ((f :+: g) x) ((f :+: g) x)

(ADTNonEmpty' f, ADTNonEmpty' g) => ADTNonEmpty' ((:*:) f g)

Methods

nonEmpty' :: (Constraints' (f :*: g) c, GenericNonEmptyProfunctor p) => for c -> (forall s. c s => p s s) -> p ((f :*: g) x) ((f :*: g) x)

ADTNonEmpty' f => ADTNonEmpty' (M1 i t f)

Methods

nonEmpty' :: (Constraints' (M1 i t f) c, GenericNonEmptyProfunctor p) => for c -> (forall s. c s => p s s) -> p (M1 i t f x) (M1 i t f x)

class ADTRecord' t where

Minimal complete definition

record'

Methods

record' :: (Constraints' t c, GenericRecordProfunctor p) => for c -> (forall s. c s => p s s) -> p (t x) (t x)

Instances

ADTRecord' U1

Methods

record' :: (Constraints' U1 c, GenericRecordProfunctor p) => for c -> (forall s. c s => p s s) -> p (U1 x) (U1 x)

ADTRecord' (K1 i v)

Methods

record' :: (Constraints' (K1 i v) c, GenericRecordProfunctor p) => for c -> (forall s. c s => p s s) -> p (K1 i v x) (K1 i v x)

(ADTRecord' f, ADTRecord' g) => ADTRecord' ((:*:) f g)

Methods

record' :: (Constraints' (f :*: g) c, GenericRecordProfunctor p) => for c -> (forall s. c s => p s s) -> p ((f :*: g) x) ((f :*: g) x)

ADTRecord' f => ADTRecord' (M1 i t f)

Methods

record' :: (Constraints' (M1 i t f) c, GenericRecordProfunctor p) => for c -> (forall s. c s => p s s) -> p (M1 i t f x) (M1 i t f x)

type family Constraints1' (t :: * -> *) (c :: (* -> *) -> Constraint) :: Constraint

Instances

type Constraints1' V1 c

type Constraints1' V1 c = ()

type Constraints1' U1 c

type Constraints1' U1 c = ()

type Constraints1' Par1 c

type Constraints1' Par1 c = ()

type Constraints1' (Rec1 f) c

type Constraints1' (Rec1 f) c = c f

type Constraints1' ((:+:) f g) c

type Constraints1' ((:+:) f g) c = (Constraints1' f c, Constraints1' g c)

type Constraints1' ((:*:) f g) c

type Constraints1' ((:*:) f g) c = (Constraints1' f c, Constraints1' g c)

type Constraints1' ((:.:) f g) c

type Constraints1' ((:.:) f g) c = (c f, Constraints1' g c)

type Constraints1' (M1 i t f) c

type Constraints1' (M1 i t f) c = Constraints1' f c

class ADT1' t where

Minimal complete definition

generic1'

Methods

generic1' :: (Constraints1' t c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (t a) (t b)

Instances

ADT1' V1

Methods

generic1' :: (Constraints1' V1 c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (V1 a) (V1 b)

ADT1' U1

Methods

generic1' :: (Constraints1' U1 c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (U1 a) (U1 b)

ADT1' Par1

Methods

generic1' :: (Constraints1' Par1 c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (Par1 a) (Par1 b)

ADT1' (Rec1 f)

Methods

generic1' :: (Constraints1' (Rec1 f) c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (Rec1 f a) (Rec1 f b)

(ADT1' f, ADT1' g) => ADT1' ((:+:) f g)

Methods

generic1' :: (Constraints1' (f :+: g) c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p ((f :+: g) a) ((f :+: g) b)

(ADT1' f, ADT1' g) => ADT1' ((:*:) f g)

Methods

generic1' :: (Constraints1' (f :*: g) c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p ((f :*: g) a) ((f :*: g) b)

ADT1' g => ADT1' ((:.:) f g)

Methods

generic1' :: (Constraints1' (f :.: g) c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p ((f :.: g) a) ((f :.: g) b)

ADT1' f => ADT1' (M1 i t f)

Methods

generic1' :: (Constraints1' (M1 i t f) c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (M1 i t f a) (M1 i t f b)

class ADTNonEmpty1' t where

Minimal complete definition

nonEmpty1'

Methods

nonEmpty1' :: (Constraints1' t c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (t a) (t b)

Instances

ADTNonEmpty1' U1

Methods

nonEmpty1' :: (Constraints1' U1 c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (U1 a) (U1 b)

ADTNonEmpty1' Par1

Methods

nonEmpty1' :: (Constraints1' Par1 c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (Par1 a) (Par1 b)

ADTNonEmpty1' (Rec1 f)

Methods

nonEmpty1' :: (Constraints1' (Rec1 f) c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (Rec1 f a) (Rec1 f b)

(ADTNonEmpty1' f, ADTNonEmpty1' g) => ADTNonEmpty1' ((:+:) f g)

Methods

nonEmpty1' :: (Constraints1' (f :+: g) c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p ((f :+: g) a) ((f :+: g) b)

(ADTNonEmpty1' f, ADTNonEmpty1' g) => ADTNonEmpty1' ((:*:) f g)

Methods

nonEmpty1' :: (Constraints1' (f :*: g) c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p ((f :*: g) a) ((f :*: g) b)

ADTNonEmpty1' g => ADTNonEmpty1' ((:.:) f g)

Methods

nonEmpty1' :: (Constraints1' (f :.: g) c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p ((f :.: g) a) ((f :.: g) b)

ADTNonEmpty1' f => ADTNonEmpty1' (M1 i t f)

Methods

nonEmpty1' :: (Constraints1' (M1 i t f) c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (M1 i t f a) (M1 i t f b)

class ADTRecord1' t where

Minimal complete definition

record1'

Methods

record1' :: (Constraints1' t c, GenericRecordProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (t a) (t b)

Instances

ADTRecord1' U1

Methods

record1' :: (Constraints1' U1 c, GenericRecordProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (U1 a) (U1 b)

ADTRecord1' Par1

Methods

record1' :: (Constraints1' Par1 c, GenericRecordProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (Par1 a) (Par1 b)

ADTRecord1' (Rec1 f)

Methods

record1' :: (Constraints1' (Rec1 f) c, GenericRecordProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (Rec1 f a) (Rec1 f b)

(ADTRecord1' f, ADTRecord1' g) => ADTRecord1' ((:*:) f g)

Methods

record1' :: (Constraints1' (f :*: g) c, GenericRecordProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p ((f :*: g) a) ((f :*: g) b)

ADTRecord1' g => ADTRecord1' ((:.:) f g)

Methods

record1' :: (Constraints1' (f :.: g) c, GenericRecordProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p ((f :.: g) a) ((f :.: g) b)

ADTRecord1' f => ADTRecord1' (M1 i t f)

Methods

record1' :: (Constraints1' (M1 i t f) c, GenericRecordProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (M1 i t f a) (M1 i t f b)

absurd :: V1 a -> b

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

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

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

class Profunctor p => GenericRecordProfunctor p where

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.

Minimal complete definition

unit, mult

Methods

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

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

Instances

GenericRecordProfunctor (->)

Methods

unit :: U1 a -> U1 a'

mult :: (f a -> f' a') -> (g a -> g' a') -> (f :*: g) a -> (f' :*: g') a'

Applicative f => GenericRecordProfunctor (Star f)

Methods

unit :: Star f (U1 a) (U1 a')

mult :: Star f (f a) (f' a') -> Star f (g a) (g' a') -> Star f ((f :*: g) a) ((f' :*: g') a')

Functor f => GenericRecordProfunctor (Costar f)

Methods

unit :: Costar f (U1 a) (U1 a')

mult :: Costar f (f a) (f' a') -> Costar f (g a) (g' a') -> Costar f ((f :*: g) a) ((f' :*: g') a')

GenericRecordProfunctor (Tagged *)

Methods

unit :: Tagged * (U1 a) (U1 a')

mult :: Tagged * (f a) (f' a') -> Tagged * (g a) (g' a') -> Tagged * ((f :*: g) a) ((f' :*: g') a')

GenericRecordProfunctor (Ctor *)

Methods

unit :: Ctor * (U1 a) (U1 a')

mult :: Ctor * (f a) (f' a') -> Ctor * (g a) (g' a') -> Ctor * ((f :*: g) a) ((f' :*: g') a')

Applicative f => GenericRecordProfunctor (Joker * * f)

Methods

unit :: Joker * * f (U1 a) (U1 a')

mult :: Joker * * f (f a) (f' a') -> Joker * * f (g a) (g' a') -> Joker * * f ((f :*: g) a) ((f' :*: g') a')

Divisible f => GenericRecordProfunctor (Clown * * f)

Methods

unit :: Clown * * f (U1 a) (U1 a')

mult :: Clown * * f (f a) (f' a') -> Clown * * f (g a) (g' a') -> Clown * * f ((f :*: g) a) ((f' :*: g') a')

(GenericRecordProfunctor p, GenericRecordProfunctor q) => GenericRecordProfunctor (Product * * p q)

Methods

unit :: Product * * p q (U1 a) (U1 a')

mult :: Product * * p q (f a) (f' a') -> Product * * p q (g a) (g' a') -> Product * * p q ((f :*: g) a) ((f' :*: g') a')

(Applicative f, GenericRecordProfunctor p) => GenericRecordProfunctor (Tannen * * * f p)

Methods

unit :: Tannen * * * f p (U1 a) (U1 a')

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

(Functor f, Applicative g) => GenericRecordProfunctor (Biff * * * * (->) f g)

Methods

unit :: Biff * * * * (->) f g (U1 a) (U1 a')

mult :: Biff * * * * (->) f g (f a) (f' a') -> Biff * * * * (->) f g (g a) (g' a') -> Biff * * * * (->) f g ((f :*: g) a) ((f' :*: g') a')

class GenericRecordProfunctor p => GenericNonEmptyProfunctor p where

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

Minimal complete definition

plus

Methods

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

Instances

GenericNonEmptyProfunctor (->)

Methods

plus :: (f a -> f' a') -> (g a -> g' a') -> (f :+: g) a -> (f' :+: g') a'

Applicative f => GenericNonEmptyProfunctor (Star f)

Methods

plus :: Star f (f a) (f' a') -> Star f (g a) (g' a') -> Star f ((f :+: g) a) ((f' :+: g') a')

GenericNonEmptyProfunctor (Ctor *)

Methods

plus :: Ctor * (f a) (f' a') -> Ctor * (g a) (g' a') -> Ctor * ((f :+: g) a) ((f' :+: g') a')

Alternative f => GenericNonEmptyProfunctor (Joker * * f)

Methods

plus :: Joker * * f (f a) (f' a') -> Joker * * f (g a) (g' a') -> Joker * * f ((f :+: g) a) ((f' :+: g') a')

Decidable f => GenericNonEmptyProfunctor (Clown * * f)

Methods

plus :: Clown * * f (f a) (f' a') -> Clown * * f (g a) (g' a') -> Clown * * f ((f :+: g) a) ((f' :+: g') a')

(GenericNonEmptyProfunctor p, GenericNonEmptyProfunctor q) => GenericNonEmptyProfunctor (Product * * p q)

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')

(Applicative f, GenericNonEmptyProfunctor p) => GenericNonEmptyProfunctor (Tannen * * * f p)

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')

class GenericNonEmptyProfunctor p => GenericProfunctor p where

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

Minimal complete definition

zero

Methods

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

Instances

GenericProfunctor (->)

Methods

zero :: V1 a -> V1 a'

Applicative f => GenericProfunctor (Star f)

Methods

zero :: Star f (V1 a) (V1 a')

GenericProfunctor (Ctor *)

Methods

zero :: Ctor * (V1 a) (V1 a')

Alternative f => GenericProfunctor (Joker * * f)

Methods

zero :: Joker * * f (V1 a) (V1 a')

Decidable f => GenericProfunctor (Clown * * f)

Methods

zero :: Clown * * f (V1 a) (V1 a')

(GenericProfunctor p, GenericProfunctor q) => GenericProfunctor (Product * * p q)

Methods

zero :: Product * * p q (V1 a) (V1 a')

(Applicative f, GenericProfunctor p) => GenericProfunctor (Tannen * * * f p)

Methods

zero :: Tannen * * * f p (V1 a) (V1 a')

data Ctor a b

Constructors

Ctor

Fields

• index :: a -> Int
• count :: Int

Instances

Profunctor (Ctor *)

Methods

dimap :: (a -> b) -> (c -> d) -> Ctor * b c -> Ctor * a d

lmap :: (a -> b) -> Ctor * b c -> Ctor * a c

rmap :: (b -> c) -> Ctor * a b -> Ctor * a c

(#.) :: Coercible * c b => (b -> c) -> Ctor * a b -> Ctor * a c

(.#) :: Coercible * b a => Ctor * b c -> (a -> b) -> Ctor * a c

GenericProfunctor (Ctor *)

Methods

zero :: Ctor * (V1 a) (V1 a')

GenericNonEmptyProfunctor (Ctor *)

Methods

plus :: Ctor * (f a) (f' a') -> Ctor * (g a) (g' a') -> Ctor * ((f :+: g) a) ((f' :+: g') a')

GenericRecordProfunctor (Ctor *)

Methods

unit :: Ctor * (U1 a) (U1 a')

mult :: Ctor * (f a) (f' a') -> Ctor * (g a) (g' a') -> Ctor * ((f :*: g) a) ((f' :*: g') a')

record :: (ADTRecord t, Constraints t c, GenericRecordProfunctor p) => for c -> (forall s. c s => p s s) -> p t t

record1 :: (ADTRecord1 t, Constraints1 t c, GenericRecordProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (t a) (t b)

nonEmpty :: (ADTNonEmpty t, Constraints t c, GenericNonEmptyProfunctor p) => for c -> (forall s. c s => p s s) -> p t t

nonEmpty1 :: (ADTNonEmpty1 t, Constraints1 t c, GenericNonEmptyProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (t a) (t b)

generic :: (ADT t, Constraints t c, GenericProfunctor p) => for c -> (forall s. c s => p s s) -> p t t

generic1 :: (ADT1 t, Constraints1 t c, GenericProfunctor p) => for c -> (forall d e s. c s => p d e -> p (s d) (s e)) -> p a b -> p (t a) (t b)

type Constraints t c = Constraints' (Rep t) c

Constraints is a constraint type synonym, containing the constraint requirements for an instance for t of class c. It requires an instance of class c for each component of t.

type Constraints1 t c = Constraints1' (Rep1 t) c

type ADTRecord t = (Generic t, ADTRecord' (Rep t), Constraints t AnyType)

ADTRecord is a constraint type synonym. An instance is an ADT with *exactly* one constructor.

type ADTRecord1 t = (Generic1 t, ADTRecord1' (Rep1 t), Constraints1 t AnyType)

type ADTNonEmpty t = (Generic t, ADTNonEmpty' (Rep t), Constraints t AnyType)

ADTNonEmpty is a constraint type synonym. An instance is an ADT with *at least* one constructor.

type ADTNonEmpty1 t = (Generic1 t, ADTNonEmpty1' (Rep1 t), Constraints1 t AnyType)

type ADT t = (Generic t, ADT' (Rep t), Constraints t AnyType)

ADT is a constraint type synonym. The Generic instance can be derived, and any generic representation will be an instance of ADT' and AnyType.

type ADT1 t = (Generic1 t, ADT1' (Rep1 t), Constraints1 t AnyType)

data For c

Tell the compiler which class we want to use in the traversal. Should be used like this:

(For :: For Show)

Where Show can be any class.

Constructors

For

ctorIndex :: ADT t => t -> Int

Get the index in the lists returned by create and createA of the constructor of the given value.

For example, this is the implementation of put that generates the binary data that the above implentation of get expects:

put t = putWord8 (toEnum (ctorIndex t)) <> gfoldMap (For :: For Binary) put t

ctorIndex1 :: ADT1 t => t a -> Int

class AnyType a

Any type is instance of AnyType, you can use it with For :: For AnyType if you don't actually need a class constraint.

Instances

AnyType k a