{-# LANGUAGE DerivingVia          #-}
{-# LANGUAGE FlexibleContexts     #-}
{-# LANGUAGE StandaloneDeriving   #-}
{-# LANGUAGE TypeFamilies         #-}
{-# LANGUAGE UndecidableInstances #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
-- | Module with binary instances for data types defined in fixed
--   vector
module Data.Vector.Fixed.Instances.Binary where

import           Data.Vector.Fixed             (Arity,ArityPeano,ViaFixed(..),Vector)
import qualified Data.Vector.Fixed           as F
import qualified Data.Vector.Fixed.Boxed     as FB
import qualified Data.Vector.Fixed.Strict    as FF
import qualified Data.Vector.Fixed.Unboxed   as FU
import qualified Data.Vector.Fixed.Primitive as FP
import qualified Data.Vector.Fixed.Storable  as FS
import           Data.Binary                   (Binary(..))

instance (Vector v a, Binary a) => Binary (ViaFixed v a) where
  put :: ViaFixed v a -> Put
put = (a -> Put) -> ViaFixed v a -> Put
forall (v :: * -> *) a (f :: * -> *) b.
(Vector v a, Applicative f) =>
(a -> f b) -> v a -> f ()
F.mapM_ a -> Put
forall t. Binary t => t -> Put
put
  get :: Get (ViaFixed v a)
get = Get a -> Get (ViaFixed v a)
forall (v :: * -> *) a (f :: * -> *).
(Vector v a, Applicative f) =>
f a -> f (v a)
F.replicateM Get a
forall t. Binary t => Get t
get
  {-# INLINE put #-}
  {-# INLINE get #-}

deriving via ViaFixed (FB.Vec n) a instance (Arity n, Binary a)                => Binary (FB.Vec n a)
deriving via ViaFixed (FF.Vec n) a instance (Arity n, Binary a)                => Binary (FF.Vec n a)
deriving via ViaFixed (FP.Vec n) a instance (Arity n, Binary a, FP.Prim a)     => Binary (FP.Vec n a)
deriving via ViaFixed (FS.Vec n) a instance (Arity n, Binary a, FS.Storable a) => Binary (FS.Vec n a)
deriving via ViaFixed (FU.Vec n) a instance (Arity n, Binary a, FU.Unbox n a)  => Binary (FU.Vec n a)

deriving via ViaFixed (F.VecList  n) a instance (Arity n,      Binary a) => Binary (F.VecList  n a)
deriving via ViaFixed (F.VecPeano n) a instance (ArityPeano n, Binary a) => Binary (F.VecPeano n a)

instance (Binary a) => Binary (F.Only a) where
  put :: Only a -> Put
put (F.Only a
a) = a -> Put
forall t. Binary t => t -> Put
put a
a
  get :: Get (Only a)
get = a -> Only a
forall a. a -> Only a
F.Only (a -> Only a) -> Get a -> Get (Only a)
forall a b. (a -> b) -> Get a -> Get b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
`fmap` Get a
forall t. Binary t => Get t
get

instance Binary (F.Empty a) where
  put :: Empty a -> Put
put Empty a
_ = () -> Put
forall a. a -> PutM a
forall (m :: * -> *) a. Monad m => a -> m a
return ()
  get :: Get (Empty a)
get = Empty a -> Get (Empty a)
forall a. a -> Get a
forall (m :: * -> *) a. Monad m => a -> m a
return Empty a
forall {k} (a :: k). Empty a
F.Empty