-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/

-- | Generically derive traversals, lenses and prisms.
--   
--   This library uses GHC.Generics to derive efficient optics (traversals,
--   lenses and prisms) for algebraic data types in a type-directed way,
--   with a focus on good type inference and error messages when possible.
--   
--   This package is the shared internal logic of the
--   generic-lens and generic-optics
--   libraries.
@package generic-lens-core
@version 2.2.1.0

module Data.Generics.Internal.Errors
type family NoGeneric a (ctxt :: [ErrorMessage])
type family Defined (break :: Type -> Type) err (a :: k) :: k
type family Defined_list (break :: [Type]) err (a :: k) :: k
type family QuoteType (typ :: k) :: ErrorMessage
type family PrettyError (ctxt :: [ErrorMessage]) :: k

module Data.Generics.Internal.Families.Changing
type Indexed (t :: k) = Indexed' t 0
type family Infer s a' b
data PTag
PTag :: PTag
type family P :: Nat -> k -> PTag -> k
type family LookupParam (a :: k) (p :: Nat) :: Maybe Nat
type family ArgAt (t :: k) (n :: Nat) :: j
type family ArgCount (t :: k) :: Nat

-- | Ensure that the types a and b are both applications
--   of the same constructor. The arguments may be different.
class UnifyHead (a :: k) (b :: k)
instance forall k1 k2 (gb :: k1) (g :: k2 -> k1) (b :: k2) (f :: k2 -> k1) (a :: k2). (gb GHC.Types.~ g b, Data.Generics.Internal.Families.Changing.UnifyHead f g) => Data.Generics.Internal.Families.Changing.UnifyHead (f a) gb
instance forall k (a :: k) (b :: k). (a GHC.Types.~ b) => Data.Generics.Internal.Families.Changing.UnifyHead a b

module Data.Generics.Internal.Void
data Void
data Void1 (a :: k)
data Void2 (a :: k) (b :: k1)

module Data.Generics.Internal.Wrapped
type Context s t a b = (Generic s, Generic t, GWrapped Rep s Rep t a b, UnifyHead s t, UnifyHead t s, ErrorUnlessOnlyOne s Rep s)
derived :: Context s t a b => Iso s t a b
instance (a GHC.Types.~ c, b GHC.Types.~ d) => Data.Generics.Internal.Wrapped.GWrapped (GHC.Internal.Generics.K1 i a) (GHC.Internal.Generics.K1 i b) c d
instance Data.Generics.Internal.Wrapped.GWrapped s t a b => Data.Generics.Internal.Wrapped.GWrapped (GHC.Internal.Generics.M1 i k s) (GHC.Internal.Generics.M1 i k t) a b

-- | Derive record field getters and setters generically.
module Data.Generics.Product.Internal.GLens
class GLens (pred :: Pred) (s :: Type -> Type) (t :: Type -> Type) a b | s pred -> a, t pred -> b
glens :: GLens pred s t a b => Lens (s x) (t x) a b
type GLens' (pred :: Pred) (s :: Type -> Type) a = GLens pred s s a a
type TyFun a b = a -> b -> Type
type family Eval (f :: TyFun a b) (x :: a) :: b
instance Data.Generics.Product.Internal.GLens.GProductLens (Data.Generics.Product.Internal.GLens.Eval pred l) pred l r l' r' a b => Data.Generics.Product.Internal.GLens.GLens pred (l GHC.Internal.Generics.:*: r) (l' GHC.Internal.Generics.:*: r') a b
instance (Data.Generics.Product.Internal.GLens.GLens pred l l' a b, Data.Generics.Product.Internal.GLens.GLens pred r r' a b) => Data.Generics.Product.Internal.GLens.GLens pred (l GHC.Internal.Generics.:+: r) (l' GHC.Internal.Generics.:+: r') a b
instance Data.Generics.Product.Internal.GLens.GLens pred (GHC.Internal.Generics.K1 r a) (GHC.Internal.Generics.K1 r b) a b
instance Data.Generics.Product.Internal.GLens.GLens pred f g a b => Data.Generics.Product.Internal.GLens.GLens pred (GHC.Internal.Generics.M1 m meta f) (GHC.Internal.Generics.M1 m meta g) a b
instance Data.Generics.Product.Internal.GLens.GLens pred l l' a b => Data.Generics.Product.Internal.GLens.GProductLens ('GHC.Internal.Maybe.Just x) pred l r l' r a b
instance Data.Generics.Product.Internal.GLens.GLens pred r r' a b => Data.Generics.Product.Internal.GLens.GProductLens 'GHC.Internal.Maybe.Nothing pred l r l r' a b

