{-# LANGUAGE DeriveDataTypeable         #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE StrictData                 #-}
{-# LANGUAGE Trustworthy                #-}

--------------------------------------------------------------------
-- |
-- Module    : Data.MessagePack.Types.Assoc
-- Copyright : (c) Daiki Handa, 2010-2011
-- License   : BSD3
--
-- Maintainer:  tanaka.hideyuki@gmail.com
-- Stability :  experimental
-- Portability: portable
--
-- MessagePack map labeling type
--
--------------------------------------------------------------------

module Data.MessagePack.Types.Assoc
    ( Assoc (..)
    ) where

import           Control.Applicative       ((<$>))
import           Control.DeepSeq           (NFData)
import           Data.Typeable             (Typeable)
import           Test.QuickCheck.Arbitrary (Arbitrary, arbitrary)

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

instance Arbitrary a => Arbitrary (Assoc a) where
    arbitrary :: Gen (Assoc a)
arbitrary = a -> Assoc a
forall a. a -> Assoc a
Assoc (a -> Assoc a) -> Gen a -> Gen (Assoc a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Gen a
forall a. Arbitrary a => Gen a
arbitrary