{-# LANGUAGE DeriveDataTypeable, DeriveGeneric, Safe #-}
module Data.Char.Private.Klingon (
Klingon(
A, B, Ch, D, E, Gh, H, I, J, L, M, N, Ng, O, P
, Q, QUpper, R, S, T, Tlh, U, V, W, Y, GlottalStop
, Zero, One, Two, Three, Four, Five, Six, Seven
, Eight, Nine, Comma, FullStop, Mummification
)
) where
import Control.DeepSeq(NFData)
import Data.Char(chr, ord)
import Data.Char.Core(UnicodeCharacter(toUnicodeChar, fromUnicodeChar, fromUnicodeChar'), UnicodeText)
import Data.Data(Data)
import Data.Hashable(Hashable)
import GHC.Generics(Generic)
import Test.QuickCheck.Arbitrary(Arbitrary(arbitrary), arbitraryBoundedEnum)
data Klingon
= A
| B
| Ch
| D
| E
| Gh
| H
| I
| J
| L
| M
| N
| Ng
| O
| P
| Q
| QUpper
| R
| S
| T
| Tlh
| U
| V
| W
| Y
| GlottalStop
| Zero
| One
| Two
| Three
| Four
| Five
| Six
| Seven
| Eight
| Nine
| Comma
| FullStop
| Mummification
deriving (Klingon
Klingon -> Klingon -> Bounded Klingon
forall a. a -> a -> Bounded a
maxBound :: Klingon
$cmaxBound :: Klingon
minBound :: Klingon
$cminBound :: Klingon
Bounded, Typeable Klingon
DataType
Constr
Typeable Klingon
-> (forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Klingon -> c Klingon)
-> (forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Klingon)
-> (Klingon -> Constr)
-> (Klingon -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Klingon))
-> (forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Klingon))
-> ((forall b. Data b => b -> b) -> Klingon -> Klingon)
-> (forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Klingon -> r)
-> (forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Klingon -> r)
-> (forall u. (forall d. Data d => d -> u) -> Klingon -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Klingon -> u)
-> (forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Klingon -> m Klingon)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Klingon -> m Klingon)
-> (forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Klingon -> m Klingon)
-> Data Klingon
Klingon -> DataType
Klingon -> Constr
(forall b. Data b => b -> b) -> Klingon -> Klingon
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Klingon -> c Klingon
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Klingon
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 u. Int -> (forall d. Data d => d -> u) -> Klingon -> u
forall u. (forall d. Data d => d -> u) -> Klingon -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Klingon -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Klingon -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Klingon -> m Klingon
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Klingon -> m Klingon
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Klingon
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Klingon -> c Klingon
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Klingon)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Klingon)
$cMummification :: Constr
$cFullStop :: Constr
$cComma :: Constr
$cNine :: Constr
$cEight :: Constr
$cSeven :: Constr
$cSix :: Constr
$cFive :: Constr
$cFour :: Constr
$cThree :: Constr
$cTwo :: Constr
$cOne :: Constr
$cZero :: Constr
$cGlottalStop :: Constr
$cY :: Constr
$cW :: Constr
$cV :: Constr
$cU :: Constr
$cTlh :: Constr
$cT :: Constr
$cS :: Constr
$cR :: Constr
$cQUpper :: Constr
$cQ :: Constr
$cP :: Constr
$cO :: Constr
$cNg :: Constr
$cN :: Constr
$cM :: Constr
$cL :: Constr
$cJ :: Constr
$cI :: Constr
$cH :: Constr
$cGh :: Constr
$cE :: Constr
$cD :: Constr
$cCh :: Constr
$cB :: Constr
$cA :: Constr
$tKlingon :: DataType
gmapMo :: (forall d. Data d => d -> m d) -> Klingon -> m Klingon
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Klingon -> m Klingon
gmapMp :: (forall d. Data d => d -> m d) -> Klingon -> m Klingon
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Klingon -> m Klingon
gmapM :: (forall d. Data d => d -> m d) -> Klingon -> m Klingon
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Klingon -> m Klingon
gmapQi :: Int -> (forall d. Data d => d -> u) -> Klingon -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Klingon -> u
gmapQ :: (forall d. Data d => d -> u) -> Klingon -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Klingon -> [u]
gmapQr :: (r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Klingon -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Klingon -> r
gmapQl :: (r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Klingon -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Klingon -> r
gmapT :: (forall b. Data b => b -> b) -> Klingon -> Klingon
$cgmapT :: (forall b. Data b => b -> b) -> Klingon -> Klingon
dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Klingon)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Klingon)
dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c Klingon)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Klingon)
dataTypeOf :: Klingon -> DataType
$cdataTypeOf :: Klingon -> DataType
toConstr :: Klingon -> Constr
$ctoConstr :: Klingon -> Constr
gunfold :: (forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Klingon
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Klingon
gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Klingon -> c Klingon
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Klingon -> c Klingon
$cp1Data :: Typeable Klingon
Data, Int -> Klingon
Klingon -> Int
Klingon -> [Klingon]
Klingon -> Klingon
Klingon -> Klingon -> [Klingon]
Klingon -> Klingon -> Klingon -> [Klingon]
(Klingon -> Klingon)
-> (Klingon -> Klingon)
-> (Int -> Klingon)
-> (Klingon -> Int)
-> (Klingon -> [Klingon])
-> (Klingon -> Klingon -> [Klingon])
-> (Klingon -> Klingon -> [Klingon])
-> (Klingon -> Klingon -> Klingon -> [Klingon])
-> Enum Klingon
forall a.
(a -> a)
-> (a -> a)
-> (Int -> a)
-> (a -> Int)
-> (a -> [a])
-> (a -> a -> [a])
-> (a -> a -> [a])
-> (a -> a -> a -> [a])
-> Enum a
enumFromThenTo :: Klingon -> Klingon -> Klingon -> [Klingon]
$cenumFromThenTo :: Klingon -> Klingon -> Klingon -> [Klingon]
enumFromTo :: Klingon -> Klingon -> [Klingon]
$cenumFromTo :: Klingon -> Klingon -> [Klingon]
enumFromThen :: Klingon -> Klingon -> [Klingon]
$cenumFromThen :: Klingon -> Klingon -> [Klingon]
enumFrom :: Klingon -> [Klingon]
$cenumFrom :: Klingon -> [Klingon]
fromEnum :: Klingon -> Int
$cfromEnum :: Klingon -> Int
toEnum :: Int -> Klingon
$ctoEnum :: Int -> Klingon
pred :: Klingon -> Klingon
$cpred :: Klingon -> Klingon
succ :: Klingon -> Klingon
$csucc :: Klingon -> Klingon
Enum, Klingon -> Klingon -> Bool
(Klingon -> Klingon -> Bool)
-> (Klingon -> Klingon -> Bool) -> Eq Klingon
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Klingon -> Klingon -> Bool
$c/= :: Klingon -> Klingon -> Bool
== :: Klingon -> Klingon -> Bool
$c== :: Klingon -> Klingon -> Bool
Eq, (forall x. Klingon -> Rep Klingon x)
-> (forall x. Rep Klingon x -> Klingon) -> Generic Klingon
forall x. Rep Klingon x -> Klingon
forall x. Klingon -> Rep Klingon x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep Klingon x -> Klingon
$cfrom :: forall x. Klingon -> Rep Klingon x
Generic, Eq Klingon
Eq Klingon
-> (Klingon -> Klingon -> Ordering)
-> (Klingon -> Klingon -> Bool)
-> (Klingon -> Klingon -> Bool)
-> (Klingon -> Klingon -> Bool)
-> (Klingon -> Klingon -> Bool)
-> (Klingon -> Klingon -> Klingon)
-> (Klingon -> Klingon -> Klingon)
-> Ord Klingon
Klingon -> Klingon -> Bool
Klingon -> Klingon -> Ordering
Klingon -> Klingon -> Klingon
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
min :: Klingon -> Klingon -> Klingon
$cmin :: Klingon -> Klingon -> Klingon
max :: Klingon -> Klingon -> Klingon
$cmax :: Klingon -> Klingon -> Klingon
>= :: Klingon -> Klingon -> Bool
$c>= :: Klingon -> Klingon -> Bool
> :: Klingon -> Klingon -> Bool
$c> :: Klingon -> Klingon -> Bool
<= :: Klingon -> Klingon -> Bool
$c<= :: Klingon -> Klingon -> Bool
< :: Klingon -> Klingon -> Bool
$c< :: Klingon -> Klingon -> Bool
compare :: Klingon -> Klingon -> Ordering
$ccompare :: Klingon -> Klingon -> Ordering
$cp1Ord :: Eq Klingon
Ord, ReadPrec [Klingon]
ReadPrec Klingon
Int -> ReadS Klingon
ReadS [Klingon]
(Int -> ReadS Klingon)
-> ReadS [Klingon]
-> ReadPrec Klingon
-> ReadPrec [Klingon]
-> Read Klingon
forall a.
(Int -> ReadS a)
-> ReadS [a] -> ReadPrec a -> ReadPrec [a] -> Read a
readListPrec :: ReadPrec [Klingon]
$creadListPrec :: ReadPrec [Klingon]
readPrec :: ReadPrec Klingon
$creadPrec :: ReadPrec Klingon
readList :: ReadS [Klingon]
$creadList :: ReadS [Klingon]
readsPrec :: Int -> ReadS Klingon
$creadsPrec :: Int -> ReadS Klingon
Read, Int -> Klingon -> ShowS
[Klingon] -> ShowS
Klingon -> String
(Int -> Klingon -> ShowS)
-> (Klingon -> String) -> ([Klingon] -> ShowS) -> Show Klingon
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Klingon] -> ShowS
$cshowList :: [Klingon] -> ShowS
show :: Klingon -> String
$cshow :: Klingon -> String
showsPrec :: Int -> Klingon -> ShowS
$cshowsPrec :: Int -> Klingon -> ShowS
Show)
instance Arbitrary Klingon where
arbitrary :: Gen Klingon
arbitrary = Gen Klingon
forall a. (Bounded a, Enum a) => Gen a
arbitraryBoundedEnum
instance Hashable Klingon
instance NFData Klingon
instance UnicodeCharacter Klingon where
toUnicodeChar :: Klingon -> Char
toUnicodeChar Klingon
c
| Klingon
c Klingon -> Klingon -> Bool
forall a. Ord a => a -> a -> Bool
<= Klingon
GlottalStop = Int -> Char
chr (Int
0xf8d0 Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
ci)
| Klingon
c Klingon -> Klingon -> Bool
forall a. Ord a => a -> a -> Bool
<= Klingon
Nine = Int -> Char
chr (Int
0xf8d6 Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
ci)
| Bool
otherwise = Int -> Char
chr (Int
0xf8d9 Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
ci)
where ci :: Int
ci = Klingon -> Int
forall a. Enum a => a -> Int
fromEnum Klingon
c
fromUnicodeChar :: Char -> Maybe Klingon
fromUnicodeChar Char
c
| Char
c Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
< Char
'\xf8d0' = Maybe Klingon
forall a. Maybe a
Nothing
| Char
c Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
< Char
'\xf8ea' = Klingon -> Maybe Klingon
forall a. a -> Maybe a
Just (Int -> Klingon
forall a. Enum a => Int -> a
toEnum (Int
ci Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
0xf8d0))
| Char
c Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
< Char
'\xf8f0' = Maybe Klingon
forall a. Maybe a
Nothing
| Char
c Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
< Char
'\xf8fa' = Klingon -> Maybe Klingon
forall a. a -> Maybe a
Just (Int -> Klingon
forall a. Enum a => Int -> a
toEnum (Int
ci Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
0xf8d6))
| Char
c Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
< Char
'\xf8fd' = Maybe Klingon
forall a. Maybe a
Nothing
| Char
c Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
< Char
'\xf900' = Klingon -> Maybe Klingon
forall a. a -> Maybe a
Just (Int -> Klingon
forall a. Enum a => Int -> a
toEnum (Int
ci Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
0xf8d9))
| Bool
otherwise = Maybe Klingon
forall a. Maybe a
Nothing
where ci :: Int
ci = Char -> Int
ord Char
c
fromUnicodeChar' :: Char -> Klingon
fromUnicodeChar' Char
c
| Char
c Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
< Char
'\xf8ea' = Int -> Klingon
forall a. Enum a => Int -> a
toEnum (Int
ci Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
0xf8d0)
| Char
c Char -> Char -> Bool
forall a. Ord a => a -> a -> Bool
< Char
'\xf8fa' = Int -> Klingon
forall a. Enum a => Int -> a
toEnum (Int
ci Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
0xf8d6)
| Bool
otherwise = Int -> Klingon
forall a. Enum a => Int -> a
toEnum (Int
ci Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
0xf8d9)
where ci :: Int
ci = Char -> Int
ord Char
c
instance UnicodeText Klingon