-- | Derive an isomorphism between a product type and a flat HList.
module Data.Generics.Product.Internal.HList
class GIsList (f :: Type -> Type) (g :: Type -> Type) (as :: [Type]) (bs :: [Type]) | f -> as, g -> bs, bs f -> g, as g -> f
glist :: GIsList f g as bs => Iso (f x) (g x) (HList as) (HList bs)
class IndexList (i :: Nat) (as :: [Type]) (bs :: [Type]) a b | i as -> a, i bs -> b, i as b -> bs, i bs a -> as
point :: IndexList i as bs a b => Lens (HList as) (HList bs) a b
data HList (as :: [Type])
[Nil] :: HList ('[] :: [Type])
[:>] :: forall a (as1 :: [Type]). a -> HList as1 -> HList (a ': as1)
infixr 5 :>
type family (as :: [k]) ++ (bs :: [k]) :: [k]
class Elem (as :: [(k1, Type)]) (key :: k1) (i :: Nat) (a :: k) | as key -> i a
class ListTuple tuple tuple' (as :: [Type]) (bs :: [Type]) | as -> tuple, bs -> tuple'
tupled :: ListTuple tuple tuple' as bs => Iso (HList as) (HList bs) tuple tuple'
tupleToList :: ListTuple tuple tuple' as bs => tuple' -> HList bs
listToTuple :: ListTuple tuple tuple' as bs => HList as -> tuple
type family TupleToList a :: [Type]
instance Data.Generics.Product.Internal.HList.Appending as bs cs as' bs' cs' => Data.Generics.Product.Internal.HList.Appending (a : as) bs (a : cs) (a' : as') bs' (a' : cs')
instance Data.Generics.Product.Internal.HList.Appending '[] bs bs '[] bs' bs'
instance forall k (pos :: GHC.Num.Natural.Natural) (a :: (k, *)) (xs :: [(k, *)]) (key :: k). (pos GHC.Types.~ 0) => Data.Generics.Product.Internal.HList.Elem (a : xs) key pos a
instance forall k1 k2 (xs :: [(k1, *)]) (key :: k1) (i :: GHC.Internal.TypeNats.Nat) (a :: k2) (pos :: GHC.Num.Natural.Natural) (x :: (k1, *)). (Data.Generics.Product.Internal.HList.Elem xs key i a, pos GHC.Types.~ (i GHC.Internal.TypeNats.+ 1)) => Data.Generics.Product.Internal.HList.Elem (x : xs) key pos a
instance (Data.Generics.Product.Internal.HList.GIsList l l' as as', Data.Generics.Product.Internal.HList.GIsList r r' bs bs', Data.Generics.Product.Internal.HList.Appending as bs cs as' bs' cs', cs GHC.Types.~ (as Data.Generics.Product.Internal.HList.++ bs), cs' GHC.Types.~ (as' Data.Generics.Product.Internal.HList.++ bs')) => Data.Generics.Product.Internal.HList.GIsList (l GHC.Internal.Generics.:*: r) (l' GHC.Internal.Generics.:*: r') cs cs'
instance Data.Generics.Product.Internal.HList.GIsList (GHC.Internal.Generics.Rec0 a) (GHC.Internal.Generics.Rec0 b) '[a] '[b]
instance Data.Generics.Product.Internal.HList.GIsList f g as bs => Data.Generics.Product.Internal.HList.GIsList (GHC.Internal.Generics.M1 t meta f) (GHC.Internal.Generics.M1 t meta g) as bs
instance Data.Generics.Product.Internal.HList.GIsList GHC.Internal.Generics.U1 GHC.Internal.Generics.U1 '[] '[]
instance (Data.Generics.Product.Internal.HList.IndexList (n GHC.Internal.TypeNats.- 1) as' bs' a b, as GHC.Types.~ (x : as'), bs GHC.Types.~ (x : bs')) => Data.Generics.Product.Internal.HList.IndexList n as bs a b
instance (as GHC.Types.~ (a : as'), bs GHC.Types.~ (b : as')) => Data.Generics.Product.Internal.HList.IndexList 0 as bs a b
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1, p1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2, p2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1, p1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2, p2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1, p1, q1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2, p2, q2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1, p1, q1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2, p2, q2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1, p1, q1, r1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2, p2, q2, r2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1, p1, q1, r1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2, p2, q2, r2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1, p1, q1, r1, s1) (a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2, p2, q2, r2, s2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1, k1, l1, m1, n1, o1, p1, q1, r1, s1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2, k2, l2, m2, n2, o2, p2, q2, r2, s2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1) (a2, b2) '[a1, b1] '[a2, b2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1) (a2, b2, c2) '[a1, b1, c1] '[a2, b2, c2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1) (a2, b2, c2, d2) '[a1, b1, c1, d1] '[a2, b2, c2, d2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1) (a2, b2, c2, d2, e2) '[a1, b1, c1, d1, e1] '[a2, b2, c2, d2, e2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1) (a2, b2, c2, d2, e2, f2) '[a1, b1, c1, d1, e1, f1] '[a2, b2, c2, d2, e2, f2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1) (a2, b2, c2, d2, e2, f2, g2) '[a1, b1, c1, d1, e1, f1, g1] '[a2, b2, c2, d2, e2, f2, g2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1) (a2, b2, c2, d2, e2, f2, g2, h2) '[a1, b1, c1, d1, e1, f1, g1, h1] '[a2, b2, c2, d2, e2, f2, g2, h2]
instance Data.Generics.Product.Internal.HList.ListTuple (a1, b1, c1, d1, e1, f1, g1, h1, j1) (a2, b2, c2, d2, e2, f2, g2, h2, j2) '[a1, b1, c1, d1, e1, f1, g1, h1, j1] '[a2, b2, c2, d2, e2, f2, g2, h2, j2]
instance Data.Generics.Product.Internal.HList.ListTuple () () '[] '[]
instance Data.Generics.Product.Internal.HList.ListTuple a a' '[a] '[a']
instance GHC.Internal.Base.Monoid (Data.Generics.Product.Internal.HList.HList '[])
instance (GHC.Internal.Base.Monoid a, GHC.Internal.Base.Monoid (Data.Generics.Product.Internal.HList.HList as)) => GHC.Internal.Base.Monoid (Data.Generics.Product.Internal.HList.HList (a : as))
instance GHC.Internal.Base.Semigroup (Data.Generics.Product.Internal.HList.HList '[])
instance (GHC.Internal.Base.Semigroup a, GHC.Internal.Base.Semigroup (Data.Generics.Product.Internal.HList.HList as)) => GHC.Internal.Base.Semigroup (Data.Generics.Product.Internal.HList.HList (a : as))

module Data.Generics.Internal.Families.Has
type family HasTotalFieldP (field :: Symbol) (f :: k -> Type) :: Maybe Type
type family HasTotalTypeP typ (f :: k -> Type) :: Maybe Type
type family HasTotalPositionP (pos :: Nat) (f :: k -> Type) :: Maybe Type
data Pos (p :: Nat)
type family HasPartialTypeP (a :: [Type]) (f :: Type -> Type) :: Bool
type family HasCtorP (ctor :: Symbol) (f :: k -> Type) :: Bool
type family GTypes (rep :: Type -> Type) :: [Type]

module Data.Generics.Internal.Families.Collect
type family CollectTotalType t (f :: k -> Type) :: TypeStat
type family CollectPartialType (t :: [Type]) (f :: Type -> Type) :: [Symbol]
type family CollectField (t :: Symbol) (f :: k -> Type) :: TypeStat
type family CollectFieldsOrdered (r :: Type -> Type) :: [Symbol]
data TypeStat
TypeStat :: [Symbol] -> [Symbol] -> [Symbol] -> TypeStat
[_containsNone] :: TypeStat -> [Symbol]
[_containsMultiple] :: TypeStat -> [Symbol]
[_containsOne] :: TypeStat -> [Symbol]
type family (xs :: [Symbol]) \\ (ys :: [Symbol]) :: [Symbol]
infixr 5 \\

module Data.Generics.Internal.Families
type family ShowSymbols (ctors :: [Symbol]) :: ErrorMessage

module Data.Generics.Product.Internal.Fields
type Context_ (field :: Symbol) s t a b = (HasTotalFieldP field Rep s ~ 'Just a, HasTotalFieldP field Rep t ~ 'Just b, UnifyHead s t, UnifyHead t s)
type Context' (field :: Symbol) s a = (Generic s, ErrorUnless field s CollectField field Rep s, GLens' HasTotalFieldPSym field Rep s a, Defined Rep s NoGeneric s '[ 'Text "arising from a generic lens focusing on the " ':<>: QuoteType field ':<>: 'Text " field of type " ':<>: QuoteType a, 'Text "in " ':<>: QuoteType s] ())
type Context0 (field :: Symbol) s t a b = (Generic s, Generic t, GLens HasTotalFieldPSym field Rep s Rep t a b, ErrorUnless field s CollectField field Rep s, Defined Rep s NoGeneric s '[ 'Text "arising from a generic lens focusing on the " ':<>: QuoteType field ':<>: 'Text " field of type " ':<>: QuoteType a, 'Text "in " ':<>: QuoteType s] ())
class Context (field :: Symbol) (s :: k) (t :: k1) (a :: k2) (b :: k3) | s field -> a, t field -> b, s field b -> t, t field a -> s
derived :: forall (field :: Symbol) s t a b. Context0 field s t a b => Lens s t a b
instance (Data.Generics.Internal.Families.Has.HasTotalFieldP field (GHC.Internal.Generics.Rep s) GHC.Types.~ 'GHC.Internal.Maybe.Just a, Data.Generics.Internal.Families.Has.HasTotalFieldP field (GHC.Internal.Generics.Rep t) GHC.Types.~ 'GHC.Internal.Maybe.Just b, Data.Generics.Internal.Families.Has.HasTotalFieldP field (GHC.Internal.Generics.Rep (Data.Generics.Internal.Families.Changing.Indexed s)) GHC.Types.~ 'GHC.Internal.Maybe.Just a', Data.Generics.Internal.Families.Has.HasTotalFieldP field (GHC.Internal.Generics.Rep (Data.Generics.Internal.Families.Changing.Indexed t)) GHC.Types.~ 'GHC.Internal.Maybe.Just b', t GHC.Types.~ Data.Generics.Internal.Families.Changing.Infer s a' b, s GHC.Types.~ Data.Generics.Internal.Families.Changing.Infer t b' a) => Data.Generics.Product.Internal.Fields.Context field s t a b

