{-# LANGUAGE DataKinds #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE PolyKinds #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TypeInType #-}
{-# LANGUAGE UndecidableInstances #-}

{-# OPTIONS_GHC -fno-warn-orphans #-}

-- | This module exports 'Bin.Binary' instances for 'Some1', 'Some2', 'Some3'
-- and 'Some4' from "Exinst", provided situable 'Dict1', 'Dict2',
-- 'Dict3' and 'Dict4' instances are available.
--
-- See the README file in the @exinst@ package for more general documentation:
-- https://hackage.haskell.org/package/exinst#readme
module Exinst.Binary () where

import qualified Data.Binary as Bin
import Data.Constraint
import Data.Kind (Type)
import Data.Singletons
import Prelude

import Exinst.Internal
import Exinst.Internal.Sum
import Exinst.Internal.Product

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

-- | Compatible with the 'Data.Bytes.Serial.Serial' instance and
-- 'Data.Serialize.Serialize' instance, provided all of the 'Demote's and the
-- fully applied @f@ instances are compatible as well.
instance forall k1 (f :: k1 -> Type).
  ( SingKind k1
  , Bin.Binary (Demote k1)
  , Dict1 Bin.Binary f
  ) => Bin.Binary (Some1 f) where
  {-# INLINABLE put #-}
  put :: Some1 f -> Put
put = \Some1 f
some1x ->
    forall k1 (f1 :: k1 -> *) r.
Some1 f1
-> (forall (a1 :: k1). SingI a1 => Sing a1 -> f1 a1 -> r) -> r
withSome1Sing Some1 f
some1x forall a b. (a -> b) -> a -> b
$ \Sing a1
sa1 (f a1
x :: f a1) ->
      case forall k0 k1 (c :: k0 -> Constraint) (f1 :: k1 -> k0) (a1 :: k1).
Dict1 c f1 =>
Sing a1 -> Dict (c (f1 a1))
dict1 Sing a1
sa1 :: Dict (Bin.Binary (f a1)) of
        Dict (Binary (f a1))
Dict -> do
          forall t. Binary t => t -> Put
Bin.put (forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a1
sa1)
          forall t. Binary t => t -> Put
Bin.put f a1
x
  {-# INLINABLE get #-}
  get :: Get (Some1 f)
get = do
    Demote k1
rsa1 <- forall t. Binary t => Get t
Bin.get
    forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k1
rsa1 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa1 :: Sing (a1 :: k1)) ->
      case forall k0 k1 (c :: k0 -> Constraint) (f1 :: k1 -> k0) (a1 :: k1).
Dict1 c f1 =>
Sing a1 -> Dict (c (f1 a1))
dict1 Sing a
sa1 :: Dict (Bin.Binary (f a1)) of
        Dict (Binary (f a))
Dict -> do
          f a
x :: f a1 <- forall t. Binary t => Get t
Bin.get
          forall (f :: * -> *) a. Applicative f => a -> f a
pure (forall k1 (f1 :: k1 -> *) (a1 :: k1). Sing a1 -> f1 a1 -> Some1 f1
Some1 Sing a
sa1 f a
x)

-- | Compatible with the 'Data.Bytes.Serial.Serial' instance and
-- 'Data.Serialize.Serialize' instance, provided all of the 'Demote's and the
-- fully applied @f@ instances are compatible as well.
instance forall k2 k1 (f :: k2 -> k1 -> Type).
  ( SingKind k2
  , SingKind k1
  , Bin.Binary (Demote k2)
  , Bin.Binary (Demote k1)
  , Dict2 Bin.Binary f
  ) => Bin.Binary (Some2 f) where
  {-# INLINABLE put #-}
  put :: Some2 f -> Put
put = \Some2 f
some2x ->
    forall k2 k1 (f2 :: k2 -> k1 -> *) r.
Some2 f2
-> (forall (a2 :: k2) (a1 :: k1).
    (SingI a2, SingI a1) =>
    Sing a2 -> Sing a1 -> f2 a2 a1 -> r)
-> r
withSome2Sing Some2 f
some2x forall a b. (a -> b) -> a -> b
$ \Sing a2
sa2 Sing a1
sa1 (f a2 a1
x :: f a2 a1) ->
      case forall k0 k2 k1 (c :: k0 -> Constraint) (f2 :: k2 -> k1 -> k0)
       (a2 :: k2) (a1 :: k1).
Dict2 c f2 =>
Sing a2 -> Sing a1 -> Dict (c (f2 a2 a1))
dict2 Sing a2
sa2 Sing a1
sa1 :: Dict (Bin.Binary (f a2 a1)) of
        Dict (Binary (f a2 a1))
Dict -> do
          forall t. Binary t => t -> Put
Bin.put (forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a2
sa2, forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a1
sa1)
          forall t. Binary t => t -> Put
Bin.put f a2 a1
x
  {-# INLINABLE get #-}
  get :: Get (Some2 f)
get = do
    (Demote k2
rsa2, Demote k1
rsa1) <- forall t. Binary t => Get t
Bin.get
    forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k2
rsa2 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa2 :: Sing (a2 :: k2)) ->
      forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k1
rsa1 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa1 :: Sing (a1 :: k1)) ->
        case forall k0 k2 k1 (c :: k0 -> Constraint) (f2 :: k2 -> k1 -> k0)
       (a2 :: k2) (a1 :: k1).
Dict2 c f2 =>
Sing a2 -> Sing a1 -> Dict (c (f2 a2 a1))
dict2 Sing a
sa2 Sing a
sa1 :: Dict (Bin.Binary (f a2 a1)) of
          Dict (Binary (f a a))
Dict -> do
            f a a
x :: f a2 a1 <- forall t. Binary t => Get t
Bin.get
            forall (f :: * -> *) a. Applicative f => a -> f a
pure (forall k2 k1 (f2 :: k2 -> k1 -> *) (a2 :: k2) (a1 :: k1).
Sing a2 -> Sing a1 -> f2 a2 a1 -> Some2 f2
Some2 Sing a
sa2 Sing a
sa1 f a a
x)

-- | Compatible with the 'Data.Bytes.Serial.Serial' instance and
-- 'Data.Serialize.Serialize' instance, provided all of the 'Demote's and the
-- fully applied @f@ instances are compatible as well.
instance forall k3 k2 k1 (f :: k3 -> k2 -> k1 -> Type).
  ( SingKind k3
  , SingKind k2
  , SingKind k1
  , Bin.Binary (Demote k3)
  , Bin.Binary (Demote k2)
  , Bin.Binary (Demote k1)
  , Dict3 Bin.Binary f
  ) => Bin.Binary (Some3 f) where
  {-# INLINABLE put #-}
  put :: Some3 f -> Put
put = \Some3 f
some3x ->
    forall k3 k2 k1 (f3 :: k3 -> k2 -> k1 -> *) r.
Some3 f3
-> (forall (a3 :: k3) (a2 :: k2) (a1 :: k1).
    (SingI a3, SingI a2, SingI a1) =>
    Sing a3 -> Sing a2 -> Sing a1 -> f3 a3 a2 a1 -> r)
-> r
withSome3Sing Some3 f
some3x forall a b. (a -> b) -> a -> b
$ \Sing a3
sa3 Sing a2
sa2 Sing a1
sa1 (f a3 a2 a1
x :: f a3 a2 a1) ->
      case forall k0 k3 k2 k1 (c :: k0 -> Constraint)
       (f3 :: k3 -> k2 -> k1 -> k0) (a3 :: k3) (a2 :: k2) (a1 :: k1).
Dict3 c f3 =>
Sing a3 -> Sing a2 -> Sing a1 -> Dict (c (f3 a3 a2 a1))
dict3 Sing a3
sa3 Sing a2
sa2 Sing a1
sa1 :: Dict (Bin.Binary (f a3 a2 a1)) of
        Dict (Binary (f a3 a2 a1))
Dict -> do
          forall t. Binary t => t -> Put
Bin.put (forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a3
sa3, forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a2
sa2, forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a1
sa1)
          forall t. Binary t => t -> Put
Bin.put f a3 a2 a1
x
  {-# INLINABLE get #-}
  get :: Get (Some3 f)
get = do
    (Demote k3
rsa3, Demote k2
rsa2, Demote k1
rsa1) <- forall t. Binary t => Get t
Bin.get
    forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k3
rsa3 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa3 :: Sing (a3 :: k3)) ->
      forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k2
rsa2 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa2 :: Sing (a2 :: k2)) ->
        forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k1
rsa1 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa1 :: Sing (a1 :: k1)) ->
          case forall k0 k3 k2 k1 (c :: k0 -> Constraint)
       (f3 :: k3 -> k2 -> k1 -> k0) (a3 :: k3) (a2 :: k2) (a1 :: k1).
Dict3 c f3 =>
Sing a3 -> Sing a2 -> Sing a1 -> Dict (c (f3 a3 a2 a1))
dict3 Sing a
sa3 Sing a
sa2 Sing a
sa1 :: Dict (Bin.Binary (f a3 a2 a1)) of
            Dict (Binary (f a a a))
Dict -> do
              f a a a
x :: f a3 a2 a1 <- forall t. Binary t => Get t
Bin.get
              forall (f :: * -> *) a. Applicative f => a -> f a
pure (forall k3 k2 k1 (f3 :: k3 -> k2 -> k1 -> *) (a3 :: k3) (a2 :: k2)
       (a1 :: k1).
Sing a3 -> Sing a2 -> Sing a1 -> f3 a3 a2 a1 -> Some3 f3
Some3 Sing a
sa3 Sing a
sa2 Sing a
sa1 f a a a
x)

-- | Compatible with the 'Data.Bytes.Serial.Serial' instance and
-- 'Data.Serialize.Serialize' instance, provided all of the 'Demote's and the
-- fully applied @f@ instances are compatible as well.
instance forall k4 k3 k2 k1 (f :: k4 -> k3 -> k2 -> k1 -> Type).
  ( SingKind k4
  , SingKind k3
  , SingKind k2
  , SingKind k1
  , Bin.Binary (Demote k4)
  , Bin.Binary (Demote k3)
  , Bin.Binary (Demote k2)
  , Bin.Binary (Demote k1)
  , Dict4 Bin.Binary f
  ) => Bin.Binary (Some4 f) where
  {-# INLINABLE put #-}
  put :: Some4 f -> Put
put = \Some4 f
some4x ->
    forall k4 k3 k2 k1 (f4 :: k4 -> k3 -> k2 -> k1 -> *) r.
Some4 f4
-> (forall (a4 :: k4) (a3 :: k3) (a2 :: k2) (a1 :: k1).
    (SingI a4, SingI a3, SingI a2, SingI a1) =>
    Sing a4 -> Sing a3 -> Sing a2 -> Sing a1 -> f4 a4 a3 a2 a1 -> r)
-> r
withSome4Sing Some4 f
some4x forall a b. (a -> b) -> a -> b
$ \Sing a4
sa4 Sing a3
sa3 Sing a2
sa2 Sing a1
sa1 (f a4 a3 a2 a1
x :: f a4 a3 a2 a1) ->
      case forall k0 k4 k3 k2 k1 (c :: k0 -> Constraint)
       (f4 :: k4 -> k3 -> k2 -> k1 -> k0) (a4 :: k4) (a3 :: k3) (a2 :: k2)
       (a1 :: k1).
Dict4 c f4 =>
Sing a4
-> Sing a3 -> Sing a2 -> Sing a1 -> Dict (c (f4 a4 a3 a2 a1))
dict4 Sing a4
sa4 Sing a3
sa3 Sing a2
sa2 Sing a1
sa1 :: Dict (Bin.Binary (f a4 a3 a2 a1)) of
        Dict (Binary (f a4 a3 a2 a1))
Dict -> do
          forall t. Binary t => t -> Put
Bin.put (forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a4
sa4, forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a3
sa3, forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a2
sa2, forall k (a :: k). SingKind k => Sing a -> Demote k
fromSing Sing a1
sa1)
          forall t. Binary t => t -> Put
Bin.put f a4 a3 a2 a1
x
  {-# INLINABLE get #-}
  get :: Get (Some4 f)
get = do
    (Demote k4
rsa4, Demote k3
rsa3, Demote k2
rsa2, Demote k1
rsa1) <- forall t. Binary t => Get t
Bin.get
    forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k4
rsa4 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa4 :: Sing (a4 :: k4)) ->
      forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k3
rsa3 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa3 :: Sing (a3 :: k3)) ->
        forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k2
rsa2 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa2 :: Sing (a2 :: k2)) ->
          forall k r.
SingKind k =>
Demote k -> (forall (a :: k). Sing a -> r) -> r
withSomeSing Demote k1
rsa1 forall a b. (a -> b) -> a -> b
$ \(Sing a
sa1 :: Sing (a1 :: k1)) ->
            case forall k0 k4 k3 k2 k1 (c :: k0 -> Constraint)
       (f4 :: k4 -> k3 -> k2 -> k1 -> k0) (a4 :: k4) (a3 :: k3) (a2 :: k2)
       (a1 :: k1).
Dict4 c f4 =>
Sing a4
-> Sing a3 -> Sing a2 -> Sing a1 -> Dict (c (f4 a4 a3 a2 a1))
dict4 Sing a
sa4 Sing a
sa3 Sing a
sa2 Sing a
sa1 :: Dict (Bin.Binary (f a4 a3 a2 a1)) of
              Dict (Binary (f a a a a))
Dict -> do
                f a a a a
x :: f a4 a3 a2 a1 <- forall t. Binary t => Get t
Bin.get
                forall (f :: * -> *) a. Applicative f => a -> f a
pure (forall k4 k3 k2 k1 (f4 :: k4 -> k3 -> k2 -> k1 -> *) (a4 :: k4)
       (a3 :: k3) (a2 :: k2) (a1 :: k1).
Sing a4
-> Sing a3 -> Sing a2 -> Sing a1 -> f4 a4 a3 a2 a1 -> Some4 f4
Some4 Sing a
sa4 Sing a
sa3 Sing a
sa2 Sing a
sa1 f a a a a
x)

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

instance (Bin.Binary (l a1), Bin.Binary (r a1)) => Bin.Binary (S1 l r a1)
instance (Bin.Binary (l a2 a1), Bin.Binary (r a2 a1)) => Bin.Binary (S2 l r a2 a1)
instance (Bin.Binary (l a3 a2 a1), Bin.Binary (r a3 a2 a1)) => Bin.Binary (S3 l r a3 a2 a1)
instance (Bin.Binary (l a4 a3 a2 a1), Bin.Binary (r a4 a3 a2 a1)) => Bin.Binary (S4 l r a4 a3 a2 a1)

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

instance (Bin.Binary (l a1), Bin.Binary (r a1)) => Bin.Binary (P1 l r a1)
instance (Bin.Binary (l a2 a1), Bin.Binary (r a2 a1)) => Bin.Binary (P2 l r a2 a1)
instance (Bin.Binary (l a3 a2 a1), Bin.Binary (r a3 a2 a1)) => Bin.Binary (P3 l r a3 a2 a1)
instance (Bin.Binary (l a4 a3 a2 a1), Bin.Binary (r a4 a3 a2 a1)) => Bin.Binary (P4 l r a4 a3 a2 a1)