{-# LANGUAGE UndecidableInstances #-}

module Binrep.Example where

import Binrep
import Binrep.Generic
import Binrep.Generic qualified as BR
import Binrep.Type.Common ( Endianness(..) )
import Binrep.Type.Int

import GHC.Generics ( Generic )
import Data.Data ( Data )

import Data.Void ( Void )

data DV
    deriving stock (forall x. Rep DV x -> DV
forall x. DV -> Rep DV x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep DV x -> DV
$cfrom :: forall x. DV -> Rep DV x
Generic, Typeable DV
DV -> DataType
DV -> Constr
(forall b. Data b => b -> b) -> DV -> DV
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> DV -> u
forall u. (forall d. Data d => d -> u) -> DV -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DV -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DV -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DV -> m DV
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DV -> m DV
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DV
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DV -> c DV
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DV)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DV)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DV -> m DV
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DV -> m DV
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DV -> m DV
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DV -> m DV
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DV -> m DV
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DV -> m DV
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DV -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DV -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> DV -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> DV -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DV -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DV -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DV -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DV -> r
gmapT :: (forall b. Data b => b -> b) -> DV -> DV
$cgmapT :: (forall b. Data b => b -> b) -> DV -> DV
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DV)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DV)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DV)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DV)
dataTypeOf :: DV -> DataType
$cdataTypeOf :: DV -> DataType
toConstr :: DV -> Constr
$ctoConstr :: DV -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DV
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DV
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DV -> c DV
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DV -> c DV
Data)

-- Disallowed. No binrepping void datatypes.
{-
instance BLen DV where blen = blenGeneric BR.cNoSum
instance Put  DV where put  = putGeneric  BR.cNoSum
instance Get  DV where get  = getGeneric  BR.cNoSum
-}

data DU = DU
    deriving stock (forall x. Rep DU x -> DU
forall x. DU -> Rep DU x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep DU x -> DU
$cfrom :: forall x. DU -> Rep DU x
Generic, Typeable DU
DU -> DataType
DU -> Constr
(forall b. Data b => b -> b) -> DU -> DU
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> DU -> u
forall u. (forall d. Data d => d -> u) -> DU -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DU -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DU -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DU -> m DU
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DU -> m DU
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DU
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DU -> c DU
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DU)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DU)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DU -> m DU
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DU -> m DU
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DU -> m DU
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DU -> m DU
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DU -> m DU
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DU -> m DU
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DU -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DU -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> DU -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> DU -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DU -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DU -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DU -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DU -> r
gmapT :: (forall b. Data b => b -> b) -> DU -> DU
$cgmapT :: (forall b. Data b => b -> b) -> DU -> DU
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DU)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DU)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DU)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DU)
dataTypeOf :: DU -> DataType
$cdataTypeOf :: DU -> DataType
toConstr :: DU -> Constr
$ctoConstr :: DU -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DU
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DU
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DU -> c DU
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DU -> c DU
Data, Int -> DU -> ShowS
[DU] -> ShowS
DU -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [DU] -> ShowS
$cshowList :: [DU] -> ShowS
show :: DU -> String
$cshow :: DU -> String
showsPrec :: Int -> DU -> ShowS
$cshowsPrec :: Int -> DU -> ShowS
Show, DU -> DU -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: DU -> DU -> Bool
$c/= :: DU -> DU -> Bool
== :: DU -> DU -> Bool
$c== :: DU -> DU -> Bool
Eq)

--instance BLen DU where blen = blenGeneric BR.cNoSum
instance BLen DU where type CBLen DU = CBLenGeneric Void DU
instance Put  DU where put :: DU -> Builder
put  = forall a w.
(Generic a, GPut (Rep a), Put w) =>
Cfg w -> a -> Builder
putGeneric  Cfg Void
cNoSum
instance Get  DU where get :: Getter DU
get  = forall a w. (Generic a, GGetD (Rep a), Get w) => Cfg w -> Getter a
getGeneric  Cfg Void
cNoSum