-- | Derive positional product type getters and setters generically.
module Data.Generics.Product.Internal.Positions
type (x :: k) <? (y :: k) = Not y <=? x
infixl 4 <?
type family Size (f :: k -> Type) :: Nat

-- | In-order labeling of the generic tree with the field positions
--   
--   We replace the (K1 R a) nodes with (K1 (Pos n) a), where n is
--   the position of the field in question in the data type. This is
--   convenient, because we can reuse all the existing functions as long as
--   they are polymorphic in the first parameter of K1.
type family CRep a :: G
class Context (i :: Nat) (s :: k) (t :: k1) (a :: k2) (b :: k3) | s i -> a, t i -> b, s i b -> t, t i a -> s
type Context_ (i :: Nat) s t (a :: k) (b :: k1) = (ErrorUnless i s 0 <? i && i <=? Size Rep s, UnifyHead s t, UnifyHead t s)
type Context' (i :: Nat) s a = (Generic s, ErrorUnless i s 0 <? i && i <=? Size Rep s, Coercible Rep s CRep s, GLens' HasTotalPositionPSym i CRep s a, Defined Rep s NoGeneric s '[ 'Text "arising from a generic lens focusing on the field at", 'Text "position " ':<>: QuoteType i ':<>: 'Text " of type " ':<>: QuoteType a ':<>: 'Text " in " ':<>: QuoteType s] ())
type Context0 (i :: Nat) s t a b = (Generic s, Generic t, GLens HasTotalPositionPSym i CRep s CRep t a b, Coercible CRep s Rep s, Coercible CRep t Rep t, Defined Rep s NoGeneric s '[ 'Text "arising from a generic lens focusing on the field at", 'Text "position " ':<>: QuoteType i ':<>: 'Text " of type " ':<>: QuoteType a ':<>: 'Text " in " ':<>: QuoteType s] ())
derived0 :: forall (i :: Nat) s t a b. Context0 i s t a b => Lens s t a b
derived' :: forall (i :: Nat) s a. Context' i s a => Lens s s a a
instance (Data.Generics.Product.Internal.Positions.ErrorUnless i s ((0 Data.Generics.Product.Internal.Positions.<? i) GHC.Internal.Data.Type.Bool.&& (i GHC.Internal.Data.Type.Ord.<=? Data.Generics.Product.Internal.Positions.Size (GHC.Internal.Generics.Rep s))), Data.Generics.Internal.Families.Has.HasTotalPositionP i (Data.Generics.Product.Internal.Positions.CRep s) GHC.Types.~ 'GHC.Internal.Maybe.Just a, Data.Generics.Internal.Families.Has.HasTotalPositionP i (Data.Generics.Product.Internal.Positions.CRep t) GHC.Types.~ 'GHC.Internal.Maybe.Just b, Data.Generics.Internal.Families.Has.HasTotalPositionP i (Data.Generics.Product.Internal.Positions.CRep (Data.Generics.Internal.Families.Changing.Indexed s)) GHC.Types.~ 'GHC.Internal.Maybe.Just a', Data.Generics.Internal.Families.Has.HasTotalPositionP i (Data.Generics.Product.Internal.Positions.CRep (Data.Generics.Internal.Families.Changing.Indexed t)) GHC.Types.~ 'GHC.Internal.Maybe.Just b', t GHC.Types.~ Data.Generics.Internal.Families.Changing.Infer s a' b, s GHC.Types.~ Data.Generics.Internal.Families.Changing.Infer t b' a) => Data.Generics.Product.Internal.Positions.Context i s t a b

