{-# LANGUAGE DataKinds #-}
{-# LANGUAGE DeriveAnyClass #-}
{-# LANGUAGE DeriveDataTypeable #-}
{-# LANGUAGE DeriveGeneric #-}
{-# LANGUAGE DerivingVia #-}
{-# LANGUAGE FlexibleInstances #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE StandaloneDeriving #-}

module Internal.Test.QuickCheck.Quid.Representations.Hexadecimal
    ( Hexadecimal (..)
    )
    where

import Control.DeepSeq
    ( NFData )
import Data.Bifunctor
    ( first )
import Data.Data
    ( Data )
import Data.Hashable
    ( Hashable (..) )
import GHC.Generics
    ( Generic )
import Internal.Test.QuickCheck.Quid
    ( Quid (..) )
import Internal.Test.QuickCheck.Quid.Combinators.Prefix
    ( Prefix (..) )
import Numeric
    ( readHex, showHex )
import Numeric.Natural
    ( Natural )
import Test.QuickCheck
    ( Function )

--------------------------------------------------------------------------------
-- Hexadecimal representation
--------------------------------------------------------------------------------

newtype Hexadecimal a = Hexadecimal { forall a. Hexadecimal a -> a
unHexadecimal :: a }
    deriving stock (Hexadecimal a -> DataType
Hexadecimal a -> Constr
forall {a}. Data a => Typeable (Hexadecimal a)
forall a. Data a => Hexadecimal a -> DataType
forall a. Data a => Hexadecimal a -> Constr
forall a.
Data a =>
(forall b. Data b => b -> b) -> Hexadecimal a -> Hexadecimal a
forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> Hexadecimal a -> u
forall a u.
Data a =>
(forall d. Data d => d -> u) -> Hexadecimal a -> [u]
forall a r r'.
Data a =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Hexadecimal a -> r
forall a r r'.
Data a =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Hexadecimal a -> r
forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d)
-> Hexadecimal a -> m (Hexadecimal a)
forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Hexadecimal a -> m (Hexadecimal a)
forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Hexadecimal a)
forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Hexadecimal a -> c (Hexadecimal a)
forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Hexadecimal a))
forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Hexadecimal a))
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 (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Hexadecimal a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Hexadecimal a -> c (Hexadecimal a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Hexadecimal a))
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Hexadecimal a -> m (Hexadecimal a)
$cgmapMo :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Hexadecimal a -> m (Hexadecimal a)
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d)
-> Hexadecimal a -> m (Hexadecimal a)
$cgmapMp :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d)
-> Hexadecimal a -> m (Hexadecimal a)
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d)
-> Hexadecimal a -> m (Hexadecimal a)
$cgmapM :: forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d)
-> Hexadecimal a -> m (Hexadecimal a)
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Hexadecimal a -> u
$cgmapQi :: forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> Hexadecimal a -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Hexadecimal a -> [u]
$cgmapQ :: forall a u.
Data a =>
(forall d. Data d => d -> u) -> Hexadecimal a -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Hexadecimal a -> r
$cgmapQr :: forall a r r'.
Data a =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Hexadecimal a -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Hexadecimal a -> r
$cgmapQl :: forall a r r'.
Data a =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Hexadecimal a -> r
gmapT :: (forall b. Data b => b -> b) -> Hexadecimal a -> Hexadecimal a
$cgmapT :: forall a.
Data a =>
(forall b. Data b => b -> b) -> Hexadecimal a -> Hexadecimal a
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Hexadecimal a))
$cdataCast2 :: forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Hexadecimal a))
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Hexadecimal a))
$cdataCast1 :: forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Hexadecimal a))
dataTypeOf :: Hexadecimal a -> DataType
$cdataTypeOf :: forall a. Data a => Hexadecimal a -> DataType
toConstr :: Hexadecimal a -> Constr
$ctoConstr :: forall a. Data a => Hexadecimal a -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Hexadecimal a)
$cgunfold :: forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Hexadecimal a)
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Hexadecimal a -> c (Hexadecimal a)
$cgfoldl :: forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Hexadecimal a -> c (Hexadecimal a)
Data, Hexadecimal a -> Hexadecimal a -> Bool
forall a. Eq a => Hexadecimal a -> Hexadecimal a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Hexadecimal a -> Hexadecimal a -> Bool
$c/= :: forall a. Eq a => Hexadecimal a -> Hexadecimal a -> Bool
== :: Hexadecimal a -> Hexadecimal a -> Bool
$c== :: forall a. Eq a => Hexadecimal a -> Hexadecimal a -> Bool
Eq, forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (Hexadecimal a) x -> Hexadecimal a
forall a x. Hexadecimal a -> Rep (Hexadecimal a) x
$cto :: forall a x. Rep (Hexadecimal a) x -> Hexadecimal a
$cfrom :: forall a x. Hexadecimal a -> Rep (Hexadecimal a) x
Generic, Hexadecimal a -> Hexadecimal a -> Bool
Hexadecimal a -> Hexadecimal a -> Ordering
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 (Hexadecimal a)
forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Bool
forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Ordering
forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Hexadecimal a
min :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a
$cmin :: forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Hexadecimal a
max :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a
$cmax :: forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Hexadecimal a
>= :: Hexadecimal a -> Hexadecimal a -> Bool
$c>= :: forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Bool
> :: Hexadecimal a -> Hexadecimal a -> Bool
$c> :: forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Bool
<= :: Hexadecimal a -> Hexadecimal a -> Bool
$c<= :: forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Bool
< :: Hexadecimal a -> Hexadecimal a -> Bool
$c< :: forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Bool
compare :: Hexadecimal a -> Hexadecimal a -> Ordering
$ccompare :: forall a. Ord a => Hexadecimal a -> Hexadecimal a -> Ordering
Ord)
    deriving newtype (Int -> Hexadecimal a -> Int
Hexadecimal a -> Int
forall a. Eq a -> (Int -> a -> Int) -> (a -> Int) -> Hashable a
forall {a}. Hashable a => Eq (Hexadecimal a)
forall a. Hashable a => Int -> Hexadecimal a -> Int
forall a. Hashable a => Hexadecimal a -> Int
hash :: Hexadecimal a -> Int
$chash :: forall a. Hashable a => Hexadecimal a -> Int
hashWithSalt :: Int -> Hexadecimal a -> Int
$chashWithSalt :: forall a. Hashable a => Int -> Hexadecimal a -> Int
Hashable, Hexadecimal a -> ()
forall a. NFData a => Hexadecimal a -> ()
forall a. (a -> ()) -> NFData a
rnf :: Hexadecimal a -> ()
$crnf :: forall a. NFData a => Hexadecimal a -> ()
NFData, Integer -> Hexadecimal a
Hexadecimal a -> Hexadecimal a
Hexadecimal a -> Hexadecimal a -> Hexadecimal a
forall a. Num a => Integer -> Hexadecimal a
forall a. Num a => Hexadecimal a -> Hexadecimal a
forall a. Num a => Hexadecimal a -> Hexadecimal a -> Hexadecimal a
forall a.
(a -> a -> a)
-> (a -> a -> a)
-> (a -> a -> a)
-> (a -> a)
-> (a -> a)
-> (a -> a)
-> (Integer -> a)
-> Num a
fromInteger :: Integer -> Hexadecimal a
$cfromInteger :: forall a. Num a => Integer -> Hexadecimal a
signum :: Hexadecimal a -> Hexadecimal a
$csignum :: forall a. Num a => Hexadecimal a -> Hexadecimal a
abs :: Hexadecimal a -> Hexadecimal a
$cabs :: forall a. Num a => Hexadecimal a -> Hexadecimal a
negate :: Hexadecimal a -> Hexadecimal a
$cnegate :: forall a. Num a => Hexadecimal a -> Hexadecimal a
* :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a
$c* :: forall a. Num a => Hexadecimal a -> Hexadecimal a -> Hexadecimal a
- :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a
$c- :: forall a. Num a => Hexadecimal a -> Hexadecimal a -> Hexadecimal a
+ :: Hexadecimal a -> Hexadecimal a -> Hexadecimal a
$c+ :: forall a. Num a => Hexadecimal a -> Hexadecimal a -> Hexadecimal a
Num)
    deriving anyclass forall a b.
Function a =>
(Hexadecimal a -> b) -> Hexadecimal a :-> b
forall a. (forall b. (a -> b) -> a :-> b) -> Function a
function :: forall b. (Hexadecimal a -> b) -> Hexadecimal a :-> b
$cfunction :: forall a b.
Function a =>
(Hexadecimal a -> b) -> Hexadecimal a :-> b
Function

deriving via Prefix "0x" (AsHex Natural) instance Read (Hexadecimal Quid)
deriving via Prefix "0x" (AsHex Natural) instance Show (Hexadecimal Quid)

newtype AsHex a = AsHex a

instance (Eq a, Num a) => Read (AsHex a) where
    readsPrec :: Int -> ReadS (AsHex a)
readsPrec Int
_ = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (forall (p :: * -> * -> *) a b c.
Bifunctor p =>
(a -> b) -> p a c -> p b c
first forall a. a -> AsHex a
AsHex) forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> forall a. (Eq a, Num a) => ReadS a
readHex

instance (Integral a, Show a) => Show (AsHex a) where
    show :: AsHex a -> String
show (AsHex a
n) = forall a. (Integral a, Show a) => a -> ShowS
showHex a
n String
""