{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE CPP #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DefaultSignatures #-}
{-# LANGUAGE ExistentialQuantification #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE FunctionalDependencies #-}
{-# LANGUAGE LambdaCase #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE UndecidableInstances #-}
{-# LANGUAGE UndecidableSuperClasses #-}

-- | The most commonly used names in this module are intended to be imported
-- unqualified, as necessary:
--
-- @
-- import Flay (Flay, Flayable, flay, Flayable1, flay1)
-- @
--
-- The rest of the names, qualified:
--
-- @
-- import qualified Flay
-- @
--
-- __IMPORTANT__: Always check the
-- [changelog](https://hackage.haskell.org/package/flay/changelog) to learn
-- more about changes between different versions.
module Flay
 ( Flay
 -- * Flayable
 , Flayable(flay)
 , Flayable1
 , flay1
 -- ** Generics
 , gflay
 , GFlay
 -- , gflay1
 -- , GFlay1
 -- ** Utils
 , All
 , Trivial
 , trivialize
 , trivial
 , trivial1
 , trivial'
 , collect
 , collect1
 , collect'
 , zip
 , zip1
 , unsafeZip
 , terminal
 , Terminal
 , GTerminal
 -- * Pump & Dump
 , Pump
 , GPump
 , pump
 , dump
 -- * Miscellaneous
 , Fields
 , GFields
 , FieldsF
 , GFieldsF
 -- * Re-exports
 , Dict(Dict)
 ) where

import Control.Monad.Trans.Class (lift)
import Control.Monad.Trans.State (StateT(StateT), runStateT)
import Control.Monad.Trans.Maybe (MaybeT(MaybeT), runMaybeT)
import Data.Constraint (Dict(Dict))
import Data.Dynamic (Dynamic, toDyn, fromDynamic)
import Data.Functor.Product (Product(Pair))
import Data.Functor.Const (Const(Const, getConst))
import Data.Kind
import Data.Typeable (Typeable)
import qualified GHC.Generics as G
import Prelude hiding (zip)
import Unsafe.Coerce (unsafeCoerce)

--------------------------------------------------------------------------------

-- | @'Flay' c s t f g@ allows converting @s@ to @t@ by replacing
-- ocurrences of @f@ with @g@ by applicatively applying a function
-- @(forall a. c a => f a -> m (g a))@ to targeted occurences of @f a@ inside
-- @s@.
--
-- A 'Flay' must obey the following identity law:
--
-- @
-- forall (fl :: 'Flay' c s t f g).
--    fl ('const' 'pure')  ==  'pure'
-- @
--
-- When defining 'Flay' values, you should leave @c@, @f@, and @g@ fully
-- polymorphic, as these are the most useful types of 'Flay's.
--
-- We use @'Dict' (c a) ->@ instead of @c a =>@ because the latter is often not
-- enough to satisfy the type checker. With this approach, one must explicitly
-- pattern match on the @'Dict' (c a)@ constructor in order to bring the @c a@
-- instance to scope.  Also, it's necessary that @c@ is explicitly given a type
-- at the 'Flay''s call site, as otherwise the type checker won't be able to
-- infer @c@ on its own.
--
-- /to flay: tr. v., to strip off the skin or surface of./
--
-- Mnemonic for @c s t f g@: Much like lenses have type indexes @s t a b@ where
-- @s@ is the input state, @t@ is the output state, and @a@ and @b@ are the
-- input and output /values/ respectively, in 'Flay', @s@ and @t@ represent the
-- input and output states like in lenses, and @f@ and @g@ represent the
-- /wrappers/ over the input and output values respectively. The @c@ comes at
-- the very beginning because it is the type you are expected to apply with
-- 'TypeApplications' if necessary.
--
-- ==== Example 1: Removing uncertainty
--
-- Consider the following types and values:
--
-- @
-- -- | Foo is a higher-kinded type parametrized over some @f :: 'Type' -> 'Type'@.
-- data Foo f = Foo (f 'Int') (f 'Bool')
--
-- deriving instance ('Show' (f 'Int'), 'Show' (f 'Bool')) => 'Show' (Foo f)
-- @
--
-- @
-- flayFoo :: ('Applicative' m, c 'Int', c 'Bool') => 'Flay' c (Foo f) (Foo g) f g
-- flayFoo h (Foo a b) = Foo \<$> h 'Dict' a \<*> h 'Dict' b
-- @
--
-- @
-- foo1 :: Foo 'Maybe'
-- foo1 = Foo ('Just' 1) 'Nothing'
-- @
--
-- @
-- foo2 :: Foo 'Maybe'
-- foo2 = Foo ('Just' 2) ('Just' 'True')
-- @
--
-- It is possible to remove the /uncertainty/ of the fields in 'Foo' perhaps
-- being empty ('Nothing') by converting @Foo 'Maybe'@ to @Foo 'Identity'@.
-- However, we can't just write a function of type @Foo 'Maybe' -> Foo
-- 'Identity'@ because we have the possiblity of some of the fields being
-- 'Nothing', like in @foo1@. Instead, we are looking for a function @Foo
-- 'Maybe' -> 'Maybe' (Foo 'Identity')@ which will result on 'Just' only as long
-- as all of the fields in 'Foo' is 'Just', like in @foo2@. This is exactly what
-- 'Applicative' enables us to do:
--
-- @
-- fooMaybeToIdentity :: Foo 'Maybe' -> 'Maybe' (Foo 'Identity')
-- fooMaybeToIdentity (Foo a b) = Foo \<$> 'fmap' 'pure' a \<*> 'fmap' 'pure' b
-- @
--
-- Example using this in GHCi:
--
-- @
-- > fooMaybeToIdentity foo1
-- 'Nothing'
-- @
--
-- @
-- > fooMaybeToIdentity foo2
-- 'Just' (Foo ('Identity' 2) ('Identity' 'True'))
-- @
--
-- In fact, notice that we are not really working with 'Just', 'Nothing', nor
-- 'Identity' directly, so we might as well just leave 'Maybe' and 'Identity'
-- polymorphic. All we need is that they both are 'Applicative's:
--
-- @
-- fooMToG :: ('Applicative' m, 'Applicative' g) => Foo m -> m (Foo g)
-- fooMToG (Foo a b) = Foo \<$> 'fmap' 'pure' a \<*> 'fmap' 'pure' b
-- @
--
-- @fooMToG@ behaves the same as @fooMaybeToIdentity@, but more importantly, it
-- is much more flexible:
--
-- @
-- > fooMToG foo2 :: 'Maybe' (Foo [])
-- 'Just' (Foo [2] ['True'])
-- @
--
-- @
-- > fooMToG foo2 :: 'Maybe' (Foo ('Either' 'String'))
-- 'Just' (Foo ('Right' 2) ('Right' 'True'))
-- @
--
-- 'Flay', among other things, is intended to generalize this pattern, so that
-- whatever choice of 'Foo', 'Maybe' or 'Identity' you make, you can use
-- 'Applicative' this way. The easiest way to use 'Flay' is through 'trivial'',
-- which is sufficient unless we need to enforce some constraint in the target
-- elements wrapped in @m@ inside foo (we don't need this now). With 'trivial'',
-- we could have defined @fooMToG@ this way:
--
-- @
-- fooMToG :: ('Applicative' m, 'Applicative' g) => Foo m -> m (Foo g)
-- fooMToG = 'trivial'' flayFoo ('fmap' 'pure')
-- @
--
-- Some important things to notice here are that we are reusing 'flayFoo''s
-- knowledge of 'Foo''s structure, and that the construction of @g@ using 'pure'
-- applies to /any/ value wrapped in @m@ ('Int' and 'Bool' in our case). Compare
-- this last fact to 'traverse', where the types of the targets must be the
-- same, and known beforehand.
--
-- Also, notice that we inlined @flayFoo@ for convenience in this example, but
-- we could as well have taken it as an argument, illustrating even more how
-- 'Flay' decouples the shape and targets from their processing:
--
-- @
-- flayMToG :: ('Applicative' m, 'Applicative' g) => 'Flay' 'Trivial' m s t m g -> s -> m s
-- flayMToG fl = 'trivial'' fl ('fmap' 'pure')
-- @
--
-- This is the esscence of 'Flay': We can work operating on the contents of a
-- datatype @s@ targeted by a given 'Flay' /without/ knowing anything about @s@,
-- nor about the @forall x. f x@ targets of the 'Flay'. And we do this using an
-- principled approach relying on 'Applicative' and 'Functor'.
--
-- We can use a 'Flay' to repurpose a datatype while maintaining its "shape".
-- For example, given @Foo@: @Foo 'Identity'@ represents the presence of two
-- values 'Int' and 'Char', @Foo 'Maybe'@ represents their potential absence,
-- @Foo []@ represents the potential for zero or more 'Int's and 'Char's,
-- @Foo ('Const' x)@ represent the presence of two values of type @x@, and @Foo
-- 'IO'@ represents two 'IO' actions necessary to obtain values of type 'Int'
-- and 'Char'. We can use 'flayFoo' to convert between these representations. In
-- all these cases, the shape of @Foo@ is preserved, meaning we can continue to
-- pattern match or project on it. Notice that even though in this example the
-- @f@ argument to @Foo@ happens to always be a 'Functor', this is not necessary
-- at all.
--
-- ==== Example 2: Standalone @m@
--
-- In the previous example, @flayFoo@ took the type @Flay 'Trivial' (Foo m) (Foo
-- g) m g@ when it was used in @flayMToG@. That is, @m@ and @f@ were unified by
-- our use of 'fmap'. However, keeping these different opens interesting
-- possibilities. For example, let's try and convert a @Foo 'Maybe'@ to a @Foo
-- ('Either' 'String')@, prompting the user for the 'Left' side of that 'Either'
-- whenever the original target value is missing.
--
-- @
-- prompt :: 'IO' 'String'
-- prompt = do
--   'putStr' "Missing value! Error message? "
--   'getLine'
-- @
--
-- @
-- fooMaybeToEitherIO :: Foo 'Maybe' -> 'IO' (Foo ('Either' 'String'))
-- fooMaybeToEitherIO = 'trivial'' flayFoo $ \\case
--    'Nothing' -> 'fmap' 'Left' 'prompt'
--    'Just' x -> 'pure' ('Right' x)
-- @
--
-- Using this in GHCi:
--
-- @
-- > fooMaybeToEitherIO foo1
-- Missing value! Error message? /Nooooo!!!!!/
-- Foo ('Right' 1) ('Left' "Nooooo!!!!!")
-- @
--
-- @
-- > fooMaybeToEitherIO foo2
-- Foo ('Right' 2) ('Right' 'True')
-- @
--
-- ==== Example 3: Contexts
--
-- Extending the previous example we "replaced" the missing values with a
-- 'String', but wouldn't it be nice if we could somehow prompt a replacement
-- value of the original type instead? That's what the @c@ argument to 'Flay' is
-- for. Let's replace @prompt@ so that it can construct a type other than
-- 'String':
--
-- @
-- prompt :: 'Read' x => 'IO' x
-- prompt = do
--   'putStr' "Missing value! Replacement? "
--   'readLn'
-- @
--
-- Notice how @prompt@ now has a @'Read' x@ constraint. In order to be able to
-- use the result of @prompt@ as a replacement for our missing values in @Foo
-- 'Maybe'@, we will have to mention 'Read' as the @c@ argument to 'Flay',
-- which implies that 'Read' will have to be a constraint satisfied by all of
-- the targets of our 'Flay' (as seen in the constraints in 'flayFoo'). We can't
-- use 'trivial'' anymore, we need to use 'flayFoo' directly:
--
-- @
-- fooMaybeToIdentityIO :: Foo 'Maybe' -> 'IO' (Foo 'Identity')
-- fooMaybeToIdentityIO = flayFoo h
--   where h :: 'Dict' ('Read' a) -> 'Maybe' a -> 'IO' ('Identity' a)
--         h 'Dict' = \\case
--             'Nothing' -> 'fmap' 'pure' prompt
--             'Just' a -> 'pure' ('pure' a)
-- @
--
-- Notice how we had to give an explicit type to our function @h@: This is
-- because can't infer our @'Read' a@ constraint. You will always need to
-- explicitly type the received @'Dict'@ unless the @c@ argument to 'Flay' has
-- been explicitly by other means (like in the definition of 'trivial'', where
-- we don't have to explicitly type 'Dict' because @c ~ 'Trivial'@ according to
-- the top level signature of 'trivial''). Using the @TypeApplications@ GHC
-- extension might make things easier:
--
-- @
-- fooMaybeToIdentityIO :: Foo 'Maybe' -> 'IO' (Foo 'Identity')
-- fooMaybeToIdentityIO = flayFoo @Read (\\'Dict' -> \\case
--     'Nothing' -> 'fmap' 'pure' prompt
--     'Just' a -> 'pure' ('pure' a))
-- @
--
-- Example using this in GHCi:
--
-- @
-- > fooMaybeToIdentityIO foo1
-- Missing value! Replacement? /'True'/
-- Foo ('Identity' 1) ('Identity' 'True')
-- @
--
-- @
-- > fooMaybeToIdentityIO foo2
-- Foo ('Identity' 2) ('Identity' 'True')
-- @
--
-- Of course, as in our previous examples, 'Identity' here could have
-- generalized to any 'Applicative'. We just fixed it to 'Identity' as an
-- example.
--
-- You can mention as many constraints as you need in @c@ as long as @c@ has
-- kind @k -> 'Constraint'@ (where @k@ is the kind of @f@'s argument).  You can
-- always group together many constraints as a single new one in order to
-- achieve this. For example, if you want to require both 'Show' and 'Read' on
-- your target types, then you can introduce the following @ShowAndRead@ class,
-- and use that as your @c@.
--
-- @
-- class ('Show' a, 'Read' a) => ShowAndRead a
-- instance ('Show' a, 'Read' a) => ShowAndRead a
-- @
--
-- This is such a common scenario that the "Flay" module exports 'All', a
-- 'Constraint' you can use to apply many 'Constraint's at once. For example,
-- instead of introducing @ShowAndRead@, we could use @'All' '['Show', 'Read']@
-- as our @c@ argument to 'Flay', and the net result would be the same.
--
-- ==== Example 4: 'collect''
--
-- See the documentation for 'collect''. To sum up: for any given 'Flay', we can
-- collect all of the 'Flay''s targets into a 'Monoid', without knowing anything
-- about the targets themselves beyond the fact that they satisfy a particular
-- constraint.
--
type Flay (c :: k -> Constraint) s t (f :: k -> Type) (g :: k -> Type)
  = forall m. Applicative m
       => (forall a. Dict (c a) -> f a -> m (g a)) -> s -> m t

--------------------------------------------------------------------------------

-- | Default 'Flay' implementation for @s@ and @t@.
--
-- When defining 'Flayable' instances, you should leave @c@, @f@, and @g@
-- fully polymomrphic, as these are the most useful types of 'Flayables's.
--
-- If @s@ and @t@ are instances of 'G.Generic', then 'gflay' can be used as
-- default implementation for 'flay'. For example, provided the following
-- datatype and its 'G.Generic' instance:
--
-- @
-- data Foo f = Foo (f 'Int') (f 'Bool')
--   deriving ('G.Generic')
-- @
-- Then the following 'Flayable' instance would get a default implementation for
-- 'flay':
--
-- @
-- instance (c 'Int', c 'Bool') => 'Flayable' c (Foo f) (Foo g) f g
-- @
--
-- But actually, this library exports an @OVERLAPPABLE@ instance that covers
-- datatypes like 'Foo' above. That is, datatypes parametrized by some type
-- constructor where that type constructor wraps each of the immediate children
-- fields. So
-- /most times you don't even need to write the 'Flayable' instance yourself/.
-- That is, a @'Flayable' c (r f) (r g) f g@ for @r@ types parametrized by a
-- type-constructor, such as 'Foo', having 'G.Generic' instances.
--
-- In cases where you do need to define the 'Flayable' instance yourself, you'll
-- notice that constraints applying @c@ to every immediate child field type will
-- bubble up, such as @(c 'Int', c 'Bool')@ in the example above. This module
-- exports the 'FieldsF' constraint that can be used to reduce that boilerplate
-- for datatypes that implement 'G.Generic', tackling all of the fields at once.
-- That is, the 'Flayable' instance for 'Foo' above could have been written like
-- this:
--
-- @
-- instance 'FieldsF' c Foo => 'Flayable' c (Foo f) (Foo g) f g
-- @
--
-- Notice that 'flay' can be defined in terms of 'flay1' as well.
class Flayable (c :: k -> Constraint) s t (f :: k -> Type) (g :: k -> Type)
  | s -> f, t -> g, s g -> t, t f -> s where
  flay :: Flay c s t f g
  default flay :: GFlay c s t f g => Flay c s t f g
  flay = (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> s -> m t
forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
GFlay c s t f g =>
Flay c s t f g
Flay c s t f g
gflay
  {-# INLINE flay #-}

-- | All datatypes parametrized over some type constructor @f :: k -> 'Type'@ that
-- have a 'G.Generic' instance get a 'Flayable' instance for free. For example:
--
-- @
-- data Foo f = Foo (f 'Int') (f 'Bool')
--   deriving ('G.Generic')
-- @
--
-- This is an @OVERLAPPABLE@ instance, meaning that you can provide a different
-- instance for your 'G.Generic' datatype, if necessary.
instance {-# OVERLAPPABLE #-}
  GFlay c (r f) (r g) f g
  => Flayable c (r f) (r g) f g where
  flay :: Flay c (r f) (r g) f g
flay = (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> r f -> m (r g)
forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
GFlay c s t f g =>
Flay c s t f g
Flay c (r f) (r g) f g
gflay
  {-# INLINE flay #-}

--------------------------------------------------------------------------------

-- | 'Flayable1' is 'Flayable' specialized for the common case of @s ~ r f@ and
-- @t ~ r g@. The rationale for introducing this seemingly redundant constraint
-- is that 'Flayable1' is less verbose than 'Flayable'.
--
-- In other words, if we had @QuantifiedConstraints@, then 'Flayable1' would be
-- something like:
--
-- @
-- 'Flayable1' c r
--    ==  forall (f :: k -> 'Type') (g :: k -> 'Type').
--           'Flayable' c (r f) (r g) f g
-- @

-- Implementors note: Currently, 'Flayable1' is uses some of the skolem trickery
-- described in detail in "Data.Constraint.Forall", specialized to 'Flayable'.
type family Flayable1 (c :: k -> Constraint) (r :: (k -> Type) -> Type) :: Constraint where
  Flayable1 c r = Flayable1_ c r

-- | This inner 'Flayable1_' class prevents the skolem from leaking to the user.
class Flayable1K c r (Skolem (Flayable1K c r))
  => Flayable1_ (c :: k -> Constraint) (r :: (k -> Type) -> Type)
instance Flayable1K c r (Skolem (Flayable1K c r))
  => Flayable1_ c r

-- | Like @Flayable c (r F) (r G) F G@, but with a superfluous trailing @x@
-- to match the kind expected by 'Skolem'.
class Flayable c (r F) (r G) F G
  => Flayable1K (c :: k -> Constraint) (r :: (k -> Type) -> Type) (x :: Type)
instance Flayable c (r F) (r G) F G
  => Flayable1K c r x

-- The `Skolem` type family represents skolem variables; do not export!
type family Skolem (p :: k -> Constraint) :: k where

-- | Like 'flay', but specialized to work on 'Flayable1'.
flay1 :: forall c r f g. Flayable1 c r => Flay c (r f) (r g) f g
{-# INLINE flay1 #-}
flay1 :: forall {k} (c :: k -> Constraint) (r :: (k -> *) -> *)
       (f :: k -> *) (g :: k -> *).
Flayable1 c r =>
Flay c (r f) (r g) f g
flay1 =
  let flFG :: (forall (a :: k). Dict (c a) -> F a -> m (G a)) -> r F -> m (r G)
flFG = (forall (a :: k). Dict (c a) -> F a -> m (G a)) -> r F -> m (r G)
forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
Flayable c s t f g =>
Flay c s t f g
forall {m :: * -> *}.
Applicative m =>
(forall (a :: k). Dict (c a) -> F a -> m (G a)) -> r F -> m (r G)
flay :: Flay c (r F) (r G) F G
  in \(Dict (c Any) -> f Any -> m (g Any)
h0 :: Dict (c a0) -> f a0 -> m (g a0)) (r f
rf :: r f) ->
         m (r G) -> m (r g)
forall a b. a -> b
unsafeCoerce ((forall (a :: k). Dict (c a) -> F a -> m (G a)) -> r F -> m (r G)
flFG ((Dict (c Any) -> f Any -> m (g Any))
-> Dict (c a1) -> F a1 -> m (G a1)
forall a b. a -> b
unsafeCoerce Dict (c Any) -> f Any -> m (g Any)
h0 :: Dict (c a1) -> F a1 -> m (G a1))
                            (r f -> r F
forall a b. a -> b
unsafeCoerce r f
rf :: r F)
                         :: m (r G))

--------------------------------------------------------------------------------

-- | 'Constraint' trivially satisfied by every type.
--
-- This can be used as the @c@ parameter to 'Flay' or 'Flayable' in case you are
-- not interested in observing the values inside @f@.
class Trivial (a :: k)
instance Trivial a

-- | Given a 'Flay' for any constraint @c@ obtain a 'Flay' for a 'Trivial'
-- constraint.
trivialize :: forall c s t f g. Flay c s t f g -> Flay Trivial s t f g
{-# INLINE trivialize #-}
trivialize :: forall {k} (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
Flay c s t f g -> Flay Trivial s t f g
trivialize Flay c s t f g
fl0 = \forall (a :: k). Dict (Trivial a) -> f a -> m (g a)
h s
s ->
  (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> s -> m t
Flay c s t f g
fl0 (\(Dict (c a)
Dict :: Dict (c a)) (f a
fa :: f a) -> Dict (Trivial a) -> f a -> m (g a)
forall (a :: k). Dict (Trivial a) -> f a -> m (g a)
h (Dict (Trivial a)
forall (a :: Constraint). a => Dict a
Dict :: Dict (Trivial a)) f a
fa) s
s

-- | You can use 'trivial'' if you don't care about the @c@ argument to 'Flay'.
-- This implies that you won't be able to observe the @a@ in @forall a. f a@,
-- all you can do with such @a@ is pass it around.
--
-- @
-- forall (fl :: 'Flay' 'Trivial' s t f g)
--        (h :: 'Applicative' m => 'Dict' 'Trivial' -> f a -> m (g a)).
-- 'trivial'' fl h  == fl ('const' h)
-- @
trivial'
  :: forall m c s t f g
  .  Applicative m
  => Flay c s t f g
  -> (forall a. Trivial a => f a -> m (g a))
  -> s
  -> m t  -- ^
trivial' :: forall {k} (m :: * -> *) (c :: k -> Constraint) s t (f :: k -> *)
       (g :: k -> *).
Applicative m =>
Flay c s t f g
-> (forall (a :: k). Trivial a => f a -> m (g a)) -> s -> m t
trivial' Flay c s t f g
fl = \forall (a :: k). Trivial a => f a -> m (g a)
h -> \s
s -> Flay c s t f g -> Flay Trivial s t f g
forall {k} (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
Flay c s t f g -> Flay Trivial s t f g
trivialize (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> s -> m t
Flay c s t f g
fl (\Dict (Trivial a)
Dict f a
fa -> f a -> m (g a)
forall (a :: k). Trivial a => f a -> m (g a)
h f a
fa) s
s
{-# INLINE trivial' #-}

-- | Like 'trivial'', but works on a 'Flayable' instead of taking an explicit
-- 'Flay'.
--
-- @
-- 'trivial' = 'trivial'' 'flay'
-- @
trivial
  :: forall m s t f g
  .  (Applicative m, Flayable Trivial s t f g)
  => (forall a. Trivial a => f a -> m (g a))
  -> s
  -> m t  -- ^
trivial :: forall {k} (m :: * -> *) s t (f :: k -> *) (g :: k -> *).
(Applicative m, Flayable Trivial s t f g) =>
(forall (a :: k). Trivial a => f a -> m (g a)) -> s -> m t
trivial = Flay Trivial s t f g
-> (forall (a :: k). Trivial a => f a -> m (g a)) -> s -> m t
forall {k} (m :: * -> *) (c :: k -> Constraint) s t (f :: k -> *)
       (g :: k -> *).
Applicative m =>
Flay c s t f g
-> (forall (a :: k). Trivial a => f a -> m (g a)) -> s -> m t
trivial' ((forall (a :: k). Dict (Trivial a) -> f a -> m (g a)) -> s -> m t
forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
Flayable c s t f g =>
Flay c s t f g
Flay Trivial s t f g
flay :: Flay Trivial s t f g)
{-# INLINE trivial #-}

-- | Like 'trivial'', but works on a 'Flayable1' instead of taking an explicit
-- 'Flay'.
--
-- @
-- 'trivial' = 'trivial'' 'flay1'
-- @
trivial1
  :: forall m f g r
  .  (Applicative m, Flayable1 Trivial r)
  => (forall a. Trivial a => f a -> m (g a))
  -> (r f)
  -> m (r g)  -- ^
trivial1 :: forall {k} (m :: * -> *) (f :: k -> *) (g :: k -> *)
       (r :: (k -> *) -> *).
(Applicative m, Flayable1 Trivial r) =>
(forall (a :: k). Trivial a => f a -> m (g a)) -> r f -> m (r g)
trivial1 = Flay Trivial (r f) (r g) f g
-> (forall (a :: k). Trivial a => f a -> m (g a)) -> r f -> m (r g)
forall {k} (m :: * -> *) (c :: k -> Constraint) s t (f :: k -> *)
       (g :: k -> *).
Applicative m =>
Flay c s t f g
-> (forall (a :: k). Trivial a => f a -> m (g a)) -> s -> m t
trivial' ((forall (a :: k). Dict (Trivial a) -> f a -> m (g a))
-> r f -> m (r g)
forall {k} (c :: k -> Constraint) (r :: (k -> *) -> *)
       (f :: k -> *) (g :: k -> *).
Flayable1 c r =>
Flay c (r f) (r g) f g
Flay Trivial (r f) (r g) f g
flay1 :: Flay Trivial (r f) (r g) f g)
{-# INLINE trivial1 #-}

--------------------------------------------------------------------------------

-- | Convenient 'Constraint' for satisfying the requirements of 'gflay'.
type GFlay (c :: k -> Constraint) s t (f :: k -> Type) (g :: k -> Type)
  = (GFlay' c (G.Rep s) (G.Rep t) f g, G.Generic s, G.Generic t)

gflay :: GFlay c s t f g => Flay (c :: k -> Constraint) s t (f :: k -> Type) (g :: k -> Type)
gflay :: forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
GFlay c s t f g =>
Flay c s t f g
gflay = \forall (a :: k). Dict (c a) -> f a -> m (g a)
h s
s -> Rep t Any -> t
forall a x. Generic a => Rep a x -> a
forall x. Rep t x -> t
G.to (Rep t Any -> t) -> m (Rep t Any) -> m t
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall (a :: k). Dict (c a) -> f a -> m (g a))
-> Rep s Any -> m (Rep t Any)
forall {k} k (c :: k -> Constraint) (s :: k -> *) (t :: k -> *)
       (f :: k -> *) (g :: k -> *) (p :: k).
GFlay' c s t f g =>
Flay c (s p) (t p) f g
forall p. Flay c (Rep s p) (Rep t p) f g
gflay' Dict (c a) -> f a -> m (g a)
forall (a :: k). Dict (c a) -> f a -> m (g a)
h (s -> Rep s Any
forall x. s -> Rep s x
forall a x. Generic a => a -> Rep a x
G.from s
s)
{-# INLINE gflay #-}

class GFlay' (c :: k -> Constraint) s t (f :: k -> Type) (g :: k -> Type) where
  gflay' :: Flay c (s p) (t p) f g

instance GFlay' c G.V1 G.V1 f g where
  gflay' :: forall (p :: k). Flay c (V1 p) (V1 p) f g
gflay' forall (a :: k). Dict (c a) -> f a -> m (g a)
_ V1 p
_ = m (V1 p)
forall a. HasCallStack => a
undefined -- unreachable
  {-# INLINE gflay' #-}

instance GFlay' c G.U1 G.U1 f g where
  gflay' :: forall (p :: k). Flay c (U1 p) (U1 p) f g
gflay' forall (a :: k). Dict (c a) -> f a -> m (g a)
_ U1 p
_ = U1 p -> m (U1 p)
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure U1 p
forall k (p :: k). U1 p
G.U1
  {-# INLINE gflay' #-}

instance c a => GFlay' c (G.K1 r (f a)) (G.K1 r (g a)) f g where
  gflay' :: forall (p :: k). Flay c (K1 r (f a) p) (K1 r (g a) p) f g
gflay' forall (a :: k). Dict (c a) -> f a -> m (g a)
h (G.K1 f a
fa) = g a -> K1 r (g a) p
forall k i c (p :: k). c -> K1 i c p
G.K1 (g a -> K1 r (g a) p) -> m (g a) -> m (K1 r (g a) p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Dict (c a) -> f a -> m (g a)
forall (a :: k). Dict (c a) -> f a -> m (g a)
h Dict (c a)
forall (a :: Constraint). a => Dict a
Dict f a
fa
  {-# INLINE gflay' #-}

{- Enabling this breaks gflay, when used from flay1. This instance is the one that
   allows us to use GFlay with a datatype where not all its fields are parametrized
   by some type constructor (e.g., data Foo f = Foo (f Int) Bool).

    • Overlapping instances for Flay.GFlay' c (G.K1 G.R (f Int)) (G.K1 G.R (g Int)) f g
        arising from a use of ‘Flay.$dmflay1’
      Matching instances:
        instance [safe]
          forall k1 k2 (c :: k2 -> Constraint) (a :: k2) r (f :: k2 -> 'Type') (g :: k2 -> 'Type').
          c a =>
          Flay.GFlay' c (G.K1 r (f a)) (G.K1 r (g a)) f g
        instance [overlappable] [safe]
          forall k1 k2 (c :: k2 -> Constraint) r a (f :: k2 -> 'Type') (g :: k2 -> 'Type').
          Flay.GFlay' c (G.K1 r a) (G.K1 r a) f g

instance {-# OVERLAPPABLE #-} GFlay' c (G.K1 r a) (G.K1 r a) f g where
  gflay' _ (G.K1 a) = pure (G.K1 a)
  {-# INLINE gflay' #-}
-}

instance (GFlay' c s t f g)
  => GFlay' c (G.M1 i j s) (G.M1 i j t) f g where
  gflay' :: forall (p :: k). Flay c (M1 i j s p) (M1 i j t p) f g
gflay' forall (a :: k). Dict (c a) -> f a -> m (g a)
h (G.M1 s p
sp) = t p -> M1 i j t p
forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
G.M1 (t p -> M1 i j t p) -> m (t p) -> m (M1 i j t p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> s p -> m (t p)
forall (p :: k). Flay c (s p) (t p) f g
forall {k} k (c :: k -> Constraint) (s :: k -> *) (t :: k -> *)
       (f :: k -> *) (g :: k -> *) (p :: k).
GFlay' c s t f g =>
Flay c (s p) (t p) f g
gflay' Dict (c a) -> f a -> m (g a)
forall (a :: k). Dict (c a) -> f a -> m (g a)
h s p
sp
  {-# INLINE gflay' #-}

instance (GFlay' c sl tl f g, GFlay' c sr tr f g)
  => GFlay' c (sl G.:*: sr) (tl G.:*: tr) f g where
  gflay' :: forall (p :: k). Flay c ((:*:) sl sr p) ((:*:) tl tr p) f g
gflay' forall (a :: k). Dict (c a) -> f a -> m (g a)
h (sl p
slp G.:*: sr p
srp) = tl p -> tr p -> (:*:) tl tr p
forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
(G.:*:) (tl p -> tr p -> (:*:) tl tr p)
-> m (tl p) -> m (tr p -> (:*:) tl tr p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> sl p -> m (tl p)
forall (p :: k). Flay c (sl p) (tl p) f g
forall {k} k (c :: k -> Constraint) (s :: k -> *) (t :: k -> *)
       (f :: k -> *) (g :: k -> *) (p :: k).
GFlay' c s t f g =>
Flay c (s p) (t p) f g
gflay' Dict (c a) -> f a -> m (g a)
forall (a :: k). Dict (c a) -> f a -> m (g a)
h sl p
slp m (tr p -> (:*:) tl tr p) -> m (tr p) -> m ((:*:) tl tr p)
forall a b. m (a -> b) -> m a -> m b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> sr p -> m (tr p)
forall (p :: k). Flay c (sr p) (tr p) f g
forall {k} k (c :: k -> Constraint) (s :: k -> *) (t :: k -> *)
       (f :: k -> *) (g :: k -> *) (p :: k).
GFlay' c s t f g =>
Flay c (s p) (t p) f g
gflay' Dict (c a) -> f a -> m (g a)
forall (a :: k). Dict (c a) -> f a -> m (g a)
h sr p
srp
  {-# INLINE gflay' #-}

instance (GFlay' c sl tl f g, GFlay' c sr tr f g)
  => GFlay' c (sl G.:+: sr) (tl G.:+: tr) f g where
  gflay' :: forall (p :: k). Flay c ((:+:) sl sr p) ((:+:) tl tr p) f g
gflay' forall (a :: k). Dict (c a) -> f a -> m (g a)
h (:+:) sl sr p
x = case (:+:) sl sr p
x of
    G.L1 sl p
slp -> tl p -> (:+:) tl tr p
forall k (f :: k -> *) (g :: k -> *) (p :: k). f p -> (:+:) f g p
G.L1 (tl p -> (:+:) tl tr p) -> m (tl p) -> m ((:+:) tl tr p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> sl p -> m (tl p)
forall (p :: k). Flay c (sl p) (tl p) f g
forall {k} k (c :: k -> Constraint) (s :: k -> *) (t :: k -> *)
       (f :: k -> *) (g :: k -> *) (p :: k).
GFlay' c s t f g =>
Flay c (s p) (t p) f g
gflay' Dict (c a) -> f a -> m (g a)
forall (a :: k). Dict (c a) -> f a -> m (g a)
h sl p
slp
    G.R1 sr p
srp -> tr p -> (:+:) tl tr p
forall k (f :: k -> *) (g :: k -> *) (p :: k). g p -> (:+:) f g p
G.R1 (tr p -> (:+:) tl tr p) -> m (tr p) -> m ((:+:) tl tr p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall (a :: k). Dict (c a) -> f a -> m (g a)) -> sr p -> m (tr p)
forall (p :: k). Flay c (sr p) (tr p) f g
forall {k} k (c :: k -> Constraint) (s :: k -> *) (t :: k -> *)
       (f :: k -> *) (g :: k -> *) (p :: k).
GFlay' c s t f g =>
Flay c (s p) (t p) f g
gflay' Dict (c a) -> f a -> m (g a)
forall (a :: k). Dict (c a) -> f a -> m (g a)
h sr p
srp
  {-# INLINE gflay' #-}

--------------------------------------------------------------------------------

-- | Collect all of the @f a@ of the given 'Flay' into a 'Monoid' @b@.
--
-- Example usage, given 'Foo' and 'flayFoo' examples given in the documentation
-- for 'Flay':
--
-- @
-- > 'collect'' flayFoo
--       (\\('Dict' :: 'Dict' ('Show' a)) ('Identity' (a :: a)) -> ['show' a])
--       (Foo ('pure' 4) ('pure' 'True'))
-- ["4",\"True"]
-- @
collect'
  :: Monoid b
  => Flay c s t f (Const ())
  -> (forall a. Dict (c a) -> f a -> b)
  -> s
  -> b    -- ^
collect' :: forall {k} b (c :: k -> Constraint) s t (f :: k -> *).
Monoid b =>
Flay c s t f (Const ())
-> (forall (a :: k). Dict (c a) -> f a -> b) -> s -> b
collect' Flay c s t f (Const ())
fl = \forall (a :: k). Dict (c a) -> f a -> b
k -> \s
s -> Const b t -> b
forall {k} a (b :: k). Const a b -> a
getConst ((forall (a :: k). Dict (c a) -> f a -> Const b (Const () a))
-> s -> Const b t
Flay c s t f (Const ())
fl (\Dict (c a)
d f a
fa -> b -> Const b (Const () a)
forall {k} a (b :: k). a -> Const a b
Const (Dict (c a) -> f a -> b
forall (a :: k). Dict (c a) -> f a -> b
k Dict (c a)
d f a
fa)) s
s)
{-# INLINE collect' #-}

-- | Like 'collect'', but works on a 'Flayable' instead of an explicit 'Flay'.
collect
  :: (Monoid b, Flayable c s t f (Const ()))
  => (forall a. Dict (c a) -> f a -> b)
  -> s
  -> b    -- ^
collect :: forall {k} b (c :: k -> Constraint) s t (f :: k -> *).
(Monoid b, Flayable c s t f (Const ())) =>
(forall (a :: k). Dict (c a) -> f a -> b) -> s -> b
collect = Flay c s t f (Const ())
-> (forall (a :: k). Dict (c a) -> f a -> b) -> s -> b
forall {k} b (c :: k -> Constraint) s t (f :: k -> *).
Monoid b =>
Flay c s t f (Const ())
-> (forall (a :: k). Dict (c a) -> f a -> b) -> s -> b
collect' (forall (a :: k). Dict (c a) -> f a -> m (Const () a)) -> s -> m t
forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
Flayable c s t f g =>
Flay c s t f g
Flay c s t f (Const ())
flay
{-# INLINE collect #-}

-- | Like 'collect'', but works on a 'Flayable1' instead of an explicit 'Flay'.
collect1
  :: (Monoid b, Flayable1 c r)
  => (forall a. Dict (c a) -> f a -> b)
  -> r f
  -> b    -- ^
collect1 :: forall {k} b (c :: k -> Constraint) (r :: (k -> *) -> *)
       (f :: k -> *).
(Monoid b, Flayable1 c r) =>
(forall (a :: k). Dict (c a) -> f a -> b) -> r f -> b
collect1 = Flay c (r f) (r (Const ())) f (Const ())
-> (forall (a :: k). Dict (c a) -> f a -> b) -> r f -> b
forall {k} b (c :: k -> Constraint) s t (f :: k -> *).
Monoid b =>
Flay c s t f (Const ())
-> (forall (a :: k). Dict (c a) -> f a -> b) -> s -> b
collect' (forall (a :: k). Dict (c a) -> f a -> m (Const () a))
-> r f -> m (r (Const ()))
forall {k} (c :: k -> Constraint) (r :: (k -> *) -> *)
       (f :: k -> *) (g :: k -> *).
Flayable1 c r =>
Flay c (r f) (r g) f g
Flay c (r f) (r (Const ())) f (Const ())
flay1
{-# INLINE collect1 #-}

--------------------------------------------------------------------------------

-- | Witness that @a@ is a terminal object. That is, that @a@ can always be
-- constructed out of thin air.
class Terminal a where
  terminal :: a

instance Terminal () where
  terminal :: ()
terminal = ()
  {-# INLINE terminal #-}

instance {-# OVERLAPPABLE #-} (G.Generic a, GTerminal (G.Rep a)) => Terminal a where
  terminal :: a
terminal = Rep a Any -> a
forall a x. Generic a => Rep a x -> a
forall x. Rep a x -> a
G.to Rep a Any
forall p. Rep a p
forall (f :: * -> *) p. GTerminal f => f p
gterminal
  {-# INLINE terminal #-}

instance Terminal (Const () a) where
  terminal :: Const () a
terminal = () -> Const () a
forall {k} a (b :: k). a -> Const a b
Const ()
  {-# INLINE terminal #-}

---
class GTerminal (f :: Type -> Type) where
  gterminal :: f p

instance GTerminal G.U1 where
  gterminal :: forall p. U1 p
gterminal = U1 p
forall k (p :: k). U1 p
G.U1
  {-# INLINE gterminal #-}

instance Terminal x => GTerminal (G.K1 i x) where
  gterminal :: forall p. K1 i x p
gterminal = x -> K1 i x p
forall k i c (p :: k). c -> K1 i c p
G.K1 x
forall a. Terminal a => a
terminal
  {-# INLINE gterminal #-}

instance GTerminal f => GTerminal (G.M1 i c f) where
  gterminal :: forall p. M1 i c f p
gterminal = f p -> M1 i c f p
forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
G.M1 f p
forall p. f p
forall (f :: * -> *) p. GTerminal f => f p
gterminal
  {-# INLINE gterminal #-}

instance (GTerminal l, GTerminal r) => GTerminal (l G.:*: r) where
  gterminal :: forall p. (:*:) l r p
gterminal = l p
forall p. l p
forall (f :: * -> *) p. GTerminal f => f p
gterminal l p -> r p -> (:*:) l r p
forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
G.:*: r p
forall p. r p
forall (f :: * -> *) p. GTerminal f => f p
gterminal
  {-# INLINE gterminal #-}

--------------------------------------------------------------------------------

-- | Zip two 'Flayable1's together.
--
-- Example pairing two of the 'Foo' values seen elsewhere in this file.
--
-- @
-- > let foo1 = 'Foo' ('Data.Functor.Identity.Identity' 0) ('Data.Functor.Identity.Identity' 'False')
-- >   :: 'Foo' 'Data.Functor.Identity.Identity'
--
-- > let foo2 = 'Foo' ('Just' 1) 'Nothing'
-- >   :: 'Foo' 'Maybe'
--
-- > 'zip1' (\('Dict' :: 'Dict' ('Trivial' x)) a b -> 'pure' ('Data.Functor.Product.Pair' a b)) foo1 foo2
-- >   :: 'Applicative' m => m ('Maybe' ('Foo' ('Data.Functor.Product.Product' 'Data.Functor.Identity.Identity' 'Maybe')))
-- 'Just' ('Foo' ('Data.Functor.Product.Pair' ('Data.Functor.Identity.Identity' 0) ('Just' 1)) ('Data.Functor.Product.Pair' ('Data.Functor.Identity.Identity' 'False') 'Nothing'))
--
-- > 'zip1' (\('Dict' :: 'Dict' ('Show' x)) ('Data.Functor.Identity.Identity' a) yb -> case yb of
-- >           'Nothing' -> 'pure' ('Const' ('show' a))
-- >           'Just' b  -> 'pure' ('Const' ('show' (a, b))) )
-- >      foo1 foo2
-- >   :: 'Applicative' m => m ('Maybe' (Foo ('Const' 'String')))
-- 'Just' (Foo ('Const' \"(0,1)\") ('Const' \"False\"))
-- @
--
-- Returns 'Nothing' in case the indivual target types do not match.
--
-- Note: 'zip1' is safer but less general than 'unsafeZip'.
zip1
  :: forall c s f g h m
  .  (Monad m, Typeable f, Flayable1 c s, Flayable1 Typeable s)
  => (forall x. Dict (c x) -> f x -> g x -> m (h x))
  -> s f
  -> s g
  -> m (Maybe (s h))  -- ^
zip1 :: forall {k} (c :: k -> Constraint) (s :: (k -> *) -> *)
       (f :: k -> *) (g :: k -> *) (h :: k -> *) (m :: * -> *).
(Monad m, Typeable f, Flayable1 c s, Flayable1 Typeable s) =>
(forall (x :: k). Dict (c x) -> f x -> g x -> m (h x))
-> s f -> s g -> m (Maybe (s h))
zip1 forall (x :: k). Dict (c x) -> f x -> g x -> m (h x)
h = Flay Typeable (s f) (s (Const ())) f (Const ())
-> Flay Typeable (s g) (s (Product f g)) g (Product f g)
-> Flay c (s (Product f g)) (s h) (Product f g) h
-> (forall (x :: k). Dict (c x) -> f x -> g x -> m (h x))
-> s f
-> s g
-> m (Maybe (s h))
forall {k} (c :: k -> Constraint) s1 s2 t1 t2 t3 (f :: k -> *)
       (g :: k -> *) (h :: k -> *) (m :: * -> *).
(Monad m, Typeable f) =>
Flay Typeable s1 t1 f (Const ())
-> Flay Typeable s2 t2 g (Product f g)
-> Flay c t2 t3 (Product f g) h
-> (forall (x :: k). Dict (c x) -> f x -> g x -> m (h x))
-> s1
-> s2
-> m (Maybe t3)
unsafeZip (forall (a :: k). Dict (Typeable a) -> f a -> m (Const () a))
-> s f -> m (s (Const ()))
forall {k} (c :: k -> Constraint) (r :: (k -> *) -> *)
       (f :: k -> *) (g :: k -> *).
Flayable1 c r =>
Flay c (r f) (r g) f g
Flay Typeable (s f) (s (Const ())) f (Const ())
flay1 (forall (a :: k). Dict (Typeable a) -> g a -> m (Product f g a))
-> s g -> m (s (Product f g))
forall {k} (c :: k -> Constraint) (r :: (k -> *) -> *)
       (f :: k -> *) (g :: k -> *).
Flayable1 c r =>
Flay c (r f) (r g) f g
Flay Typeable (s g) (s (Product f g)) g (Product f g)
flay1 (forall (a :: k). Dict (c a) -> Product f g a -> m (h a))
-> s (Product f g) -> m (s h)
forall {k} (c :: k -> Constraint) (r :: (k -> *) -> *)
       (f :: k -> *) (g :: k -> *).
Flayable1 c r =>
Flay c (r f) (r g) f g
Flay c (s (Product f g)) (s h) (Product f g) h
flay1 Dict (c x) -> f x -> g x -> m (h x)
forall (x :: k). Dict (c x) -> f x -> g x -> m (h x)
h
{-# INLINABLE zip1 #-}

-- | Zip two 'Flayable's together.
--
-- 'zip' is like 'zip1', but for 'Flayable's.
--
-- Returns 'Nothing' in case the indivual target types do not match.
--
-- Note: 'zip' is safer but less general than 'unsafeZip'.
zip
  :: forall c s1 s2 t1 t2 t3 f g h m
  .  ( Monad m
     , Typeable f
     , Flayable Typeable s1 t1 f (Const ())
     , Flayable Typeable s2 t2 g (Product f g)
     , Flayable c t2 t3 (Product f g) h )
  => (forall x. Dict (c x) -> f x -> g x -> m (h x))
  -> s1
  -> s2
  -> m (Maybe t3)   -- ^
zip :: forall {k} (c :: k -> Constraint) s1 s2 t1 t2 t3 (f :: k -> *)
       (g :: k -> *) (h :: k -> *) (m :: * -> *).
(Monad m, Typeable f, Flayable Typeable s1 t1 f (Const ()),
 Flayable Typeable s2 t2 g (Product f g),
 Flayable c t2 t3 (Product f g) h) =>
(forall (x :: k). Dict (c x) -> f x -> g x -> m (h x))
-> s1 -> s2 -> m (Maybe t3)
zip forall (x :: k). Dict (c x) -> f x -> g x -> m (h x)
h = Flay Typeable s1 t1 f (Const ())
-> Flay Typeable s2 t2 g (Product f g)
-> Flay c t2 t3 (Product f g) h
-> (forall (x :: k). Dict (c x) -> f x -> g x -> m (h x))
-> s1
-> s2
-> m (Maybe t3)
forall {k} (c :: k -> Constraint) s1 s2 t1 t2 t3 (f :: k -> *)
       (g :: k -> *) (h :: k -> *) (m :: * -> *).
(Monad m, Typeable f) =>
Flay Typeable s1 t1 f (Const ())
-> Flay Typeable s2 t2 g (Product f g)
-> Flay c t2 t3 (Product f g) h
-> (forall (x :: k). Dict (c x) -> f x -> g x -> m (h x))
-> s1
-> s2
-> m (Maybe t3)
unsafeZip (forall (a :: k). Dict (Typeable a) -> f a -> m (Const () a))
-> s1 -> m t1
forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
Flayable c s t f g =>
Flay c s t f g
Flay Typeable s1 t1 f (Const ())
flay (forall (a :: k). Dict (Typeable a) -> g a -> m (Product f g a))
-> s2 -> m t2
forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
Flayable c s t f g =>
Flay c s t f g
Flay Typeable s2 t2 g (Product f g)
flay (forall (a :: k). Dict (c a) -> Product f g a -> m (h a))
-> t2 -> m t3
forall k (c :: k -> Constraint) s t (f :: k -> *) (g :: k -> *).
Flayable c s t f g =>
Flay c s t f g
Flay c t2 t3 (Product f g) h
flay Dict (c x) -> f x -> g x -> m (h x)
forall (x :: k). Dict (c x) -> f x -> g x -> m (h x)
h
{-# INLINABLE zip #-}

-- | Unsafe version of 'zip' that doesn't guarantee that the given 'Flay's
-- target the same values. 'zip' and 'zip1' make this function safe by simply
-- using 'flay' or 'flay1' three times.
--
-- Returns 'Nothing' in case the indivual target types do not match.

-- This implementation traverses the record three times. We could make it in
-- two, but that pollutes the constraints a bit.
unsafeZip
  :: forall c s1 s2 t1 t2 t3 f g h m
  .  (Monad m, Typeable f)
  => (Flay Typeable s1 t1 f (Const ()))
  -> (Flay Typeable s2 t2 g (Product f g))
  -> (Flay c t2 t3 (Product f g) h)
  -> (forall x. Dict (c x) -> f x -> g x -> m (h x))
  -> s1
  -> s2
  -> m (Maybe t3)  -- ^
unsafeZip :: forall {k} (c :: k -> Constraint) s1 s2 t1 t2 t3 (f :: k -> *)
       (g :: k -> *) (h :: k -> *) (m :: * -> *).
(Monad m, Typeable f) =>
Flay Typeable s1 t1 f (Const ())
-> Flay Typeable s2 t2 g (Product f g)
-> Flay c t2 t3 (Product f g) h
-> (forall (x :: k). Dict (c x) -> f x -> g x -> m (h x))
-> s1
-> s2
-> m (Maybe t3)
unsafeZip Flay Typeable s1 t1 f (Const ())
fl1 Flay Typeable s2 t2 g (Product f g)
fl2 Flay c t2 t3 (Product f g) h
fl3 forall (x :: k). Dict (c x) -> f x -> g x -> m (h x)
pair = \s1
s1 s2
s2 -> MaybeT m t3 -> m (Maybe t3)
forall (m :: * -> *) a. MaybeT m a -> m (Maybe a)
runMaybeT (MaybeT m t3 -> m (Maybe t3)) -> MaybeT m t3 -> m (Maybe t3)
forall a b. (a -> b) -> a -> b
$ do
   (t2
t2, [Dynamic]
dyns) <- StateT [Dynamic] (MaybeT m) t2
-> [Dynamic] -> MaybeT m (t2, [Dynamic])
forall s (m :: * -> *) a. StateT s m a -> s -> m (a, s)
runStateT ((forall (a :: k).
 Dict (Typeable a)
 -> g a -> StateT [Dynamic] (MaybeT m) (Product f g a))
-> s2 -> StateT [Dynamic] (MaybeT m) t2
Flay Typeable s2 t2 g (Product f g)
fl2 Dict (Typeable a)
-> g a -> StateT [Dynamic] (MaybeT m) (Product f g a)
forall (a :: k).
Dict (Typeable a)
-> g a -> StateT [Dynamic] (MaybeT m) (Product f g a)
f2 s2
s2) (Flay Typeable s1 t1 f (Const ())
-> (forall (a :: k). Dict (Typeable a) -> f a -> [Dynamic])
-> s1
-> [Dynamic]
forall {k} b (c :: k -> Constraint) s t (f :: k -> *).
Monoid b =>
Flay c s t f (Const ())
-> (forall (a :: k). Dict (c a) -> f a -> b) -> s -> b
collect' (forall (a :: k). Dict (Typeable a) -> f a -> m (Const () a))
-> s1 -> m t1
Flay Typeable s1 t1 f (Const ())
fl1 Dict (Typeable a) -> f a -> [Dynamic]
forall (a :: k). Dict (Typeable a) -> f a -> [Dynamic]
f1 s1
s1)
   case [Dynamic]
dyns of
     [] -> m t3 -> MaybeT m t3
forall (m :: * -> *) a. Monad m => m a -> MaybeT m a
forall (t :: (* -> *) -> * -> *) (m :: * -> *) a.
(MonadTrans t, Monad m) =>
m a -> t m a
lift ((forall (a :: k). Dict (c a) -> Product f g a -> m (h a))
-> t2 -> m t3
Flay c t2 t3 (Product f g) h
fl3 Dict (c a) -> Product f g a -> m (h a)
forall (a :: k). Dict (c a) -> Product f g a -> m (h a)
f3 t2
t2)
     [Dynamic]
_  -> m (Maybe t3) -> MaybeT m t3
forall (m :: * -> *) a. m (Maybe a) -> MaybeT m a
MaybeT (Maybe t3 -> m (Maybe t3)
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Maybe t3
forall a. Maybe a
Nothing)
 where
   f1 :: Dict (Typeable a) -> f a -> [Dynamic]
   f1 :: forall (a :: k). Dict (Typeable a) -> f a -> [Dynamic]
f1 = \Dict (Typeable a)
Dict !f a
fa -> [f a -> Dynamic
forall a. Typeable a => a -> Dynamic
toDyn f a
fa :: Dynamic]
   f2 :: Dict (Typeable a) -> g a -> StateT [Dynamic] (MaybeT m) (Product f g a)
   f2 :: forall (a :: k).
Dict (Typeable a)
-> g a -> StateT [Dynamic] (MaybeT m) (Product f g a)
f2 = \Dict (Typeable a)
Dict !g a
ga -> ([Dynamic] -> MaybeT m (Product f g a, [Dynamic]))
-> StateT [Dynamic] (MaybeT m) (Product f g a)
forall s (m :: * -> *) a. (s -> m (a, s)) -> StateT s m a
StateT (([Dynamic] -> MaybeT m (Product f g a, [Dynamic]))
 -> StateT [Dynamic] (MaybeT m) (Product f g a))
-> ([Dynamic] -> MaybeT m (Product f g a, [Dynamic]))
-> StateT [Dynamic] (MaybeT m) (Product f g a)
forall a b. (a -> b) -> a -> b
$ \case
            (Dynamic
x:[Dynamic]
xs) -> do !(f a
fa :: f a) <- m (Maybe (f a)) -> MaybeT m (f a)
forall (m :: * -> *) a. m (Maybe a) -> MaybeT m a
MaybeT (Maybe (f a) -> m (Maybe (f a))
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Dynamic -> Maybe (f a)
forall a. Typeable a => Dynamic -> Maybe a
fromDynamic Dynamic
x))
                         (Product f g a, [Dynamic]) -> MaybeT m (Product f g a, [Dynamic])
forall a. a -> MaybeT m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (f a -> g a -> Product f g a
forall {k} (f :: k -> *) (g :: k -> *) (a :: k).
f a -> g a -> Product f g a
Pair f a
fa g a
ga, [Dynamic]
xs)
            [] -> [Char] -> MaybeT m (Product f g a, [Dynamic])
forall a. HasCallStack => [Char] -> a
error [Char]
"Flay.unsafeZip"
   f3 :: Dict (c a) -> Product f g a -> m (h a)
   f3 :: forall (a :: k). Dict (c a) -> Product f g a -> m (h a)
f3 = \Dict (c a)
Dict (Pair f a
fa g a
ga) -> Dict (c a) -> f a -> g a -> m (h a)
forall (x :: k). Dict (c x) -> f x -> g x -> m (h x)
pair Dict (c a)
forall (a :: Constraint). a => Dict a
Dict f a
fa g a
ga


--------------------------------------------------------------------------------

-- | Wrapper allowing a 'G.Generic' non 'Flayable' type to become 'Flayable'.
--
-- Most datatypes that can have useful 'Flayable' instances are often
-- parametrized by a type constructor @f :: k -> 'Type'@, and have all or some of
-- their fields wrapped in said @f@, like so:
--
-- @
-- data Foo f = Foo (f 'Int') (f 'Bool')
-- @
--
-- However, that kind of representation is not that common, and it can sometimes
-- be unconfortable to use, particularly if @f ~ 'Identity'@ due to the
-- necessary wrapping and unwrapping of values. In Haskell, it's more common to
-- use a representation like the following for records (or sums):
--
-- @
-- data Bar = Bar 'Int' 'Bool'
--   deriving ('G.Generic')
-- @
--
-- The problem with that representation, however, is that it prevents us to
-- operate on the individual fields as enabled by 'Flay'.
--
-- 'Pump' is a wrapper that converts types like 'Bar' into types like 'Foo'. In
-- our concrete case, @'Pump' 'Bar' f@ is isomorphic to @'Foo' f@. But more
-- importantly, @'Pump' 'Bar' f@ automatically gets a 'Flayable' instance of its
-- own, allowing you to use 'flay' to operate on @'Pump' 'Bar' f@ as you would
-- operate on @'Foo' f@.
--
-- To construct a 'Pump' you use 'pump', and to remove the 'Pump' wrapper you
-- use 'dump', which satisfy the following identity law:
--
-- @
-- 'dump' 'id' . 'pump' 'pure'  ==  'pure'
-- @
--
-- 'Pump' relies on Haskell's 'G.Generic's, which is why we derived
-- 'G.Generic' for our @Bar@ above. If @Bar@ didn't have a 'G.Generic' instance,
-- then you wouldn't be able to use 'Pump' and would be better served by a
-- manually written functions converting @Bar@ to @Foo@ and back.
--
-- Keep in mind that @'Pump' s f@ will only add @f@ wrappers to the immediate
-- children fields of @s@ (which could itself be a sum type or a product type),
-- but it won't recurse into the fields and add @f@ wrappers to them.
--
-- Very contrived and verbose example using all of 'pump', 'dump' and 'flay':
--
-- @
-- -- | Replaces all of the fields of the given Bar with values 'Read' from
-- -- 'System.IO.stdin', if possible.
-- qux :: Bar -> 'IO' ('Either' 'String' 'Bar')
-- qux bar0 = do
--    let pbar0 :: 'Pump' Bar 'Identity'
--        pbar0 = 'pump' 'Identity' bar0
--    let h :: 'Dict' ('Read' a) -> 'Identity' a -> 'IO' ('Maybe' a)
--        h 'Dict' ('Identity' _) = 'fmap' 'Text.Read.readMaybe' 'getLine'
--    pbar1 :: 'Pump' Bar 'Maybe' <- 'flay' h pbar0
--    -- We convert the 'Maybe's to 'Either' just for demonstration purposes.
--    -- Using 'dump' 'id' would have been enough to make this function
--    -- return a 'Maybe' Bar.
--    let ebar1 :: 'Either' 'String' 'Bar'
--        ebar1 = 'dump' ('maybe' ('Left' \"Bad") 'Right') pbar1
--    pure ebar1
-- @
--
-- Or, written in a less verbose manner:
--
-- @
-- qux :: Bar -> 'IO' ('Either' 'String' 'Bar')
-- qux bar = 'fmap' ('dump' ('maybe' ('Left' \"Bad") 'Right'))
--                ('flay' \@'Read'
--                      (\('Dict' ('Identity' _) -> 'fmap' 'Text.readMaybe' 'getLine')
--                      ('pump' 'Identity' bar)
-- @
--
-- We can use @qux@ in GHCi as follows:
--
-- @
-- > qux (Bar 0 False)
-- /not a number/
-- /not a bool/
-- __Left \"Bad"__
--
-- > qux (Bar 0 False)
-- /1/
-- /True/
-- __Right (Bar 1 True)__
-- @
data Pump s f = forall p. Pump !(GPumped (G.Rep s) f p)

instance
  (GFlay' c (GPumped (G.Rep s) f) (GPumped (G.Rep s) g) f g)
  => Flayable c (Pump s f) (Pump s g) f g where
  flay :: Flay c (Pump s f) (Pump s g) f g
flay forall a. Dict (c a) -> f a -> m (g a)
h (Pump GPumped (Rep s) f p
rep) = GPumped (Rep s) g p -> Pump s g
forall s (f :: * -> *) p. GPumped (Rep s) f p -> Pump s f
Pump (GPumped (Rep s) g p -> Pump s g)
-> m (GPumped (Rep s) g p) -> m (Pump s g)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall a. Dict (c a) -> f a -> m (g a))
-> GPumped (Rep s) f p -> m (GPumped (Rep s) g p)
forall {k} k (c :: k -> Constraint) (s :: k -> *) (t :: k -> *)
       (f :: k -> *) (g :: k -> *) (p :: k).
GFlay' c s t f g =>
Flay c (s p) (t p) f g
forall p. Flay c (GPumped (Rep s) f p) (GPumped (Rep s) g p) f g
gflay' Dict (c a) -> f a -> m (g a)
forall a. Dict (c a) -> f a -> m (g a)
h GPumped (Rep s) f p
rep
  {-# INLINE flay #-}

-- Giving a Flayable1 instance to Pump is a bit more tricky, so we are not
-- doing it for the time being.

-- | Wrap @s@ in 'Pump' so that it can be 'flay'ed.
--
-- See the documentation for 'Pump' for more details.
pump
  :: GPump s f
  => (forall x. x -> f x)
  -- ^ How to wrap in @f@ each individual child field of @s@.
  -> s
  -> Pump s f  -- ^
pump :: forall s (f :: * -> *).
GPump s f =>
(forall x. x -> f x) -> s -> Pump s f
pump forall x. x -> f x
f = \s
s -> GPumped (Rep s) f Any -> Pump s f
forall s (f :: * -> *) p. GPumped (Rep s) f p -> Pump s f
Pump ((forall x. x -> f x) -> Rep s Any -> GPumped (Rep s) f Any
forall p. (forall x. x -> f x) -> Rep s p -> GPumped (Rep s) f p
forall k (s :: k -> *) (f :: * -> *) (p :: k).
GPump' s f =>
(forall a. a -> f a) -> s p -> GPumped s f p
gpump a -> f a
forall x. x -> f x
f (s -> Rep s Any
forall x. s -> Rep s x
forall a x. Generic a => a -> Rep a x
G.from s
s))
{-# INLINE pump #-}

-- | Remove the 'Pump' wraper around @s@.
--
-- See the documentation for 'Pump' for more details.
dump
  :: (GPump s f, Applicative m)
  => (forall a. f a -> m a)
  -- ^ How to remove the @f@ wrapper from every child field of @'Pump' s f@.
  -> Pump s f
  -> m s  -- ^
dump :: forall s (f :: * -> *) (m :: * -> *).
(GPump s f, Applicative m) =>
(forall a. f a -> m a) -> Pump s f -> m s
dump forall a. f a -> m a
f = \(Pump GPumped (Rep s) f p
rep) -> Rep s p -> s
forall a x. Generic a => Rep a x -> a
forall x. Rep s x -> s
G.to (Rep s p -> s) -> m (Rep s p) -> m s
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall a. f a -> m a) -> GPumped (Rep s) f p -> m (Rep s p)
forall k (s :: k -> *) (f :: * -> *) (m :: * -> *) (p :: k).
(GPump' s f, Applicative m) =>
(forall a. f a -> m a) -> GPumped s f p -> m (s p)
forall (m :: * -> *) p.
Applicative m =>
(forall a. f a -> m a) -> GPumped (Rep s) f p -> m (Rep s p)
gdump f a -> m a
forall a. f a -> m a
f GPumped (Rep s) f p
rep
{-# INLINE dump #-}

-- | Convenient 'Constraint' for satisfying the requirements of 'pump' and
-- 'dump'.
type GPump s f = (G.Generic s, GPump' (G.Rep s) f)

class GPump' (s :: k -> Type) (f :: Type -> Type) where
  type GPumped s f :: k -> Type
  gpump :: (forall a. a -> f a) -> s p -> GPumped s f p
  gdump :: Applicative m => (forall a. f a -> m a) -> GPumped s f p -> m (s p)

instance GPump' G.V1 f where
  type GPumped G.V1 f = G.V1
  gpump :: forall (p :: k). (forall a. a -> f a) -> V1 p -> GPumped V1 f p
gpump forall a. a -> f a
_ V1 p
_ = V1 p
GPumped V1 f p
forall a. HasCallStack => a
undefined -- unreachable
  gdump :: forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped V1 f p -> m (V1 p)
gdump forall a. f a -> m a
_ GPumped V1 f p
_ = m (V1 p)
forall a. HasCallStack => a
undefined -- unreachable

instance GPump' G.U1 f where
  type GPumped G.U1 f = G.U1
  gpump :: forall (p :: k). (forall a. a -> f a) -> U1 p -> GPumped U1 f p
gpump forall a. a -> f a
_ U1 p
G.U1 = U1 p
GPumped U1 f p
forall k (p :: k). U1 p
G.U1
  {-# INLINE gpump #-}
  gdump :: forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped U1 f p -> m (U1 p)
gdump forall a. f a -> m a
_ U1 p
GPumped U1 f p
G.U1 = U1 p -> m (U1 p)
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure U1 p
forall k (p :: k). U1 p
G.U1
  {-# INLINE gdump #-}

instance GPump' (G.K1 i c) f where
  type GPumped (G.K1 i c) f = G.K1 i (f c)
  gpump :: forall (p :: k).
(forall a. a -> f a) -> K1 i c p -> GPumped (K1 i c) f p
gpump forall a. a -> f a
f (G.K1 c
c) = f c -> K1 i (f c) p
forall k i c (p :: k). c -> K1 i c p
G.K1 (c -> f c
forall a. a -> f a
f c
c)
  {-# INLINE gpump #-}
  gdump :: forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped (K1 i c) f p -> m (K1 i c p)
gdump forall a. f a -> m a
f (G.K1 f c
c) = c -> K1 i c p
forall k i c (p :: k). c -> K1 i c p
G.K1 (c -> K1 i c p) -> m c -> m (K1 i c p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> f c -> m c
forall a. f a -> m a
f f c
c
  {-# INLINE gdump #-}

instance GPump' s f => GPump' (G.M1 i j s) f where
  type GPumped (G.M1 i j s) f = G.M1 i j (GPumped s f)
  gpump :: forall (p :: k).
(forall a. a -> f a) -> M1 i j s p -> GPumped (M1 i j s) f p
gpump forall a. a -> f a
f (G.M1 s p
sp) = GPumped s f p -> M1 i j (GPumped s f) p
forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
G.M1 ((forall a. a -> f a) -> s p -> GPumped s f p
forall (p :: k). (forall a. a -> f a) -> s p -> GPumped s f p
forall k (s :: k -> *) (f :: * -> *) (p :: k).
GPump' s f =>
(forall a. a -> f a) -> s p -> GPumped s f p
gpump a -> f a
forall a. a -> f a
f s p
sp)
  {-# INLINE gpump #-}
  gdump :: forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped (M1 i j s) f p -> m (M1 i j s p)
gdump forall a. f a -> m a
f (G.M1 GPumped s f p
sp) = s p -> M1 i j s p
forall k i (c :: Meta) (f :: k -> *) (p :: k). f p -> M1 i c f p
G.M1 (s p -> M1 i j s p) -> m (s p) -> m (M1 i j s p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall a. f a -> m a) -> GPumped s f p -> m (s p)
forall k (s :: k -> *) (f :: * -> *) (m :: * -> *) (p :: k).
(GPump' s f, Applicative m) =>
(forall a. f a -> m a) -> GPumped s f p -> m (s p)
forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped s f p -> m (s p)
gdump f a -> m a
forall a. f a -> m a
f GPumped s f p
sp
  {-# INLINE gdump #-}

instance (GPump' sl f, GPump' sr f) => GPump' (sl G.:*: sr) f where
  type GPumped (sl G.:*: sr) f = GPumped sl f G.:*: GPumped sr f
  gpump :: forall (p :: k).
(forall a. a -> f a) -> (:*:) sl sr p -> GPumped (sl :*: sr) f p
gpump forall a. a -> f a
f (sl p
slp G.:*: sr p
srp) = (forall a. a -> f a) -> sl p -> GPumped sl f p
forall (p :: k). (forall a. a -> f a) -> sl p -> GPumped sl f p
forall k (s :: k -> *) (f :: * -> *) (p :: k).
GPump' s f =>
(forall a. a -> f a) -> s p -> GPumped s f p
gpump a -> f a
forall a. a -> f a
f sl p
slp GPumped sl f p
-> GPumped sr f p -> (:*:) (GPumped sl f) (GPumped sr f) p
forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
G.:*: (forall a. a -> f a) -> sr p -> GPumped sr f p
forall (p :: k). (forall a. a -> f a) -> sr p -> GPumped sr f p
forall k (s :: k -> *) (f :: * -> *) (p :: k).
GPump' s f =>
(forall a. a -> f a) -> s p -> GPumped s f p
gpump a -> f a
forall a. a -> f a
f sr p
srp
  {-# INLINE gpump #-}
  gdump :: forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a)
-> GPumped (sl :*: sr) f p -> m ((:*:) sl sr p)
gdump forall a. f a -> m a
f (GPumped sl f p
slp G.:*: GPumped sr f p
srp) = sl p -> sr p -> (:*:) sl sr p
forall k (f :: k -> *) (g :: k -> *) (p :: k).
f p -> g p -> (:*:) f g p
(G.:*:) (sl p -> sr p -> (:*:) sl sr p)
-> m (sl p) -> m (sr p -> (:*:) sl sr p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall a. f a -> m a) -> GPumped sl f p -> m (sl p)
forall k (s :: k -> *) (f :: * -> *) (m :: * -> *) (p :: k).
(GPump' s f, Applicative m) =>
(forall a. f a -> m a) -> GPumped s f p -> m (s p)
forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped sl f p -> m (sl p)
gdump f a -> m a
forall a. f a -> m a
f GPumped sl f p
slp m (sr p -> (:*:) sl sr p) -> m (sr p) -> m ((:*:) sl sr p)
forall a b. m (a -> b) -> m a -> m b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> (forall a. f a -> m a) -> GPumped sr f p -> m (sr p)
forall k (s :: k -> *) (f :: * -> *) (m :: * -> *) (p :: k).
(GPump' s f, Applicative m) =>
(forall a. f a -> m a) -> GPumped s f p -> m (s p)
forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped sr f p -> m (sr p)
gdump f a -> m a
forall a. f a -> m a
f GPumped sr f p
srp
  {-# INLINE gdump #-}

instance (GPump' sl f, GPump' sr f) => GPump' (sl G.:+: sr) f where
  type GPumped (sl G.:+: sr) f = GPumped sl f G.:+: GPumped sr f
  gpump :: forall (p :: k).
(forall a. a -> f a) -> (:+:) sl sr p -> GPumped (sl :+: sr) f p
gpump forall a. a -> f a
f (G.L1 sl p
slp) = GPumped sl f p -> (:+:) (GPumped sl f) (GPumped sr f) p
forall k (f :: k -> *) (g :: k -> *) (p :: k). f p -> (:+:) f g p
G.L1 ((forall a. a -> f a) -> sl p -> GPumped sl f p
forall (p :: k). (forall a. a -> f a) -> sl p -> GPumped sl f p
forall k (s :: k -> *) (f :: * -> *) (p :: k).
GPump' s f =>
(forall a. a -> f a) -> s p -> GPumped s f p
gpump a -> f a
forall a. a -> f a
f sl p
slp)
  gpump forall a. a -> f a
f (G.R1 sr p
srp) = GPumped sr f p -> (:+:) (GPumped sl f) (GPumped sr f) p
forall k (f :: k -> *) (g :: k -> *) (p :: k). g p -> (:+:) f g p
G.R1 ((forall a. a -> f a) -> sr p -> GPumped sr f p
forall (p :: k). (forall a. a -> f a) -> sr p -> GPumped sr f p
forall k (s :: k -> *) (f :: * -> *) (p :: k).
GPump' s f =>
(forall a. a -> f a) -> s p -> GPumped s f p
gpump a -> f a
forall a. a -> f a
f sr p
srp)
  {-# INLINE gpump #-}
  gdump :: forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a)
-> GPumped (sl :+: sr) f p -> m ((:+:) sl sr p)
gdump forall a. f a -> m a
f (G.L1 GPumped sl f p
slp) = sl p -> (:+:) sl sr p
forall k (f :: k -> *) (g :: k -> *) (p :: k). f p -> (:+:) f g p
G.L1 (sl p -> (:+:) sl sr p) -> m (sl p) -> m ((:+:) sl sr p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall a. f a -> m a) -> GPumped sl f p -> m (sl p)
forall k (s :: k -> *) (f :: * -> *) (m :: * -> *) (p :: k).
(GPump' s f, Applicative m) =>
(forall a. f a -> m a) -> GPumped s f p -> m (s p)
forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped sl f p -> m (sl p)
gdump f a -> m a
forall a. f a -> m a
f GPumped sl f p
slp
  gdump forall a. f a -> m a
f (G.R1 GPumped sr f p
srp) = sr p -> (:+:) sl sr p
forall k (f :: k -> *) (g :: k -> *) (p :: k). g p -> (:+:) f g p
G.R1 (sr p -> (:+:) sl sr p) -> m (sr p) -> m ((:+:) sl sr p)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> (forall a. f a -> m a) -> GPumped sr f p -> m (sr p)
forall k (s :: k -> *) (f :: * -> *) (m :: * -> *) (p :: k).
(GPump' s f, Applicative m) =>
(forall a. f a -> m a) -> GPumped s f p -> m (s p)
forall (m :: * -> *) (p :: k).
Applicative m =>
(forall a. f a -> m a) -> GPumped sr f p -> m (sr p)
gdump f a -> m a
forall a. f a -> m a
f GPumped sr f p
srp
  {-# INLINE gdump #-}

--------------------------------------------------------------------------------

-- | Ensure that @x@ satisfies all of the constraints listed in @cs@.
type family All (cs :: [k -> Constraint]) (x :: k) :: Constraint where
  All (c ': cs) x = (c x, All cs x)
  All '[] _ = ()

-- | Ensure that all of the immeditate children fields of @s@ satisfy @c@.
--
-- For example, in a datatype like the following:
--
-- @
-- data Bar = Bar 'Int' 'Bool'
-- @
--
-- The 'Fields' constraint behaves like this:
--
-- @
-- 'Fields' c Bar  ==  (c 'Int', c 'Bool')
-- @
--
-- 'Fields' can be used to remove boilerplate from contexts, since @c@
-- will need to be mentioned just once, rather than once per type of field. This
-- is particularly useful in the case of datatypes as 'Foo' below, intended to
-- be used with 'Flay':
--
-- @
-- data Foo f = Foo (f 'Int') (f 'Bool')
-- @
--
-- The problem with types shaped like 'Foo' is that deriving some useful
-- instances for them, like 'Show', involves a lot of boilerplate.
-- For one, the usual @deriving ('Show')@ statement doesn't work, and you
-- need to rely on the @StandaloneDeriving@ GHC extension. But even that's not
-- enough, since you need to ensure that 'Show' constrains the individual field
-- types as well. That is:
--
-- @
-- deriving instance ('Show' (f 'Int'), 'Show' (f 'Bool')) => 'Show' (Foo f)
-- @
--
-- This works, but hopefully you can see how this can become very verbose when
-- you have more than a two or three datatypes in your fields. Instead, provided
-- we derive 'G.Generic' for 'Foo', we can use 'Fields' to remove that
-- boilerplate. That is:
--
-- @
-- data Foo f = Foo (f 'Int') (f 'Bool')
--   deriving ('G.Generic')
--
-- deriving instance 'Fields' 'Show' (Foo f) => 'Show' (Foo f)
-- @
type Fields c s = GFields c (G.Rep s)

-- | Like 'Fields', but @s@ is expected to be a 'G.Rep'.
--
-- This 'Constraint' ensures that @c@ is satsfieds by all of the 'G.K1' types
-- appearing in @s@, which is expected to be one of the various 'G.Generic'
-- representation types.
type family GFields (c :: kc -> Constraint) (s :: ks -> Type) :: Constraint where
  GFields _ G.V1 = ()
  GFields _ G.U1 = ()
  GFields c (G.K1 _ a) = (c a)
  GFields c (G.M1 _ _ s) = GFields c s
  GFields c (sl G.:*: sr) = (GFields c sl, GFields c sr)
  GFields c (sl G.:+: sr) = (GFields c sl, GFields c sr)

--------------------------------------------------------------------------------

-- | This is like 'Fields', but it targets only field types that are wrapped by
-- some type-constructor @f@.
--
-- That is, for all @a@ in @s f@ such that @f a@ is an immediate children of @s
-- f@, then @c a@ must be satisfied.
--
-- 'FieldsF' can be used to remove boilerplate from contexts, since @c@
-- will need to be mentioned just once, rather than once per type of field. This
-- is particularly useful in the case of datatypes as 'Foo' below, intended to
-- be used with 'Flay':
--
-- @
-- data Foo f = Foo (f 'Int') (f 'Bool')
-- @
--
-- If, for example, you intend to implement a @'Flayable' c (Foo f) (Foo g) f g@
-- instance, then constraints @c 'Int'@ and @c 'Bool'@ will propagate. However,
-- instead of writing @(c 'Int', c 'Bool')@, you can write @'FieldsF' c 'Foo'@
-- and achieve the same, which will reduce boilerplate significantly in cases
-- where the number of types contained in @f@ is larger. That is:
--
-- @
-- forall (c :: 'Type' -> 'Constraint').
--    'FieldsF' c 'Foo'  ==  (c 'Int', c 'Bool')
-- @
--
-- Notice that 'FieldsF' only works with types of kind @(k -> 'Type') -> 'Type'@ such as
-- 'Foo'. That is, types that are parametrized by a type constructor.

-- This type-family vs. class dance is so that 'F' doesn't show up in the public
-- API (that is, in 'FieldsF').
type family FieldsF (c :: k -> Constraint) (r :: (k -> Type) -> Type) :: Constraint where
  FieldsF c r = FieldsF_ c r
class GFieldsF c (G.Rep (r F)) F => FieldsF_ c r
instance GFieldsF c (G.Rep (r F)) F => FieldsF_ c r

-- | Like 'FieldsF', but @s@ is expected to be a 'G.Rep', and the type-constructor
-- @f@ expected to wrap all of the field targets we want to constraint with @c@
-- should be given explicitly.
--
-- This 'Constraint' ensures that @c@ is satsfieds by all of the 'G.K1' types
-- appearing in @s@ that are wrapped by @f@.
type family GFieldsF (c :: k -> Constraint) (s :: ks -> Type) (f :: k -> Type) :: Constraint where
  GFieldsF _ G.V1 _ = ()
  GFieldsF _ G.U1 _ = ()
  GFieldsF c (G.K1 _ (f a)) f = (c a)
  GFieldsF c (G.K1 _ _) f = ()
  GFieldsF c (G.M1 _ _ s) f = GFieldsF c s f
  GFieldsF c (sl G.:*: sr) f = (GFieldsF c sl f, GFieldsF c sr f)
  GFieldsF c (sl G.:+: sr) f = (GFieldsF c sl f, GFieldsF c sr f)

-- | INTERNAL. DO NOT EXPORT. Used as a placeholder of kind @forall k. k -> 'Type'@.
data F (a :: k)

-- | INTERNAL. DO NOT EXPORT. Used as a placeholder of kind @forall k. k -> 'Type'@.
data G (a :: k)