-- | Structural subtype relationships between product types.
module Data.Generics.Product.Internal.Subtype
type Context a b = (Generic a, Generic b, GSmash Rep a Rep b, GUpcast Rep a Rep b, CustomError a b)
class GSmash (sub :: k -> Type) (sup :: k -> Type)
gsmash :: forall (p :: k). GSmash sub sup => sup p -> sub p -> sub p
class GUpcast (sub :: Type -> Type) (sup :: Type -> Type)
gupcast :: GUpcast sub sup => sub p -> sup p
instance Data.Generics.Product.Internal.GLens.GLens' (Data.Generics.Product.Internal.Subtype.HasTotalFieldPSym field) sup t => Data.Generics.Product.Internal.Subtype.GSmashLeaf (GHC.Internal.Generics.S1 ('GHC.Internal.Generics.MetaSel ('GHC.Internal.Maybe.Just field) p f b) (GHC.Internal.Generics.Rec0 t)) sup ('GHC.Internal.Maybe.Just t)
instance forall k (field :: GHC.Types.Symbol) (p :: GHC.Internal.Generics.SourceUnpackedness) (f :: GHC.Internal.Generics.SourceStrictness) (b :: GHC.Internal.Generics.DecidedStrictness) t (sup :: k -> *). Data.Generics.Product.Internal.Subtype.GSmashLeaf (GHC.Internal.Generics.S1 ('GHC.Internal.Generics.MetaSel ('GHC.Internal.Maybe.Just field) p f b) (GHC.Internal.Generics.Rec0 t)) sup 'GHC.Internal.Maybe.Nothing
instance forall k (a :: k -> *) (sup :: k -> *) (b :: k -> *). (Data.Generics.Product.Internal.Subtype.GSmash a sup, Data.Generics.Product.Internal.Subtype.GSmash b sup) => Data.Generics.Product.Internal.Subtype.GSmash (a GHC.Internal.Generics.:*: b) sup
instance forall k (leaf :: k -> *) (field :: GHC.Types.Symbol) (p :: GHC.Internal.Generics.SourceUnpackedness) (f :: GHC.Internal.Generics.SourceStrictness) (b :: GHC.Internal.Generics.DecidedStrictness) (t :: k -> *) (sup :: k -> *). (leaf GHC.Types.~ GHC.Internal.Generics.S1 ('GHC.Internal.Generics.MetaSel ('GHC.Internal.Maybe.Just field) p f b) t, Data.Generics.Product.Internal.Subtype.GSmashLeaf leaf sup (Data.Generics.Internal.Families.Has.HasTotalFieldP field sup)) => Data.Generics.Product.Internal.Subtype.GSmash (GHC.Internal.Generics.S1 ('GHC.Internal.Generics.MetaSel ('GHC.Internal.Maybe.Just field) p f b) t) sup
instance forall k (sub :: k -> *) (sup :: k -> *) (c :: GHC.Internal.Generics.Meta). Data.Generics.Product.Internal.Subtype.GSmash sub sup => Data.Generics.Product.Internal.Subtype.GSmash (GHC.Internal.Generics.C1 c sub) sup
instance forall k (sub :: k -> *) (sup :: k -> *) (c :: GHC.Internal.Generics.Meta). Data.Generics.Product.Internal.Subtype.GSmash sub sup => Data.Generics.Product.Internal.Subtype.GSmash (GHC.Internal.Generics.D1 c sub) sup
instance (Data.Generics.Product.Internal.Subtype.GUpcast sub a, Data.Generics.Product.Internal.Subtype.GUpcast sub b) => Data.Generics.Product.Internal.Subtype.GUpcast sub (a GHC.Internal.Generics.:*: b)
instance Data.Generics.Product.Internal.GLens.GLens' (Data.Generics.Product.Internal.Subtype.HasTotalFieldPSym field) sub t => Data.Generics.Product.Internal.Subtype.GUpcast sub (GHC.Internal.Generics.S1 ('GHC.Internal.Generics.MetaSel ('GHC.Internal.Maybe.Just field) p f b) (GHC.Internal.Generics.Rec0 t))
instance Data.Generics.Product.Internal.Subtype.GUpcast sub sup => Data.Generics.Product.Internal.Subtype.GUpcast sub (GHC.Internal.Generics.C1 c sup)
instance Data.Generics.Product.Internal.Subtype.GUpcast sub sup => Data.Generics.Product.Internal.Subtype.GUpcast sub (GHC.Internal.Generics.D1 c sup)

-- | The library internals are exposed through this module. Please keep in
--   mind that everything here is subject to change irrespective of the the
--   version numbers.
module Data.GenericLens.Internal
data family Param :: Nat -> j -> k
class (Coercible Rep a RepN a, Generic a) => GenericN a where {
    type RepN a :: Type -> Type;
    type RepN a = Rep Indexed a 0;
}
toN :: GenericN a => RepN a x -> a
fromN :: GenericN a => a -> RepN a x
newtype Rec p a (x :: k)
Rec :: K1 R a x -> Rec p a (x :: k)
[unRec] :: Rec p a (x :: k) -> K1 R a x
type family RepN a :: Type -> Type
type Iso s t a b = forall (p :: Type -> Type -> Type -> Type) i. Profunctor p => p i a b -> p i s t

-- | A type and its generic representation are isomorphic
repIso :: (Generic a, Generic b) => Iso a b (Rep a x) (Rep b x)
kIso :: forall r a p1 b p2 i. Profunctor p2 => p2 i a b -> p2 i (K1 r a p1) (K1 r b p1)
sumIso :: forall a b x a' b' p i. Profunctor p => p i (Either (a x) (b x)) (Either (a' x) (b' x)) -> p i ((a :+: b) x) ((a' :+: b') x)

-- | M1 is just a wrapper around `f p` mIso :: Iso' (M1 i c f p) (f
--   p)
mIso :: forall i1 (c :: Meta) f p1 g p2 i2. Profunctor p2 => p2 i2 (f p1) (g p1) -> p2 i2 (M1 i1 c f p1) (M1 i1 c g p1)
type Iso' s a = Iso s s a a
iso :: (s -> a) -> (b -> t) -> Iso s t a b
recIso :: forall r a p1 b p2 i. Profunctor p2 => p2 i a b -> p2 i (Rec r a p1) (Rec r b p1)
prodIso :: forall a b x a' b' p i. Profunctor p => p i (a x, b x) (a' x, b' x) -> p i ((a :*: b) x) ((a' :*: b') x)
assoc3 :: forall a b c a' b' c' p i. Profunctor p => p i (a, (b, c)) (a', (b', c')) -> p i ((a, b), c) ((a', b'), c')
fromIso :: Iso s t a b -> Iso b a t s
withIso :: Iso s t a b -> ((s -> a) -> (b -> t) -> r) -> r
pairing :: Iso s t a b -> Iso s' t' a' b' -> Iso (s, s') (t, t') (a, a') (b, b')

-- | Lens focusing on the first element of a product
first :: forall a (b :: Type -> Type) x a' p i. Strong p => p i (a x) (a' x) -> p i ((a :*: b) x) ((a' :*: b) x)
swap :: (a, b) -> (b, a)

-- | Lens focusing on the second element of a product
second :: forall (a :: Type -> Type) b x b' p i. Strong p => p i (b x) (b' x) -> p i ((a :*: b) x) ((a :*: b') x)
type Lens s t a b = forall (p :: Type -> Type -> Type -> Type) i. Strong p => p i a b -> p i s t
choosing :: Lens s t a b -> Lens s' t' a b -> Lens (Either s s') (Either t t') a b
view :: Lens s s a a -> s -> a

-- | Setting
set :: ((a -> b) -> s -> t) -> (s, b) -> t
type LensLike (p :: Type -> Type -> Type) s t a b = p a b -> p s t
ravel :: (ALens a b i a b -> ALens a b i s t) -> Lens s t a b
data ALens a b i s t
ALens :: (s -> (c, a)) -> ((c, b) -> t) -> ALens a b i s t
idLens :: ALens a b i a b
lens :: (s -> (c, a)) -> ((c, b) -> t) -> Lens s t a b
withLensPrim :: Lens s t a b -> (forall c. () => (s -> (c, a)) -> ((c, b) -> t) -> r) -> r
fork :: (a -> b) -> (a -> c) -> a -> (b, c)
data Coyoneda (f :: Type -> Type) b
Coyoneda :: (a -> b) -> f a -> Coyoneda (f :: Type -> Type) b
inj :: Functor f => Coyoneda f a -> f a
proj :: Functor f => f a -> Coyoneda f a
(??) :: Functor f => f (a -> b) -> a -> f b
assoc3L :: forall a b c a' b' c' p i. Strong p => p i (a, (b, c)) (a', (b', c')) -> p i ((a, b), c) ((a', b'), c')
stron :: (Either s s', b) -> Either (s, b) (s', b)
build :: (Tagged i b b -> Tagged i t t) -> b -> t
left :: forall a (c :: Type -> Type) x b p i. Choice p => p i (a x) (b x) -> p i ((a :+: c) x) ((b :+: c) x)
right :: forall (a :: Type -> Type) b x c p i. Choice p => p i (b x) (c x) -> p i ((a :+: b) x) ((a :+: c) x)
match :: Prism s t a b -> s -> Either t a
type APrism i s t a b = Market a b i a b -> Market a b i s t
type Prism s t a b = forall (p :: Type -> Type -> Type -> Type) i. Choice p => p i a b -> p i s t
type Prism' s a = forall (p :: Type -> Type -> Type -> Type) i. Choice p => p i a a -> p i s s
prism :: (b -> t) -> (s -> Either t a) -> Prism s t a b
gsum :: (a x -> c) -> (b x -> c) -> (a :+: b) x -> c
_Left :: forall a c b p i. Choice p => p i a b -> p i (Either a c) (Either b c)
_Right :: forall c a b p i. Choice p => p i a b -> p i (Either c a) (Either c b)
prismPRavel :: APrism i s t a b -> Prism s t a b
prism2prismp :: Market a b i s t -> Prism s t a b
idPrism :: Market a b i a b
withPrism :: APrism i s t a b -> ((b -> t) -> (s -> Either t a) -> r) -> r
without' :: Prism s t a b -> Prism s t c d -> Prism s t (Either a c) (Either b d)

module Data.Generics.Product.Internal.Typed
type Context a s = (Generic s, ErrorUnlessOne a s CollectTotalType a Rep s, Defined Rep s NoGeneric s '[ 'Text "arising from a generic lens focusing on a field of type " ':<>: QuoteType a] (), GLens HasTotalTypePSym a Rep s Rep s a a)
derived :: Context a s => Lens s s a a

module Data.Generics.Product.Internal.Types

-- | The children of a type are the types of its fields. The
--   Children type family maps a type a to its set of
--   children.
--   
--   This type family is parameterized by a symbol ch (that can be
--   declared as an empty data type). The symbol ChGeneric provides
--   a default definition. You can create new symbols to override the set
--   of children of abstract, non-generic types.
--   
--   The following example declares a Custom symbol to redefine
--   Children for some abstract types from the time
--   library.
--   
--   
--   data Custom
--   type instance Children Custom a = ChildrenCustom a
--   
--   type family ChildrenCustom (a :: Type) where
--     ChildrenCustom DiffTime        = '[]
--     ChildrenCustom NominalDiffTime = '[]
--     -- Add more custom mappings here.
--   
--     ChildrenCustom a = Children ChGeneric a
--   
--   
--   To use this definition, replace types with
--   typesUsing @Custom.
type family Children ch a :: [Type]

-- | The default definition of Children. Primitive types from core
--   libraries have no children, and other types are assumed to be
--   Generic.
data ChGeneric
type family ChildrenDefault a :: [Type]
type family ChildrenGeneric (f :: k -> Type) (cs :: [Type]) :: [Type]
type Interesting ch a t = Defined_list Children ch t NoChildren ch t IsNothing Interesting' ch a '[t] Children ch t
type family NoChildren ch a
type family Interesting' ch a (seen :: [Type]) (ts :: [Type]) :: Maybe [Type]
type family InterestingUnless ch a (seen :: [Type]) t (alreadySeen :: Bool) :: Maybe [Type]
type family InterestingOr ch a (seen' :: Maybe [Type]) (ts :: [Type]) :: Maybe [Type]
type family Elem (a1 :: a) (as :: [a]) :: Bool
type family IsNothing (a1 :: Maybe a) :: Bool
class HasTypes s a
types_ :: HasTypes s a => Traversal' s a
data Void

class HasTypesUsing ch s t a b
typesUsing_ :: HasTypesUsing ch s t a b => Traversal s t a b

-- | By adding instances to this class, we can override the default
--   behaviour in an ad-hoc manner. For example:
--   
--   
--   instance HasTypesCustom Custom Opaque Opaque String String where
--     typesCustom f (Opaque str) = Opaque $ f str
--   
class HasTypesCustom ch s t a b

-- | This function should never be used directly, only to override the
--   default traversal behaviour. To actually use the custom traversal
--   strategy, see typesUsing. This is because typesUsing
--   does additional optimisations, like ensuring that nodes with no
--   relevant members will not be traversed at runtime.
typesCustom :: HasTypesCustom ch s t a b => Traversal s t a b
class HasTypesOpt ch (p :: Bool) s t a b
typesOpt :: HasTypesOpt ch p s t a b => Traversal s t a b
class GHasTypes (ch :: k) (s :: k1 -> Type) (t :: k1 -> Type) a b
gtypes_ :: forall (x :: k1). GHasTypes ch s t a b => Traversal (s x) (t x) a b
instance Data.Generics.Product.Internal.Types.HasTypes b a => Data.Generics.Product.Internal.Types.GHasTypes Data.Generics.Product.Internal.Types.ChGeneric (GHC.Internal.Generics.Rec0 b) (GHC.Internal.Generics.Rec0 b) a a
instance Data.Generics.Product.Internal.Types.HasTypesUsing ch s t a b => Data.Generics.Product.Internal.Types.GHasTypes ch (GHC.Internal.Generics.Rec0 s) (GHC.Internal.Generics.Rec0 t) a b
instance forall k1 k2 (ch :: k1) (l :: k2 -> *) (l' :: k2 -> *) a b (r :: k2 -> *) (r' :: k2 -> *). (Data.Generics.Product.Internal.Types.GHasTypes ch l l' a b, Data.Generics.Product.Internal.Types.GHasTypes ch r r' a b) => Data.Generics.Product.Internal.Types.GHasTypes ch (l GHC.Internal.Generics.:*: r) (l' GHC.Internal.Generics.:*: r') a b
instance forall k1 k2 (ch :: k1) (l :: k2 -> *) (l' :: k2 -> *) a b (r :: k2 -> *) (r' :: k2 -> *). (Data.Generics.Product.Internal.Types.GHasTypes ch l l' a b, Data.Generics.Product.Internal.Types.GHasTypes ch r r' a b) => Data.Generics.Product.Internal.Types.GHasTypes ch (l GHC.Internal.Generics.:+: r) (l' GHC.Internal.Generics.:+: r') a b
instance forall k1 k2 (ch :: k1) (s :: k2 -> *) (t :: k2 -> *) a b m (meta :: GHC.Internal.Generics.Meta). Data.Generics.Product.Internal.Types.GHasTypes ch s t a b => Data.Generics.Product.Internal.Types.GHasTypes ch (GHC.Internal.Generics.M1 m meta s) (GHC.Internal.Generics.M1 m meta t) a b
instance forall k1 k2 (ch :: k1) a b. Data.Generics.Product.Internal.Types.GHasTypes ch GHC.Internal.Generics.U1 GHC.Internal.Generics.U1 a b
instance forall k1 k2 (ch :: k1) a b. Data.Generics.Product.Internal.Types.GHasTypes ch GHC.Internal.Generics.V1 GHC.Internal.Generics.V1 a b
instance (Data.Generics.Product.Internal.Types.GHasTypes ch (GHC.Internal.Generics.Rep s) (GHC.Internal.Generics.Rep t) a b, GHC.Internal.Generics.Generic s, GHC.Internal.Generics.Generic t, Data.Generics.Internal.Errors.Defined (GHC.Internal.Generics.Rep s) (Data.Generics.Internal.Errors.PrettyError '[ 'GHC.Internal.TypeError.Text "No instance " 'GHC.Internal.TypeError.:<>: Data.Generics.Internal.Errors.QuoteType (Data.Generics.Product.Internal.Types.HasTypesCustom ch s t a b)]) (() :: Constraint)) => Data.Generics.Product.Internal.Types.HasTypesCustom ch s t a b
instance Data.Generics.Product.Internal.Types.HasTypesOpt ch 'GHC.Types.False s s a b
instance Data.Generics.Product.Internal.Types.HasTypesCustom ch s t a b => Data.Generics.Product.Internal.Types.HasTypesOpt ch 'GHC.Types.True s t a b
instance Data.Generics.Product.Internal.Types.HasTypesUsing ch Data.Generics.Product.Internal.Types.Void Data.Generics.Product.Internal.Types.Void a b
instance Data.Generics.Product.Internal.Types.HasTypesUsing ch s s Data.Generics.Product.Internal.Types.Void Data.Generics.Product.Internal.Types.Void
instance Data.Generics.Product.Internal.Types.HasTypesOpt ch (Data.Generics.Product.Internal.Types.Interesting ch a s) s t a b => Data.Generics.Product.Internal.Types.HasTypesUsing ch s t a b
instance Data.Generics.Product.Internal.Types.HasTypesUsing ch a b a b
instance Data.Generics.Product.Internal.Types.HasTypes Data.Generics.Product.Internal.Types.Void a
instance Data.Generics.Product.Internal.Types.HasTypes s Data.Generics.Product.Internal.Types.Void
instance Data.Generics.Product.Internal.Types.HasTypesUsing Data.Generics.Product.Internal.Types.ChGeneric s s a a => Data.Generics.Product.Internal.Types.HasTypes s a

module Data.Generics.Product.Internal.Param
type Context (n :: Nat) s t a b = (GenericN s, GenericN t, Defined Rep s NoGeneric s '[ 'Text "arising from a generic traversal of the type parameter at position " ':<>: QuoteType n, 'Text "of type " ':<>: QuoteType a ':<>: 'Text " in " ':<>: QuoteType s] (), s ~ Infer t P n b 'PTag a, t ~ Infer s P n a 'PTag b, Error ArgCount s <=? n n ArgCount s s, a ~ ArgAt s n :: Type, b ~ ArgAt t n :: Type, GHasTypes ChGeneric RepN s RepN t Param n a Param n b)
derived :: forall (n :: Nat) s t a b. Context n s t a b => Traversal s t a b

-- | Derive constructor-name-based prisms generically.
module Data.Generics.Sum.Internal.Constructors

-- | As AsConstructor but over generic representations as defined
--   by GHC.Generics.
class GAsConstructor (ctor :: Symbol) (s :: Type -> Type) (t :: Type -> Type) a b | ctor s -> a, ctor t -> b
_GCtor :: GAsConstructor ctor s t a b => Prism (s x) (t x) a b
type GAsConstructor' (ctor :: Symbol) (s :: Type -> Type) a = GAsConstructor ctor s s a a
type Context' (ctor :: Symbol) s a = (Context0 ctor s s a a, ErrorUnless ctor s HasCtorP ctor Rep s)
class Context (ctor :: Symbol) s t a b | ctor s -> a, ctor t -> b
class Context_ (ctor :: Symbol) s t a b
type Context0 (ctor :: Symbol) s t a b = (Generic s, Generic t, GAsConstructor ctor Rep s Rep t a b, Defined Rep s NoGeneric s '[ 'Text "arising from a generic prism focusing on the " ':<>: QuoteType ctor ':<>: 'Text " constructor of type " ':<>: QuoteType a, 'Text "in " ':<>: QuoteType s] ())
derived0 :: forall (ctor :: Symbol) s t a b. Context0 ctor s t a b => Prism s t a b
instance (Data.Generics.Sum.Internal.Constructors.ErrorUnless ctor s (Data.Generics.Internal.Families.Has.HasCtorP ctor (GHC.Internal.Generics.Rep s)), Data.Generics.Sum.Internal.Constructors.GAsConstructor' ctor (GHC.Internal.Generics.Rep s) a, Data.Generics.Sum.Internal.Constructors.GAsConstructor' ctor (GHC.Internal.Generics.Rep (Data.Generics.Internal.Families.Changing.Indexed s)) a', Data.Generics.Sum.Internal.Constructors.GAsConstructor ctor (GHC.Internal.Generics.Rep s) (GHC.Internal.Generics.Rep t) a b, Data.Generics.Sum.Internal.Constructors.GAsConstructor' ctor (GHC.Internal.Generics.Rep (Data.Generics.Internal.Families.Changing.Indexed t)) b', Data.Generics.Internal.Families.Changing.UnifyHead s t, Data.Generics.Internal.Families.Changing.UnifyHead t s) => Data.Generics.Sum.Internal.Constructors.Context_ ctor s t a b
instance (Data.Generics.Sum.Internal.Constructors.ErrorUnless ctor s (Data.Generics.Internal.Families.Has.HasCtorP ctor (GHC.Internal.Generics.Rep s)), Data.Generics.Sum.Internal.Constructors.GAsConstructor' ctor (GHC.Internal.Generics.Rep s) a, Data.Generics.Sum.Internal.Constructors.GAsConstructor' ctor (GHC.Internal.Generics.Rep (Data.Generics.Internal.Families.Changing.Indexed s)) a', Data.Generics.Sum.Internal.Constructors.GAsConstructor ctor (GHC.Internal.Generics.Rep s) (GHC.Internal.Generics.Rep t) a b, t GHC.Types.~ Data.Generics.Internal.Families.Changing.Infer s a' b, Data.Generics.Sum.Internal.Constructors.GAsConstructor' ctor (GHC.Internal.Generics.Rep (Data.Generics.Internal.Families.Changing.Indexed t)) b', s GHC.Types.~ Data.Generics.Internal.Families.Changing.Infer t b' a) => Data.Generics.Sum.Internal.Constructors.Context ctor s t a b
instance Data.Generics.Sum.Internal.Constructors.GSumAsConstructor ctor (Data.Generics.Internal.Families.Has.HasCtorP ctor l) l r l' r' a b => Data.Generics.Sum.Internal.Constructors.GAsConstructor ctor (l GHC.Internal.Generics.:+: r) (l' GHC.Internal.Generics.:+: r') a b
instance (Data.Generics.Product.Internal.HList.GIsList f g as bs, Data.Generics.Product.Internal.HList.ListTuple a b as bs) => Data.Generics.Sum.Internal.Constructors.GAsConstructor ctor (GHC.Internal.Generics.M1 GHC.Internal.Generics.C ('GHC.Internal.Generics.MetaCons ctor fixity fields) f) (GHC.Internal.Generics.M1 GHC.Internal.Generics.C ('GHC.Internal.Generics.MetaCons ctor fixity fields) g) a b
instance Data.Generics.Sum.Internal.Constructors.GAsConstructor ctor f f' a b => Data.Generics.Sum.Internal.Constructors.GAsConstructor ctor (GHC.Internal.Generics.M1 GHC.Internal.Generics.D meta f) (GHC.Internal.Generics.M1 GHC.Internal.Generics.D meta f') a b
instance Data.Generics.Sum.Internal.Constructors.GAsConstructor ctor r r' a b => Data.Generics.Sum.Internal.Constructors.GSumAsConstructor ctor 'GHC.Types.False l r l r' a b
instance Data.Generics.Sum.Internal.Constructors.GAsConstructor ctor l l' a b => Data.Generics.Sum.Internal.Constructors.GSumAsConstructor ctor 'GHC.Types.True l r l' r a b

-- | Derive constructor-field-type-based prisms generically.
module Data.Generics.Sum.Internal.Typed
type Context a s = (Generic s, ErrorUnlessOne a s CollectPartialType TupleToList a Rep s, GAsType Rep s a, Defined Rep s NoGeneric s '[ 'Text "arising from a generic prism focusing on a constructor of type " ':<>: QuoteType a] ())
derived :: Context a s => Prism' s a

-- | As AsType but over generic representations as defined by
--   GHC.Generics.
class GAsType (f :: Type -> Type) as
_GTyped :: GAsType f as => Prism (f x) (f x) as as
instance Data.Generics.Sum.Internal.Typed.GSumAsType (Data.Generics.Internal.Families.Has.HasPartialTypeP (Data.Generics.Product.Internal.HList.TupleToList a) l) l r a => Data.Generics.Sum.Internal.Typed.GAsType (l GHC.Internal.Generics.:+: r) a
instance (Data.Generics.Product.Internal.HList.GIsList f f as as, Data.Generics.Product.Internal.HList.ListTuple a a as as) => Data.Generics.Sum.Internal.Typed.GAsType (GHC.Internal.Generics.M1 GHC.Internal.Generics.C meta f) a
instance Data.Generics.Sum.Internal.Typed.GAsType f a => Data.Generics.Sum.Internal.Typed.GAsType (GHC.Internal.Generics.M1 GHC.Internal.Generics.D meta f) a
instance Data.Generics.Sum.Internal.Typed.GAsType r a => Data.Generics.Sum.Internal.Typed.GSumAsType 'GHC.Types.False l r a
instance Data.Generics.Sum.Internal.Typed.GAsType l a => Data.Generics.Sum.Internal.Typed.GSumAsType 'GHC.Types.True l r a

-- | Structural subtype relationships between sum types.
module Data.Generics.Sum.Internal.Subtype
type Context sub sup = (Generic sub, Generic sup, GAsSubtype Rep sub Rep sup)
derived :: Context sub sup => Prism' sup sub
instance (Data.Generics.Sum.Internal.Subtype.GSplash sub sup, Data.Generics.Sum.Internal.Subtype.GDowncast sub sup) => Data.Generics.Sum.Internal.Subtype.GAsSubtype sub sup
instance (Data.Generics.Sum.Internal.Typed.GAsType sub subl', Data.Generics.Product.Internal.HList.GIsList sup sup subl subl, Data.Generics.Product.Internal.HList.ListTuple subl' subl' subl subl) => Data.Generics.Sum.Internal.Subtype.GDowncastC 'GHC.Types.True sub sup
instance forall k (sub :: k -> *) (sup :: k -> *). Data.Generics.Sum.Internal.Subtype.GDowncastC 'GHC.Types.False sub sup
instance (Data.Generics.Product.Internal.HList.GIsList sup sup as as, Data.Generics.Sum.Internal.Subtype.GDowncastC (Data.Generics.Internal.Families.Has.HasPartialTypeP as sub) sub sup) => Data.Generics.Sum.Internal.Subtype.GDowncast sub (GHC.Internal.Generics.C1 m sup)
instance forall k (sub :: k -> *) (l :: k -> *) (r :: k -> *). (Data.Generics.Sum.Internal.Subtype.GDowncast sub l, Data.Generics.Sum.Internal.Subtype.GDowncast sub r) => Data.Generics.Sum.Internal.Subtype.GDowncast sub (l GHC.Internal.Generics.:+: r)
instance forall k (sub :: k -> *) (sup :: k -> *) (m :: GHC.Internal.Generics.Meta). Data.Generics.Sum.Internal.Subtype.GDowncast sub sup => Data.Generics.Sum.Internal.Subtype.GDowncast sub (GHC.Internal.Generics.D1 m sup)
instance (Data.Generics.Sum.Internal.Subtype.GSplash a sup, Data.Generics.Sum.Internal.Subtype.GSplash b sup) => Data.Generics.Sum.Internal.Subtype.GSplash (a GHC.Internal.Generics.:+: b) sup
instance (Data.Generics.Product.Internal.HList.GIsList subf subf as as, Data.Generics.Product.Internal.HList.ListTuple as' as' as as, Data.Generics.Sum.Internal.Typed.GAsType supf as') => Data.Generics.Sum.Internal.Subtype.GSplash (GHC.Internal.Generics.C1 meta subf) supf
instance Data.Generics.Sum.Internal.Subtype.GSplash sub sup => Data.Generics.Sum.Internal.Subtype.GSplash (GHC.Internal.Generics.D1 c sub) sup
