Generic.Applicative.Internal

Documentation

type SumKind k = (k -> Type) -> (k -> Type) -> k -> Type

The kind of a lifted binary type constructor.

Sum     :: SumKind k
Product :: SumKind k

(:+:)   :: SumKind k
(:*:)   :: SumKind k

Definition:

type SumKind :: Type -> Type
type SumKind k = (k -> Type) -> (k -> Type) -> (k -> Type)

type (~>) f g = forall x. f x -> g x

A polymorphic function / natural transformation.

Used for Applicative homomorphisms (Idiom):

idiom _ tag :: Idiom tag l r => l ~> r

Definition:

type (~>) :: (k -> Type) -> (k -> Type) -> Type
type f ~> g = forall x. f x -> g x

absurdZero :: Const Void a -> b

absurd for Const Void.

absurdZero :: Const Void a -> b
absurdZero (Const void) = absurd void

absurdV1 :: V1 a -> b

absurd for V1.

absurdV1 :: V1 a -> b
absurdV1 = case

class ConvSum (rep1 :: k -> Type) where

The first thing I do is to convert

Associated Types

type ToSum (rep1 :: k -> Type) (end :: k -> Type) :: k -> Type

Methods

convToSum :: Proxy end -> rep1 ~> ToSum rep1 end

convToSumSkip :: end ~> ToSum rep1 end

convFromSum :: ToSum rep1 end a -> (rep1 a -> res) -> (end a -> res) -> res

Instances