data DSS = DSS
  { DSS -> BrSumDCS
dss1 :: I 'U 'I1 'LE
  , DSS -> I 'U 'I2 'LE
dss2 :: I 'U 'I2 'LE
  , DSS -> I 'U 'I4 'LE
dss3 :: I 'U 'I4 'LE
  , DSS -> I 'U 'I8 'LE
dss4 :: I 'U 'I8 'LE
  , DSS -> BrSumDCS
dss5 :: I 'U 'I1 'LE
  } deriving stock (forall x. Rep DSS x -> DSS
forall x. DSS -> Rep DSS x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep DSS x -> DSS
$cfrom :: forall x. DSS -> Rep DSS x
Generic, Typeable DSS
DSS -> DataType
DSS -> Constr
(forall b. Data b => b -> b) -> DSS -> DSS
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> DSS -> u
forall u. (forall d. Data d => d -> u) -> DSS -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DSS -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DSS -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DSS -> m DSS
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DSS -> m DSS
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DSS
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DSS -> c DSS
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DSS)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DSS)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DSS -> m DSS
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DSS -> m DSS
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DSS -> m DSS
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DSS -> m DSS
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DSS -> m DSS
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DSS -> m DSS
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DSS -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DSS -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> DSS -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> DSS -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DSS -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DSS -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DSS -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DSS -> r
gmapT :: (forall b. Data b => b -> b) -> DSS -> DSS
$cgmapT :: (forall b. Data b => b -> b) -> DSS -> DSS
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DSS)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DSS)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DSS)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DSS)
dataTypeOf :: DSS -> DataType
$cdataTypeOf :: DSS -> DataType
toConstr :: DSS -> Constr
$ctoConstr :: DSS -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DSS
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DSS
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DSS -> c DSS
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DSS -> c DSS
Data, Int -> DSS -> ShowS
[DSS] -> ShowS
DSS -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [DSS] -> ShowS
$cshowList :: [DSS] -> ShowS
show :: DSS -> String
$cshow :: DSS -> String
showsPrec :: Int -> DSS -> ShowS
$cshowsPrec :: Int -> DSS -> ShowS
Show, DSS -> DSS -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: DSS -> DSS -> Bool
$c/= :: DSS -> DSS -> Bool
== :: DSS -> DSS -> Bool
$c== :: DSS -> DSS -> Bool
Eq)

instance BLen DSS where blen :: DSS -> Int
blen = forall a w. (Generic a, GBLen (Rep a), BLen w) => Cfg w -> a -> Int
blenGeneric Cfg Void
cNoSum
--instance BLen DSS where type CBLen DSS = CBLenGeneric Void DSS
instance Put  DSS where put :: DSS -> Builder
put  = forall a w.
(Generic a, GPut (Rep a), Put w) =>
Cfg w -> a -> Builder
putGeneric  Cfg Void
cNoSum
instance Get  DSS where get :: Getter DSS
get  = forall a w. (Generic a, GGetD (Rep a), Get w) => Cfg w -> Getter a
getGeneric  Cfg Void
cNoSum

data DCS = DCS1 {- DSS -} | DCS2 | DCS3 | DCS4 | DCS5
    deriving stock (forall x. Rep DCS x -> DCS
forall x. DCS -> Rep DCS x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep DCS x -> DCS
$cfrom :: forall x. DCS -> Rep DCS x
Generic, Typeable DCS
DCS -> DataType
DCS -> Constr
(forall b. Data b => b -> b) -> DCS -> DCS
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> DCS -> u
forall u. (forall d. Data d => d -> u) -> DCS -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DCS -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DCS -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DCS -> m DCS
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DCS -> m DCS
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DCS
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DCS -> c DCS
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DCS)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DCS)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DCS -> m DCS
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DCS -> m DCS
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DCS -> m DCS
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DCS -> m DCS
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DCS -> m DCS
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DCS -> m DCS
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DCS -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DCS -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> DCS -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> DCS -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DCS -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DCS -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DCS -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DCS -> r
gmapT :: (forall b. Data b => b -> b) -> DCS -> DCS
$cgmapT :: (forall b. Data b => b -> b) -> DCS -> DCS
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DCS)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DCS)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DCS)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DCS)
dataTypeOf :: DCS -> DataType
$cdataTypeOf :: DCS -> DataType
toConstr :: DCS -> Constr
$ctoConstr :: DCS -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DCS
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DCS
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DCS -> c DCS
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DCS -> c DCS
Data, Int -> DCS -> ShowS
[DCS] -> ShowS
DCS -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [DCS] -> ShowS
$cshowList :: [DCS] -> ShowS
show :: DCS -> String
$cshow :: DCS -> String
showsPrec :: Int -> DCS -> ShowS
$cshowsPrec :: Int -> DCS -> ShowS
Show, DCS -> DCS -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: DCS -> DCS -> Bool
$c/= :: DCS -> DCS -> Bool
== :: DCS -> DCS -> Bool
$c== :: DCS -> DCS -> Bool
Eq)

