-- | Internal module. Not part of the public API.
module Data.PackStream.Assoc (
  Assoc(..)
  ) where

import           Compat.Prelude

import           Data.Kind (Type)

-- | Newtype wrapper for associative (dictionary-like) PackStream encoding.
--
-- not defined for general Functor for performance reason.
-- (ie. you would want to write custom instances for each type using specialized mapM-like functions)
type Assoc :: Type -> Type
type role Assoc representational
newtype Assoc a
  = Assoc { forall a. Assoc a -> a
unAssoc :: a }
  deriving stock (Int -> Assoc a -> ShowS
[Assoc a] -> ShowS
Assoc a -> String
(Int -> Assoc a -> ShowS)
-> (Assoc a -> String) -> ([Assoc a] -> ShowS) -> Show (Assoc a)
forall a. Show a => Int -> Assoc a -> ShowS
forall a. Show a => [Assoc a] -> ShowS
forall a. Show a => Assoc a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: forall a. Show a => Int -> Assoc a -> ShowS
showsPrec :: Int -> Assoc a -> ShowS
$cshow :: forall a. Show a => Assoc a -> String
show :: Assoc a -> String
$cshowList :: forall a. Show a => [Assoc a] -> ShowS
showList :: [Assoc a] -> ShowS
Show, ReadPrec [Assoc a]
ReadPrec (Assoc a)
Int -> ReadS (Assoc a)
ReadS [Assoc a]
(Int -> ReadS (Assoc a))
-> ReadS [Assoc a]
-> ReadPrec (Assoc a)
-> ReadPrec [Assoc a]
-> Read (Assoc a)
forall a. Read a => ReadPrec [Assoc a]
forall a. Read a => ReadPrec (Assoc a)
forall a. Read a => Int -> ReadS (Assoc a)
forall a. Read a => ReadS [Assoc a]
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
$creadsPrec :: forall a. Read a => Int -> ReadS (Assoc a)
readsPrec :: Int -> ReadS (Assoc a)
$creadList :: forall a. Read a => ReadS [Assoc a]
readList :: ReadS [Assoc a]
$creadPrec :: forall a. Read a => ReadPrec (Assoc a)
readPrec :: ReadPrec (Assoc a)
$creadListPrec :: forall a. Read a => ReadPrec [Assoc a]
readListPrec :: ReadPrec [Assoc a]
Read, Assoc a -> Assoc a -> Bool
(Assoc a -> Assoc a -> Bool)
-> (Assoc a -> Assoc a -> Bool) -> Eq (Assoc a)
forall a. Eq a => Assoc a -> Assoc a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: forall a. Eq a => Assoc a -> Assoc a -> Bool
== :: Assoc a -> Assoc a -> Bool
$c/= :: forall a. Eq a => Assoc a -> Assoc a -> Bool
/= :: Assoc a -> Assoc a -> Bool
Eq, Eq (Assoc a)
Eq (Assoc a) =>
(Assoc a -> Assoc a -> Ordering)
-> (Assoc a -> Assoc a -> Bool)
-> (Assoc a -> Assoc a -> Bool)
-> (Assoc a -> Assoc a -> Bool)
-> (Assoc a -> Assoc a -> Bool)
-> (Assoc a -> Assoc a -> Assoc a)
-> (Assoc a -> Assoc a -> Assoc a)
-> Ord (Assoc a)
Assoc a -> Assoc a -> Bool
Assoc a -> Assoc a -> Ordering
Assoc a -> Assoc a -> Assoc a
forall a.
Eq a =>
(a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall a. Ord a => Eq (Assoc a)
forall a. Ord a => Assoc a -> Assoc a -> Bool
forall a. Ord a => Assoc a -> Assoc a -> Ordering
forall a. Ord a => Assoc a -> Assoc a -> Assoc a
$ccompare :: forall a. Ord a => Assoc a -> Assoc a -> Ordering
compare :: Assoc a -> Assoc a -> Ordering
$c< :: forall a. Ord a => Assoc a -> Assoc a -> Bool
< :: Assoc a -> Assoc a -> Bool
$c<= :: forall a. Ord a => Assoc a -> Assoc a -> Bool
<= :: Assoc a -> Assoc a -> Bool
$c> :: forall a. Ord a => Assoc a -> Assoc a -> Bool
> :: Assoc a -> Assoc a -> Bool
$c>= :: forall a. Ord a => Assoc a -> Assoc a -> Bool
>= :: Assoc a -> Assoc a -> Bool
$cmax :: forall a. Ord a => Assoc a -> Assoc a -> Assoc a
max :: Assoc a -> Assoc a -> Assoc a
$cmin :: forall a. Ord a => Assoc a -> Assoc a -> Assoc a
min :: Assoc a -> Assoc a -> Assoc a
Ord)
  deriving newtype Assoc a -> ()
(Assoc a -> ()) -> NFData (Assoc a)
forall a. NFData a => Assoc a -> ()
forall a. (a -> ()) -> NFData a
$crnf :: forall a. NFData a => Assoc a -> ()
rnf :: Assoc a -> ()
NFData