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


-- | Combinators and utilities to make Generic-based deriving of Binary easier and more expressive
--   
--   Please see the README on GitHub at
--   <a>https://github.com/0xd34df00d/binary-generic-combinators#readme</a>
@package binary-generic-combinators
@version 0.4.0.0

module Data.Binary.Combinators
newtype Many a
Many :: [a] -> Many a
[getMany] :: Many a -> [a]
newtype Some a
Some :: [a] -> Some a
[getSome] :: Some a -> [a]
newtype CountedBy ty a
CountedBy :: [a] -> CountedBy ty a
[getCounted] :: CountedBy ty a -> [a]
data SkipCount ty (n :: Nat)
SkipCount :: SkipCount ty (n :: Nat)
data SkipByte (n :: Nat)
SkipByte :: SkipByte (n :: Nat)
data MatchBytes :: Symbol -> [Nat] -> Type
matchBytes :: MatchBytesSing ctx ns => MatchBytes ctx ns
instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.Binary.Combinators.Many a)
instance GHC.Classes.Eq a => GHC.Classes.Eq (Data.Binary.Combinators.Many a)
instance GHC.Classes.Ord a => GHC.Classes.Ord (Data.Binary.Combinators.Some a)
instance GHC.Classes.Eq a => GHC.Classes.Eq (Data.Binary.Combinators.Some a)
instance forall k (ty :: k) a. GHC.Classes.Ord a => GHC.Classes.Ord (Data.Binary.Combinators.CountedBy ty a)
instance forall k (ty :: k) a. GHC.Classes.Eq a => GHC.Classes.Eq (Data.Binary.Combinators.CountedBy ty a)
instance forall k (ty :: k) (n :: GHC.Types.Nat). GHC.Show.Show (Data.Binary.Combinators.SkipCount ty n)
instance forall k (ty :: k) (n :: GHC.Types.Nat). GHC.Classes.Ord (Data.Binary.Combinators.SkipCount ty n)
instance forall k (ty :: k) (n :: GHC.Types.Nat). GHC.Classes.Eq (Data.Binary.Combinators.SkipCount ty n)
instance GHC.Show.Show (Data.Binary.Combinators.SkipByte n)
instance GHC.Classes.Ord (Data.Binary.Combinators.SkipByte n)
instance GHC.Classes.Eq (Data.Binary.Combinators.SkipByte n)
instance GHC.Classes.Eq (Data.Binary.Combinators.MatchBytes s ns)
instance GHC.Classes.Ord (Data.Binary.Combinators.MatchBytes s ns)
instance Data.Binary.Combinators.MatchBytesSing ctx '[]
instance (GHC.TypeNats.KnownNat n, Data.Binary.Combinators.MatchBytesSing ctx ns) => Data.Binary.Combinators.MatchBytesSing ctx (n : ns)
instance Data.Binary.Combinators.MatchBytesSing ctx ns => Test.QuickCheck.Arbitrary.Arbitrary (Data.Binary.Combinators.MatchBytes ctx ns)
instance Data.Binary.Class.Binary (Data.Binary.Combinators.MatchBytes ctx '[])
instance (GHC.TypeLits.KnownSymbol ctx, GHC.TypeNats.KnownNat n, Data.Binary.Class.Binary (Data.Binary.Combinators.MatchBytes ctx ns)) => Data.Binary.Class.Binary (Data.Binary.Combinators.MatchBytes ctx (n : ns))
instance GHC.Show.Show (Data.Binary.Combinators.MatchBytes ctx ns)
instance GHC.TypeNats.KnownNat n => Data.Binary.Class.Binary (Data.Binary.Combinators.SkipByte n)
instance Test.QuickCheck.Arbitrary.Arbitrary (Data.Binary.Combinators.SkipByte n)
instance (GHC.Num.Num ty, Data.Binary.Class.Binary ty, GHC.TypeNats.KnownNat n) => Data.Binary.Class.Binary (Data.Binary.Combinators.SkipCount ty n)
instance forall k (ty :: k) (n :: GHC.Types.Nat). Test.QuickCheck.Arbitrary.Arbitrary (Data.Binary.Combinators.SkipCount ty n)
instance forall k a (ty :: k). GHC.Show.Show a => GHC.Show.Show (Data.Binary.Combinators.CountedBy ty a)
instance (GHC.Real.Integral ty, Data.Binary.Class.Binary ty, Data.Binary.Class.Binary a) => Data.Binary.Class.Binary (Data.Binary.Combinators.CountedBy ty a)
instance forall k a (ty :: k). Test.QuickCheck.Arbitrary.Arbitrary a => Test.QuickCheck.Arbitrary.Arbitrary (Data.Binary.Combinators.CountedBy ty a)
instance GHC.Show.Show a => GHC.Show.Show (Data.Binary.Combinators.Some a)
instance Data.Binary.Class.Binary a => Data.Binary.Class.Binary (Data.Binary.Combinators.Some a)
instance Test.QuickCheck.Arbitrary.Arbitrary a => Test.QuickCheck.Arbitrary.Arbitrary (Data.Binary.Combinators.Some a)
instance GHC.Show.Show a => GHC.Show.Show (Data.Binary.Combinators.Many a)
instance Data.Binary.Class.Binary a => Data.Binary.Class.Binary (Data.Binary.Combinators.Many a)
instance Test.QuickCheck.Arbitrary.Arbitrary a => Test.QuickCheck.Arbitrary.Arbitrary (Data.Binary.Combinators.Many a)

module Data.Binary.DerivingVia
newtype Alternatively a
Alternatively :: a -> Alternatively a
[getAlt] :: Alternatively a -> a
instance Data.Binary.Class.Binary grecord => Data.Binary.DerivingVia.GAltBinary (GHC.Generics.K1 i grecord)
instance Data.Binary.DerivingVia.GAltBinary grecord => Data.Binary.DerivingVia.GAltBinary (GHC.Generics.M1 i t grecord)
instance (Data.Binary.DerivingVia.GAltBinary l, Data.Binary.DerivingVia.GAltBinary r) => Data.Binary.DerivingVia.GAltBinary (l GHC.Generics.:*: r)
instance (Data.Binary.DerivingVia.GAltBinary l, Data.Binary.DerivingVia.GAltBinary r) => Data.Binary.DerivingVia.GAltBinary (l GHC.Generics.:+: r)
instance (GHC.Generics.Generic a, Data.Binary.DerivingVia.GAltBinary (GHC.Generics.Rep a)) => Data.Binary.Class.Binary (Data.Binary.DerivingVia.Alternatively a)