{-# LANGUAGE UndecidableInstances #-} -- required below GHC 9.6

{- | 'foldMap' for sum types where constructors are encoded by mapping the
      constructor name.

Note that constructor names are unique per type. So as long as your mapping
function similarly outputs unique values of your monoid for each constructor,
you should be able to "reverse" the process (e.g. for generic 'traverse').
-}

module Generic.Data.Function.FoldMap.Sum where

import GHC.Generics
import GHC.TypeLits ( TypeError )
import Generic.Data.Function.Util.Generic ( conName' )
import Generic.Data.Function.Error ( type ENoEmpty, type EUnexpectedNonSum )
import Generic.Data.Function.FoldMap.Constructor ( GFoldMapC(gFoldMapC) )

class GFoldMapSum m f where
    gFoldMapSum :: (String -> m) -> f p -> m

instance GFoldMapSum m f => GFoldMapSum m (D1 c f) where
    gFoldMapSum :: forall (p :: k). (String -> m) -> D1 c f p -> m
gFoldMapSum String -> m
f (M1 f p
a) = forall {k} m (f :: k -> Type) (p :: k).
GFoldMapSum m f =>
(String -> m) -> f p -> m
gFoldMapSum String -> m
f f p
a

instance GFoldMapCSum m (l :+: r) => GFoldMapSum m (l :+: r) where
    gFoldMapSum :: forall (p :: k). (String -> m) -> (:+:) l r p -> m
gFoldMapSum = forall {k} m (f :: k -> Type) (p :: k).
GFoldMapCSum m f =>
(String -> m) -> f p -> m
gFoldMapCSum

instance TypeError EUnexpectedNonSum => GFoldMapSum m (C1 c f) where
    gFoldMapSum :: forall (p :: k). (String -> m) -> C1 c f p -> m
gFoldMapSum = forall a. HasCallStack => a
undefined

instance TypeError ENoEmpty => GFoldMapSum m V1 where
    gFoldMapSum :: forall (p :: k). (String -> m) -> V1 p -> m
gFoldMapSum = forall a. HasCallStack => a
undefined

-- | Sum type handler prefixing constructor contents with their mapped
--   constructor name via a provided @String -> m@.
--
-- TODO rename
class GFoldMapCSum m f where gFoldMapCSum :: (String -> m) -> f p -> m

instance (GFoldMapCSum m l, GFoldMapCSum m r) => GFoldMapCSum m (l :+: r) where
    gFoldMapCSum :: forall (p :: k). (String -> m) -> (:+:) l r p -> m
gFoldMapCSum String -> m
f = \case L1 l p
l -> forall {k} m (f :: k -> Type) (p :: k).
GFoldMapCSum m f =>
(String -> m) -> f p -> m
gFoldMapCSum String -> m
f l p
l
                           R1 r p
r -> forall {k} m (f :: k -> Type) (p :: k).
GFoldMapCSum m f =>
(String -> m) -> f p -> m
gFoldMapCSum String -> m
f r p
r

instance (Semigroup m, Constructor c, GFoldMapC m f)
  => GFoldMapCSum m (C1 c f) where
    gFoldMapCSum :: forall (p :: k). (String -> m) -> C1 c f p -> m
gFoldMapCSum String -> m
mapCstr (M1 f p
a) = String -> m
mapCstr (forall {k} (c :: k). Constructor c => String
conName' @c) forall a. Semigroup a => a -> a -> a
<> forall {k} m (f :: k -> Type) (p :: k). GFoldMapC m f => f p -> m
gFoldMapC f p
a