ConvSum (V1 :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToSum V1 end :: k -> Type

Methods

convToSum :: forall (end :: k0 -> Type). Proxy end -> V1 ~> ToSum V1 end

convToSumSkip :: forall (end :: k0 -> Type). end ~> ToSum V1 end

convFromSum :: forall end (a :: k0) res. ToSum V1 end a -> (V1 a -> res) -> (end a -> res) -> res

ConvSum rep1 => ConvSum (D1 meta rep1 :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToSum (D1 meta rep1) end :: k -> Type

Methods

convToSum :: forall (end :: k0 -> Type). Proxy end -> D1 meta rep1 ~> ToSum (D1 meta rep1) end

convToSumSkip :: forall (end :: k0 -> Type). end ~> ToSum (D1 meta rep1) end

convFromSum :: forall end (a :: k0) res. ToSum (D1 meta rep1) end a -> (D1 meta rep1 a -> res) -> (end a -> res) -> res

(ConvSum rep1, ConvSum rep1') => ConvSum (rep1 :+: rep1' :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToSum (rep1 :+: rep1') end :: k -> Type

Methods

convToSum :: forall (end :: k0 -> Type). Proxy end -> (rep1 :+: rep1') ~> ToSum (rep1 :+: rep1') end

convToSumSkip :: forall (end :: k0 -> Type). end ~> ToSum (rep1 :+: rep1') end

convFromSum :: forall end (a :: k0) res. ToSum (rep1 :+: rep1') end a -> ((rep1 :+: rep1') a -> res) -> (end a -> res) -> res

ConvProduct rep1 => ConvSum (C1 meta rep1 :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToSum (C1 meta rep1) end :: k -> Type

Methods

convToSum :: forall (end :: k0 -> Type). Proxy end -> C1 meta rep1 ~> ToSum (C1 meta rep1) end

convToSumSkip :: forall (end :: k0 -> Type). end ~> ToSum (C1 meta rep1) end

convFromSum :: forall end (a :: k0) res. ToSum (C1 meta rep1) end a -> (C1 meta rep1 a -> res) -> (end a -> res) -> res

class ConvProduct (rep1 :: k -> Type) where

Associated Types

type ToProduct (rep1 :: k -> Type) (end :: k -> Type) :: k -> Type

Methods

convToProduct :: rep1 a -> end a -> ToProduct rep1 end a

convFromProduct :: ToProduct rep1 end a -> (rep1 a -> end a -> res) -> res

Instances

ConvProduct (U1 :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToProduct U1 end :: k -> Type

Methods

convToProduct :: forall (a :: k0) end. U1 a -> end a -> ToProduct U1 end a

convFromProduct :: forall end (a :: k0) res. ToProduct U1 end a -> (U1 a -> end a -> res) -> res

(ConvProduct rep1, ConvProduct rep1') => ConvProduct (rep1 :*: rep1' :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToProduct (rep1 :*: rep1') end :: k -> Type

Methods

convToProduct :: forall (a :: k0) end. (rep1 :*: rep1') a -> end a -> ToProduct (rep1 :*: rep1') end a

convFromProduct :: forall end (a :: k0) res. ToProduct (rep1 :*: rep1') end a -> ((rep1 :*: rep1') a -> end a -> res) -> res

ConvField rep1 => ConvProduct (S1 meta rep1 :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToProduct (S1 meta rep1) end :: k -> Type

Methods

convToProduct :: forall (a :: k0) end. S1 meta rep1 a -> end a -> ToProduct (S1 meta rep1) end a

convFromProduct :: forall end (a :: k0) res. ToProduct (S1 meta rep1) end a -> (S1 meta rep1 a -> end a -> res) -> res

class ConvField (rep1 :: k -> Type) where

Minimal complete definition

Nothing

Associated Types

type ToField (rep1 :: k -> Type) :: k -> Type

Methods

convToField :: rep1 ~> ToField rep1

default convToField :: Coercible (rep1 a) (ToField rep1 a) => rep1 a -> ToField rep1 a

convFromField :: ToField rep1 ~> rep1

default convFromField :: Coercible (ToField rep1 a) (rep1 a) => ToField rep1 a -> rep1 a

Instances

ConvField (Rec1 f :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToField (Rec1 f) :: k -> Type

Methods

convToField :: Rec1 f ~> ToField (Rec1 f)

convFromField :: ToField (Rec1 f) ~> Rec1 f

ConvField (K1 tag a :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToField (K1 tag a) :: k -> Type

Methods

convToField :: K1 tag a ~> ToField (K1 tag a)

convFromField :: ToField (K1 tag a) ~> K1 tag a

(Functor rep1, ConvField rep1') => ConvField (rep1 :.: rep1' :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type ToField (rep1 :.: rep1') :: k -> Type

Methods

convToField :: (rep1 :.: rep1') ~> ToField (rep1 :.: rep1')

convFromField :: ToField (rep1 :.: rep1') ~> (rep1 :.: rep1')

ConvField Par1

Defined in Generic.Applicative.Internal

Associated Types

type ToField Par1 :: k -> Type

Methods

convToField :: Par1 ~> ToField Par1

convFromField :: ToField Par1 ~> Par1

data SumTag

Constructors

RightZero

NormalSum

NotSum

type family CheckSum rep1 where ...

Equations

CheckSum (Sum rep1 (Const Void)) = 'RightZero

CheckSum (Sum rep1 rep') = 'NormalSum

CheckSum rep = 'NotSum

type BæSum rep1 = BæSum_ (CheckSum rep1) rep1

type ConvBæSum rep1 = ConvBæSum_ (CheckSum rep1) rep1

class CheckSum rep1 ~ tag => ConvBæSum_ tag (rep1 :: k -> Type) where

Associated Types

type BæSum_ tag (rep1 :: k -> Type) :: k -> Type

Methods

convBæSum :: rep1 ~> BæSum rep1

convHæSum :: BæSum rep1 ~> rep1

Instances

CheckSum rep1 ~ 'NotSum => ConvBæSum_ 'NotSum (rep1 :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type BæSum_ 'NotSum rep1 :: k -> Type

Methods

convBæSum :: rep1 ~> BæSum rep1

convHæSum :: BæSum rep1 ~> rep1

(CheckSum (Sum rep1 rep1') ~ 'NormalSum, ConvBæProduct rep1, ConvBæSum rep1') => ConvBæSum_ 'NormalSum (Sum rep1 rep1' :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type BæSum_ 'NormalSum (Sum rep1 rep1') :: k -> Type

Methods

convBæSum :: Sum rep1 rep1' ~> BæSum (Sum rep1 rep1')

convHæSum :: BæSum (Sum rep1 rep1') ~> Sum rep1 rep1'

(ConvBæProduct rep1, CheckSum (Sum rep1 (Const Void :: k -> Type)) ~ 'RightZero, void ~ Void) => ConvBæSum_ 'RightZero (Sum rep1 (Const void :: k -> Type) :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type BæSum_ 'RightZero (Sum rep1 (Const void)) :: k -> Type

Methods

convBæSum :: Sum rep1 (Const void) ~> BæSum (Sum rep1 (Const void))

convHæSum :: BæSum (Sum rep1 (Const void)) ~> Sum rep1 (Const void)

data ProductTag

Constructors

RightOne

NormalProduct

NotProduct

type family CheckProduct rep1 where ...

Equations

CheckProduct (Product rep1 (Const ())) = 'RightOne

CheckProduct (Product rep1 rep') = 'NormalProduct

CheckProduct rep = 'NotProduct

type BæProduct rep1 = BæProduct_ (CheckProduct rep1) rep1

type ConvBæProduct rep1 = ConvBæProduct_ (CheckProduct rep1) rep1

class tag ~ CheckProduct rep1 => ConvBæProduct_ tag (rep1 :: k -> Type) where

Associated Types

type BæProduct_ tag (rep1 :: k -> Type) :: k -> Type

Methods

convBæProduct :: rep1 ~> BæProduct rep1

convHæProduct :: BæProduct rep1 ~> rep1

Instances

CheckProduct rep1 ~ 'NotProduct => ConvBæProduct_ 'NotProduct (rep1 :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type BæProduct_ 'NotProduct rep1 :: k -> Type

Methods

convBæProduct :: rep1 ~> BæProduct rep1

convHæProduct :: BæProduct rep1 ~> rep1

unit ~ () => ConvBæProduct_ 'RightOne (Product rep1 (Const unit :: k -> Type) :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type BæProduct_ 'RightOne (Product rep1 (Const unit)) :: k -> Type

Methods

convBæProduct :: Product rep1 (Const unit) ~> BæProduct (Product rep1 (Const unit))

convHæProduct :: BæProduct (Product rep1 (Const unit)) ~> Product rep1 (Const unit)

(CheckProduct (Product rep1 rep1') ~ 'NormalProduct, ConvBæProduct rep1') => ConvBæProduct_ 'NormalProduct (Product rep1 rep1' :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type BæProduct_ 'NormalProduct (Product rep1 rep1') :: k -> Type

Methods

convBæProduct :: Product rep1 rep1' ~> BæProduct (Product rep1 rep1')

convHæProduct :: BæProduct (Product rep1 rep1') ~> Product rep1 rep1'

type Flatten rep1 = ToSum rep1 (Const Void)

flatten :: ConvSum rep1 => rep1 ~> Flatten rep1

Flattens a generic representation.

Afaik GHC is free to nest the generic representation however it fancies. The representation of data A a = A a a a a is for example

@ Rep1 A = (Par1 :+: Par1) :+: (Par1 :+: Par1) -- without metadata

nest :: ConvSum rep1 => Flatten rep1 a -> rep1 a

type family ReplaceSums sums rep1 where ...

Equations

ReplaceSums (sum ': sums) (Sum rep1 rep1') = rep1 `sum` ReplaceSums sums rep1'

ReplaceSums '[] rep1 = rep1

replaceSums :: forall sums rep1. rep1 ~> ReplaceSums sums rep1

This is actually not safe and causes a segfault.

placeSums :: forall sums rep1. ReplaceSums sums rep1 ~> rep1

newtype NewSums sums f a

Constructors

NewSums

Fields

• reduce :: f a

Instances

(Generic1 f, ConvBæSum_ (CheckSum (ToSum (Rep1 f) (Const Void :: k -> Type))) (ToSum (Rep1 f) (Const Void :: k -> Type)), ConvSum (Rep1 f)) => Generic1 (NewSums sums f :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type Rep1 (NewSums sums f) :: k -> Type

Methods

from1 :: forall (a :: k0). NewSums sums f a -> Rep1 (NewSums sums f) a

to1 :: forall (a :: k0). Rep1 (NewSums sums f) a -> NewSums sums f a

type Rep1 (NewSums sums f :: k -> Type)

Defined in Generic.Applicative.Internal

type Rep1 (NewSums sums f :: k -> Type) = ReplaceSums sums (BæSum_ (CheckSum (ToSum (Rep1 f) (Const Void :: k -> Type))) (ToSum (Rep1 f) (Const Void :: k -> Type)))

newtype Generically1 f a

This exists in versions that don't have Generically1, i.e. before base 4.17.0.0.

Constructors

Generically1 (f a)

Instances

Generic1 f => Generic1 (Generically1 f :: k -> Type)

Defined in Generic.Applicative.Internal

Associated Types

type Rep1 (Generically1 f) :: k -> Type

Methods

from1 :: forall (a :: k0). Generically1 f a -> Rep1 (Generically1 f) a

to1 :: forall (a :: k0). Rep1 (Generically1 f) a -> Generically1 f a

(Generic1 f, Functor (Rep1 f)) => Functor (Generically1 f)

Defined in Generic.Applicative.Internal

Methods

fmap :: (a -> b) -> Generically1 f a -> Generically1 f b

(<$) :: a -> Generically1 f b -> Generically1 f a

(Generic1 f, Applicative (Rep1 f)) => Applicative (Generically1 f)

Defined in Generic.Applicative.Internal

Methods

pure :: a -> Generically1 f a

(<*>) :: Generically1 f (a -> b) -> Generically1 f a -> Generically1 f b

liftA2 :: (a -> b -> c) -> Generically1 f a -> Generically1 f b -> Generically1 f c

(*>) :: Generically1 f a -> Generically1 f b -> Generically1 f b

(<*) :: Generically1 f a -> Generically1 f b -> Generically1 f a

type Rep1 (Generically1 f :: k -> Type)

Defined in Generic.Applicative.Internal

type Rep1 (Generically1 f :: k -> Type) = Rep1 f