type BrSumDCS = I 'U 'I1 'LE
brCfgDCS :: BR.Cfg BrSumDCS
brCfgDCS :: Cfg BrSumDCS
brCfgDCS = forall a. (Eq a, Show a) => (String -> a) -> Cfg a
BR.cfg forall a b. (a -> b) -> a -> b
$ forall a. Integral a => ShowS -> String -> a
BR.cSumTagHex forall a b. (a -> b) -> a -> b
$ forall a. Int -> [a] -> [a]
drop Int
3

--instance BLen DCS where blen = BR.blenGeneric brCfgDCS
instance BLen DCS where type CBLen DCS = CBLenGeneric BrSumDCS DCS
instance Put  DCS where put :: DCS -> Builder
put  = forall a w.
(Generic a, GPut (Rep a), Put w) =>
Cfg w -> a -> Builder
putGeneric  Cfg BrSumDCS
brCfgDCS
instance Get  DCS where get :: Getter DCS
get  = forall a w. (Generic a, GGetD (Rep a), Get w) => Cfg w -> Getter a
getGeneric  Cfg BrSumDCS
brCfgDCS

data DX = DX DU
    deriving stock (forall x. Rep DX x -> DX
forall x. DX -> Rep DX x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep DX x -> DX
$cfrom :: forall x. DX -> Rep DX x
Generic, Typeable DX
DX -> DataType
DX -> Constr
(forall b. Data b => b -> b) -> DX -> DX
forall a.
Typeable a
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> DX -> u
forall u. (forall d. Data d => d -> u) -> DX -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DX -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DX -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DX -> m DX
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DX -> m DX
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DX
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DX -> c DX
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DX)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DX)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DX -> m DX
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DX -> m DX
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DX -> m DX
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> DX -> m DX
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DX -> m DX
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> DX -> m DX
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DX -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> DX -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> DX -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> DX -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DX -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DX -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DX -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DX -> r
gmapT :: (forall b. Data b => b -> b) -> DX -> DX
$cgmapT :: (forall b. Data b => b -> b) -> DX -> DX
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DX)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DX)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DX)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c DX)
dataTypeOf :: DX -> DataType
$cdataTypeOf :: DX -> DataType
toConstr :: DX -> Constr
$ctoConstr :: DX -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DX
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c DX
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DX -> c DX
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> DX -> c DX
Data, Int -> DX -> ShowS
[DX] -> ShowS
DX -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [DX] -> ShowS
$cshowList :: [DX] -> ShowS
show :: DX -> String
$cshow :: DX -> String
showsPrec :: Int -> DX -> ShowS
$cshowsPrec :: Int -> DX -> ShowS
Show, DX -> DX -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: DX -> DX -> Bool
$c/= :: DX -> DX -> Bool
== :: DX -> DX -> Bool
$c== :: DX -> DX -> Bool
Eq)

--instance BLen DX where blen = blenGeneric brCfgNoSum
instance BLen DX where type CBLen DX = CBLenGeneric Void DX
instance Put  DX where put :: DX -> Builder
put  = forall a w.
(Generic a, GPut (Rep a), Put w) =>
Cfg w -> a -> Builder
putGeneric  Cfg Void
cNoSum
instance Get  DX where get :: Getter DX
get  = forall a w. (Generic a, GGetD (Rep a), Get w) => Cfg w -> Getter a
getGeneric  Cfg Void
cNoSum