{-# LANGUAGE DerivingVia #-}

-- | Common data types
module Language.Giml.Common where

import Data.Data (Data)
import Data.Map qualified as M
import Data.String
import Data.Text qualified as T
import GHC.Generics
import Prettyprinter

-- | A type variable name
newtype TypeVar = TV {TypeVar -> Text
unTypeVar :: T.Text}
  deriving (Int -> TypeVar -> ShowS
[TypeVar] -> ShowS
TypeVar -> String
(Int -> TypeVar -> ShowS)
-> (TypeVar -> String) -> ([TypeVar] -> ShowS) -> Show TypeVar
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [TypeVar] -> ShowS
$cshowList :: [TypeVar] -> ShowS
show :: TypeVar -> String
$cshow :: TypeVar -> String
showsPrec :: Int -> TypeVar -> ShowS
$cshowsPrec :: Int -> TypeVar -> ShowS
Show, TypeVar -> TypeVar -> Bool
(TypeVar -> TypeVar -> Bool)
-> (TypeVar -> TypeVar -> Bool) -> Eq TypeVar
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: TypeVar -> TypeVar -> Bool
$c/= :: TypeVar -> TypeVar -> Bool
== :: TypeVar -> TypeVar -> Bool
$c== :: TypeVar -> TypeVar -> Bool
Eq, Eq TypeVar
Eq TypeVar
-> (TypeVar -> TypeVar -> Ordering)
-> (TypeVar -> TypeVar -> Bool)
-> (TypeVar -> TypeVar -> Bool)
-> (TypeVar -> TypeVar -> Bool)
-> (TypeVar -> TypeVar -> Bool)
-> (TypeVar -> TypeVar -> TypeVar)
-> (TypeVar -> TypeVar -> TypeVar)
-> Ord TypeVar
TypeVar -> TypeVar -> Bool
TypeVar -> TypeVar -> Ordering
TypeVar -> TypeVar -> TypeVar
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 :: TypeVar -> TypeVar -> TypeVar
$cmin :: TypeVar -> TypeVar -> TypeVar
max :: TypeVar -> TypeVar -> TypeVar
$cmax :: TypeVar -> TypeVar -> TypeVar
>= :: TypeVar -> TypeVar -> Bool
$c>= :: TypeVar -> TypeVar -> Bool
> :: TypeVar -> TypeVar -> Bool
$c> :: TypeVar -> TypeVar -> Bool
<= :: TypeVar -> TypeVar -> Bool
$c<= :: TypeVar -> TypeVar -> Bool
< :: TypeVar -> TypeVar -> Bool
$c< :: TypeVar -> TypeVar -> Bool
compare :: TypeVar -> TypeVar -> Ordering
$ccompare :: TypeVar -> TypeVar -> Ordering
Ord, Typeable TypeVar
Typeable TypeVar
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> TypeVar -> c TypeVar)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c TypeVar)
-> (TypeVar -> Constr)
-> (TypeVar -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c TypeVar))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeVar))
-> ((forall b. Data b => b -> b) -> TypeVar -> TypeVar)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> TypeVar -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> TypeVar -> r)
-> (forall u. (forall d. Data d => d -> u) -> TypeVar -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> TypeVar -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> TypeVar -> m TypeVar)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> TypeVar -> m TypeVar)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> TypeVar -> m TypeVar)
-> Data TypeVar
TypeVar -> DataType
TypeVar -> Constr
(forall b. Data b => b -> b) -> TypeVar -> TypeVar
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) -> TypeVar -> u
forall u. (forall d. Data d => d -> u) -> TypeVar -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TypeVar -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TypeVar -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TypeVar -> m TypeVar
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeVar -> m TypeVar
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TypeVar
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TypeVar -> c TypeVar
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TypeVar)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeVar)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeVar -> m TypeVar
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeVar -> m TypeVar
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeVar -> m TypeVar
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeVar -> m TypeVar
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TypeVar -> m TypeVar
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TypeVar -> m TypeVar
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> TypeVar -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> TypeVar -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> TypeVar -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> TypeVar -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TypeVar -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TypeVar -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TypeVar -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TypeVar -> r
gmapT :: (forall b. Data b => b -> b) -> TypeVar -> TypeVar
$cgmapT :: (forall b. Data b => b -> b) -> TypeVar -> TypeVar
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeVar)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeVar)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TypeVar)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TypeVar)
dataTypeOf :: TypeVar -> DataType
$cdataTypeOf :: TypeVar -> DataType
toConstr :: TypeVar -> Constr
$ctoConstr :: TypeVar -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TypeVar
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TypeVar
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TypeVar -> c TypeVar
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TypeVar -> c TypeVar
Data, (forall x. TypeVar -> Rep TypeVar x)
-> (forall x. Rep TypeVar x -> TypeVar) -> Generic TypeVar
forall x. Rep TypeVar x -> TypeVar
forall x. TypeVar -> Rep TypeVar x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep TypeVar x -> TypeVar
$cfrom :: forall x. TypeVar -> Rep TypeVar x
Generic)
  deriving (String -> TypeVar
(String -> TypeVar) -> IsString TypeVar
forall a. (String -> a) -> IsString a
fromString :: String -> TypeVar
$cfromString :: String -> TypeVar
IsString, (forall ann. TypeVar -> Doc ann)
-> (forall ann. [TypeVar] -> Doc ann) -> Pretty TypeVar
forall ann. [TypeVar] -> Doc ann
forall ann. TypeVar -> Doc ann
forall a.
(forall ann. a -> Doc ann)
-> (forall ann. [a] -> Doc ann) -> Pretty a
prettyList :: forall ann. [TypeVar] -> Doc ann
$cprettyList :: forall ann. [TypeVar] -> Doc ann
pretty :: forall ann. TypeVar -> Doc ann
$cpretty :: forall ann. TypeVar -> Doc ann
Pretty) via T.Text

-- | A type constructor name
newtype TypeCon = TC {TypeCon -> Text
unTypeCon :: T.Text}
  deriving (Int -> TypeCon -> ShowS
[TypeCon] -> ShowS
TypeCon -> String
(Int -> TypeCon -> ShowS)
-> (TypeCon -> String) -> ([TypeCon] -> ShowS) -> Show TypeCon
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [TypeCon] -> ShowS
$cshowList :: [TypeCon] -> ShowS
show :: TypeCon -> String
$cshow :: TypeCon -> String
showsPrec :: Int -> TypeCon -> ShowS
$cshowsPrec :: Int -> TypeCon -> ShowS
Show, TypeCon -> TypeCon -> Bool
(TypeCon -> TypeCon -> Bool)
-> (TypeCon -> TypeCon -> Bool) -> Eq TypeCon
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: TypeCon -> TypeCon -> Bool
$c/= :: TypeCon -> TypeCon -> Bool
== :: TypeCon -> TypeCon -> Bool
$c== :: TypeCon -> TypeCon -> Bool
Eq, Eq TypeCon
Eq TypeCon
-> (TypeCon -> TypeCon -> Ordering)
-> (TypeCon -> TypeCon -> Bool)
-> (TypeCon -> TypeCon -> Bool)
-> (TypeCon -> TypeCon -> Bool)
-> (TypeCon -> TypeCon -> Bool)
-> (TypeCon -> TypeCon -> TypeCon)
-> (TypeCon -> TypeCon -> TypeCon)
-> Ord TypeCon
TypeCon -> TypeCon -> Bool
TypeCon -> TypeCon -> Ordering
TypeCon -> TypeCon -> TypeCon
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 :: TypeCon -> TypeCon -> TypeCon
$cmin :: TypeCon -> TypeCon -> TypeCon
max :: TypeCon -> TypeCon -> TypeCon
$cmax :: TypeCon -> TypeCon -> TypeCon
>= :: TypeCon -> TypeCon -> Bool
$c>= :: TypeCon -> TypeCon -> Bool
> :: TypeCon -> TypeCon -> Bool
$c> :: TypeCon -> TypeCon -> Bool
<= :: TypeCon -> TypeCon -> Bool
$c<= :: TypeCon -> TypeCon -> Bool
< :: TypeCon -> TypeCon -> Bool
$c< :: TypeCon -> TypeCon -> Bool
compare :: TypeCon -> TypeCon -> Ordering
$ccompare :: TypeCon -> TypeCon -> Ordering
Ord, Typeable TypeCon
Typeable TypeCon
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> TypeCon -> c TypeCon)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c TypeCon)
-> (TypeCon -> Constr)
-> (TypeCon -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c TypeCon))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeCon))
-> ((forall b. Data b => b -> b) -> TypeCon -> TypeCon)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> TypeCon -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> TypeCon -> r)
-> (forall u. (forall d. Data d => d -> u) -> TypeCon -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> TypeCon -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> TypeCon -> m TypeCon)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> TypeCon -> m TypeCon)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> TypeCon -> m TypeCon)
-> Data TypeCon
TypeCon -> DataType
TypeCon -> Constr
(forall b. Data b => b -> b) -> TypeCon -> TypeCon
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) -> TypeCon -> u
forall u. (forall d. Data d => d -> u) -> TypeCon -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TypeCon -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TypeCon -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TypeCon -> m TypeCon
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeCon -> m TypeCon
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TypeCon
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TypeCon -> c TypeCon
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TypeCon)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeCon)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeCon -> m TypeCon
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeCon -> m TypeCon
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeCon -> m TypeCon
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> TypeCon -> m TypeCon
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TypeCon -> m TypeCon
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> TypeCon -> m TypeCon
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> TypeCon -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> TypeCon -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> TypeCon -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> TypeCon -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TypeCon -> r
$cgmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> TypeCon -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TypeCon -> r
$cgmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> TypeCon -> r
gmapT :: (forall b. Data b => b -> b) -> TypeCon -> TypeCon
$cgmapT :: (forall b. Data b => b -> b) -> TypeCon -> TypeCon
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeCon)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TypeCon)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TypeCon)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c TypeCon)
dataTypeOf :: TypeCon -> DataType
$cdataTypeOf :: TypeCon -> DataType
toConstr :: TypeCon -> Constr
$ctoConstr :: TypeCon -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TypeCon
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c TypeCon
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TypeCon -> c TypeCon
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> TypeCon -> c TypeCon
Data, (forall x. TypeCon -> Rep TypeCon x)
-> (forall x. Rep TypeCon x -> TypeCon) -> Generic TypeCon
forall x. Rep TypeCon x -> TypeCon
forall x. TypeCon -> Rep TypeCon x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep TypeCon x -> TypeCon
$cfrom :: forall x. TypeCon -> Rep TypeCon x
Generic)
  deriving (String -> TypeCon
(String -> TypeCon) -> IsString TypeCon
forall a. (String -> a) -> IsString a
fromString :: String -> TypeCon
$cfromString :: String -> TypeCon
IsString, (forall ann. TypeCon -> Doc ann)
-> (forall ann. [TypeCon] -> Doc ann) -> Pretty TypeCon
forall ann. [TypeCon] -> Doc ann
forall ann. TypeCon -> Doc ann
forall a.
(forall ann. a -> Doc ann)
-> (forall ann. [a] -> Doc ann) -> Pretty a
prettyList :: forall ann. [TypeCon] -> Doc ann
$cprettyList :: forall ann. [TypeCon] -> Doc ann
pretty :: forall ann. TypeCon -> Doc ann
$cpretty :: forall ann. TypeCon -> Doc ann
Pretty) via T.Text

-- | A data constructor
newtype Constr = C {Constr -> Text
unConstr :: T.Text}
  deriving (Int -> Constr -> ShowS
[Constr] -> ShowS
Constr -> String
(Int -> Constr -> ShowS)
-> (Constr -> String) -> ([Constr] -> ShowS) -> Show Constr
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Constr] -> ShowS
$cshowList :: [Constr] -> ShowS
show :: Constr -> String
$cshow :: Constr -> String
showsPrec :: Int -> Constr -> ShowS
$cshowsPrec :: Int -> Constr -> ShowS
Show, Constr -> Constr -> Bool
(Constr -> Constr -> Bool)
-> (Constr -> Constr -> Bool) -> Eq Constr
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Constr -> Constr -> Bool
$c/= :: Constr -> Constr -> Bool
== :: Constr -> Constr -> Bool
$c== :: Constr -> Constr -> Bool
Eq, Eq Constr
Eq Constr
-> (Constr -> Constr -> Ordering)
-> (Constr -> Constr -> Bool)
-> (Constr -> Constr -> Bool)
-> (Constr -> Constr -> Bool)
-> (Constr -> Constr -> Bool)
-> (Constr -> Constr -> Constr)
-> (Constr -> Constr -> Constr)
-> Ord Constr
Constr -> Constr -> Bool
Constr -> Constr -> Ordering
Constr -> Constr -> Constr
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 :: Constr -> Constr -> Constr
$cmin :: Constr -> Constr -> Constr
max :: Constr -> Constr -> Constr
$cmax :: Constr -> Constr -> Constr
>= :: Constr -> Constr -> Bool
$c>= :: Constr -> Constr -> Bool
> :: Constr -> Constr -> Bool
$c> :: Constr -> Constr -> Bool
<= :: Constr -> Constr -> Bool
$c<= :: Constr -> Constr -> Bool
< :: Constr -> Constr -> Bool
$c< :: Constr -> Constr -> Bool
compare :: Constr -> Constr -> Ordering
$ccompare :: Constr -> Constr -> Ordering
Ord, Typeable Constr
Typeable Constr
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Constr -> c Constr)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Constr)
-> (Constr -> Constr)
-> (Constr -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Constr))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Constr))
-> ((forall b. Data b => b -> b) -> Constr -> Constr)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Constr -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Constr -> r)
-> (forall u. (forall d. Data d => d -> u) -> Constr -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Constr -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Constr -> m Constr)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Constr -> m Constr)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Constr -> m Constr)
-> Data Constr
Constr -> DataType
Constr -> Constr
(forall b. Data b => b -> b) -> Constr -> Constr
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) -> Constr -> u
forall u. (forall d. Data d => d -> u) -> Constr -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Constr -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Constr -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Constr -> m Constr
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Constr -> m Constr
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Constr
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Constr -> c Constr
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Constr)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Constr)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Constr -> m Constr
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Constr -> m Constr
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Constr -> m Constr
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Constr -> m Constr
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Constr -> m Constr
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Constr -> m Constr
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Constr -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Constr -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Constr -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Constr -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Constr -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Constr -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Constr -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Constr -> r
gmapT :: (forall b. Data b => b -> b) -> Constr -> Constr
$cgmapT :: (forall b. Data b => b -> b) -> Constr -> Constr
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Constr)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Constr)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Constr)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Constr)
dataTypeOf :: Constr -> DataType
$cdataTypeOf :: Constr -> DataType
toConstr :: Constr -> Constr
$ctoConstr :: Constr -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Constr
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Constr
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Constr -> c Constr
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Constr -> c Constr
Data, (forall x. Constr -> Rep Constr x)
-> (forall x. Rep Constr x -> Constr) -> Generic Constr
forall x. Rep Constr x -> Constr
forall x. Constr -> Rep Constr x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep Constr x -> Constr
$cfrom :: forall x. Constr -> Rep Constr x
Generic)
  deriving (String -> Constr
(String -> Constr) -> IsString Constr
forall a. (String -> a) -> IsString a
fromString :: String -> Constr
$cfromString :: String -> Constr
IsString, (forall ann. Constr -> Doc ann)
-> (forall ann. [Constr] -> Doc ann) -> Pretty Constr
forall ann. [Constr] -> Doc ann
forall ann. Constr -> Doc ann
forall a.
(forall ann. a -> Doc ann)
-> (forall ann. [a] -> Doc ann) -> Pretty a
prettyList :: forall ann. [Constr] -> Doc ann
$cprettyList :: forall ann. [Constr] -> Doc ann
pretty :: forall ann. Constr -> Doc ann
$cpretty :: forall ann. Constr -> Doc ann
Pretty) via T.Text

-- | A record label
newtype Label = L {Label -> Text
unLabel :: T.Text}
  deriving (Int -> Label -> ShowS
[Label] -> ShowS
Label -> String
(Int -> Label -> ShowS)
-> (Label -> String) -> ([Label] -> ShowS) -> Show Label
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Label] -> ShowS
$cshowList :: [Label] -> ShowS
show :: Label -> String
$cshow :: Label -> String
showsPrec :: Int -> Label -> ShowS
$cshowsPrec :: Int -> Label -> ShowS
Show, Label -> Label -> Bool
(Label -> Label -> Bool) -> (Label -> Label -> Bool) -> Eq Label
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Label -> Label -> Bool
$c/= :: Label -> Label -> Bool
== :: Label -> Label -> Bool
$c== :: Label -> Label -> Bool
Eq, Eq Label
Eq Label
-> (Label -> Label -> Ordering)
-> (Label -> Label -> Bool)
-> (Label -> Label -> Bool)
-> (Label -> Label -> Bool)
-> (Label -> Label -> Bool)
-> (Label -> Label -> Label)
-> (Label -> Label -> Label)
-> Ord Label
Label -> Label -> Bool
Label -> Label -> Ordering
Label -> Label -> Label
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 :: Label -> Label -> Label
$cmin :: Label -> Label -> Label
max :: Label -> Label -> Label
$cmax :: Label -> Label -> Label
>= :: Label -> Label -> Bool
$c>= :: Label -> Label -> Bool
> :: Label -> Label -> Bool
$c> :: Label -> Label -> Bool
<= :: Label -> Label -> Bool
$c<= :: Label -> Label -> Bool
< :: Label -> Label -> Bool
$c< :: Label -> Label -> Bool
compare :: Label -> Label -> Ordering
$ccompare :: Label -> Label -> Ordering
Ord, Typeable Label
Typeable Label
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Label -> c Label)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Label)
-> (Label -> Constr)
-> (Label -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Label))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Label))
-> ((forall b. Data b => b -> b) -> Label -> Label)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Label -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Label -> r)
-> (forall u. (forall d. Data d => d -> u) -> Label -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Label -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Label -> m Label)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Label -> m Label)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Label -> m Label)
-> Data Label
Label -> DataType
Label -> Constr
(forall b. Data b => b -> b) -> Label -> Label
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) -> Label -> u
forall u. (forall d. Data d => d -> u) -> Label -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Label -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Label -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Label -> m Label
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Label -> m Label
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Label
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Label -> c Label
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Label)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Label)
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Label -> m Label
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Label -> m Label
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Label -> m Label
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Label -> m Label
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Label -> m Label
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Label -> m Label
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Label -> u
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Label -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Label -> [u]
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Label -> [u]
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Label -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Label -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Label -> r
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Label -> r
gmapT :: (forall b. Data b => b -> b) -> Label -> Label
$cgmapT :: (forall b. Data b => b -> b) -> Label -> Label
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Label)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Label)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Label)
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Label)
dataTypeOf :: Label -> DataType
$cdataTypeOf :: Label -> DataType
toConstr :: Label -> Constr
$ctoConstr :: Label -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Label
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Label
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Label -> c Label
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Label -> c Label
Data, (forall x. Label -> Rep Label x)
-> (forall x. Rep Label x -> Label) -> Generic Label
forall x. Rep Label x -> Label
forall x. Label -> Rep Label x
forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
$cto :: forall x. Rep Label x -> Label
$cfrom :: forall x. Label -> Rep Label x
Generic)
  deriving (String -> Label
(String -> Label) -> IsString Label
forall a. (String -> a) -> IsString a
fromString :: String -> Label
$cfromString :: String -> Label
IsString, (forall ann. Label -> Doc ann)
-> (forall ann. [Label] -> Doc ann) -> Pretty Label
forall ann. [Label] -> Doc ann
forall ann. Label -> Doc ann
forall a.
(forall ann. a -> Doc ann)
-> (forall ann. [a] -> Doc ann) -> Pretty a
prettyList :: forall ann. [Label] -> Doc ann
$cprettyList :: forall ann. [Label] -> Doc ann
pretty :: forall ann. Label -> Doc ann
$cpretty :: forall ann. Label -> Doc ann
Pretty) via T.Text

-- | A general record data type
type Record a =
  M.Map Label a

-- | A general variant data type
data Variant a
  = Variant Constr a
  deriving (Int -> Variant a -> ShowS
[Variant a] -> ShowS
Variant a -> String
(Int -> Variant a -> ShowS)
-> (Variant a -> String)
-> ([Variant a] -> ShowS)
-> Show (Variant a)
forall a. Show a => Int -> Variant a -> ShowS
forall a. Show a => [Variant a] -> ShowS
forall a. Show a => Variant a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Variant a] -> ShowS
$cshowList :: forall a. Show a => [Variant a] -> ShowS
show :: Variant a -> String
$cshow :: forall a. Show a => Variant a -> String
showsPrec :: Int -> Variant a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Variant a -> ShowS
Show, Variant a -> Variant a -> Bool
(Variant a -> Variant a -> Bool)
-> (Variant a -> Variant a -> Bool) -> Eq (Variant a)
forall a. Eq a => Variant a -> Variant a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Variant a -> Variant a -> Bool
$c/= :: forall a. Eq a => Variant a -> Variant a -> Bool
== :: Variant a -> Variant a -> Bool
$c== :: forall a. Eq a => Variant a -> Variant a -> Bool
Eq, Eq (Variant a)
Eq (Variant a)
-> (Variant a -> Variant a -> Ordering)
-> (Variant a -> Variant a -> Bool)
-> (Variant a -> Variant a -> Bool)
-> (Variant a -> Variant a -> Bool)
-> (Variant a -> Variant a -> Bool)
-> (Variant a -> Variant a -> Variant a)
-> (Variant a -> Variant a -> Variant a)
-> Ord (Variant a)
Variant a -> Variant a -> Bool
Variant a -> Variant a -> Ordering
Variant a -> Variant a -> Variant 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 (Variant a)
forall a. Ord a => Variant a -> Variant a -> Bool
forall a. Ord a => Variant a -> Variant a -> Ordering
forall a. Ord a => Variant a -> Variant a -> Variant a
min :: Variant a -> Variant a -> Variant a
$cmin :: forall a. Ord a => Variant a -> Variant a -> Variant a
max :: Variant a -> Variant a -> Variant a
$cmax :: forall a. Ord a => Variant a -> Variant a -> Variant a
>= :: Variant a -> Variant a -> Bool
$c>= :: forall a. Ord a => Variant a -> Variant a -> Bool
> :: Variant a -> Variant a -> Bool
$c> :: forall a. Ord a => Variant a -> Variant a -> Bool
<= :: Variant a -> Variant a -> Bool
$c<= :: forall a. Ord a => Variant a -> Variant a -> Bool
< :: Variant a -> Variant a -> Bool
$c< :: forall a. Ord a => Variant a -> Variant a -> Bool
compare :: Variant a -> Variant a -> Ordering
$ccompare :: forall a. Ord a => Variant a -> Variant a -> Ordering
Ord, Typeable (Variant a)
Typeable (Variant a)
-> (forall (c :: * -> *).
    (forall d b. Data d => c (d -> b) -> d -> c b)
    -> (forall g. g -> c g) -> Variant a -> c (Variant a))
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c (Variant a))
-> (Variant a -> Constr)
-> (Variant a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c (Variant a)))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e))
    -> Maybe (c (Variant a)))
-> ((forall b. Data b => b -> b) -> Variant a -> Variant a)
-> (forall r r'.
    (r -> r' -> r)
    -> r -> (forall d. Data d => d -> r') -> Variant a -> r)
-> (forall r r'.
    (r' -> r -> r)
    -> r -> (forall d. Data d => d -> r') -> Variant a -> r)
-> (forall u. (forall d. Data d => d -> u) -> Variant a -> [u])
-> (forall u.
    Int -> (forall d. Data d => d -> u) -> Variant a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Variant a -> m (Variant a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Variant a -> m (Variant a))
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Variant a -> m (Variant a))
-> Data (Variant a)
Variant a -> DataType
Variant a -> Constr
(forall b. Data b => b -> b) -> Variant a -> Variant a
forall {a}. Data a => Typeable (Variant a)
forall a. Data a => Variant a -> DataType
forall a. Data a => Variant a -> Constr
forall a.
Data a =>
(forall b. Data b => b -> b) -> Variant a -> Variant a
forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> Variant a -> u
forall a u.
Data a =>
(forall d. Data d => d -> u) -> Variant a -> [u]
forall a r r'.
Data a =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Variant a -> r
forall a r r'.
Data a =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Variant a -> r
forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Variant a)
forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Variant a -> c (Variant a)
forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Variant a))
forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Variant 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 u. Int -> (forall d. Data d => d -> u) -> Variant a -> u
forall u. (forall d. Data d => d -> u) -> Variant a -> [u]
forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Variant a -> r
forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Variant a -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Variant a)
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Variant a -> c (Variant a)
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Variant a))
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Variant a))
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
$cgmapMo :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
$cgmapMp :: forall a (m :: * -> *).
(Data a, MonadPlus m) =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
$cgmapM :: forall a (m :: * -> *).
(Data a, Monad m) =>
(forall d. Data d => d -> m d) -> Variant a -> m (Variant a)
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Variant a -> u
$cgmapQi :: forall a u.
Data a =>
Int -> (forall d. Data d => d -> u) -> Variant a -> u
gmapQ :: forall u. (forall d. Data d => d -> u) -> Variant a -> [u]
$cgmapQ :: forall a u.
Data a =>
(forall d. Data d => d -> u) -> Variant a -> [u]
gmapQr :: forall r r'.
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Variant a -> r
$cgmapQr :: forall a r r'.
Data a =>
(r' -> r -> r)
-> r -> (forall d. Data d => d -> r') -> Variant a -> r
gmapQl :: forall r r'.
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Variant a -> r
$cgmapQl :: forall a r r'.
Data a =>
(r -> r' -> r)
-> r -> (forall d. Data d => d -> r') -> Variant a -> r
gmapT :: (forall b. Data b => b -> b) -> Variant a -> Variant a
$cgmapT :: forall a.
Data a =>
(forall b. Data b => b -> b) -> Variant a -> Variant a
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Variant a))
$cdataCast2 :: forall a (t :: * -> * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d e. (Data d, Data e) => c (t d e))
-> Maybe (c (Variant a))
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c (Variant a))
$cdataCast1 :: forall a (t :: * -> *) (c :: * -> *).
(Data a, Typeable t) =>
(forall d. Data d => c (t d)) -> Maybe (c (Variant a))
dataTypeOf :: Variant a -> DataType
$cdataTypeOf :: forall a. Data a => Variant a -> DataType
toConstr :: Variant a -> Constr
$ctoConstr :: forall a. Data a => Variant a -> Constr
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Variant a)
$cgunfold :: forall a (c :: * -> *).
Data a =>
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c (Variant a)
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Variant a -> c (Variant a)
$cgfoldl :: forall a (c :: * -> *).
Data a =>
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Variant a -> c (Variant a)
Data, (forall a b. (a -> b) -> Variant a -> Variant b)
-> (forall a b. a -> Variant b -> Variant a) -> Functor Variant
forall a b. a -> Variant b -> Variant a
forall a b. (a -> b) -> Variant a -> Variant b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> Variant b -> Variant a
$c<$ :: forall a b. a -> Variant b -> Variant a
fmap :: forall a b. (a -> b) -> Variant a -> Variant b
$cfmap :: forall a b. (a -> b) -> Variant a -> Variant b
Functor, (forall m. Monoid m => Variant m -> m)
-> (forall m a. Monoid m => (a -> m) -> Variant a -> m)
-> (forall m a. Monoid m => (a -> m) -> Variant a -> m)
-> (forall a b. (a -> b -> b) -> b -> Variant a -> b)
-> (forall a b. (a -> b -> b) -> b -> Variant a -> b)
-> (forall b a. (b -> a -> b) -> b -> Variant a -> b)
-> (forall b a. (b -> a -> b) -> b -> Variant a -> b)
-> (forall a. (a -> a -> a) -> Variant a -> a)
-> (forall a. (a -> a -> a) -> Variant a -> a)
-> (forall a. Variant a -> [a])
-> (forall a. Variant a -> Bool)
-> (forall a. Variant a -> Int)
-> (forall a. Eq a => a -> Variant a -> Bool)
-> (forall a. Ord a => Variant a -> a)
-> (forall a. Ord a => Variant a -> a)
-> (forall a. Num a => Variant a -> a)
-> (forall a. Num a => Variant a -> a)
-> Foldable Variant
forall a. Eq a => a -> Variant a -> Bool
forall a. Num a => Variant a -> a
forall a. Ord a => Variant a -> a
forall m. Monoid m => Variant m -> m
forall a. Variant a -> Bool
forall a. Variant a -> Int
forall a. Variant a -> [a]
forall a. (a -> a -> a) -> Variant a -> a
forall m a. Monoid m => (a -> m) -> Variant a -> m
forall b a. (b -> a -> b) -> b -> Variant a -> b
forall a b. (a -> b -> b) -> b -> Variant a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: forall a. Num a => Variant a -> a
$cproduct :: forall a. Num a => Variant a -> a
sum :: forall a. Num a => Variant a -> a
$csum :: forall a. Num a => Variant a -> a
minimum :: forall a. Ord a => Variant a -> a
$cminimum :: forall a. Ord a => Variant a -> a
maximum :: forall a. Ord a => Variant a -> a
$cmaximum :: forall a. Ord a => Variant a -> a
elem :: forall a. Eq a => a -> Variant a -> Bool
$celem :: forall a. Eq a => a -> Variant a -> Bool
length :: forall a. Variant a -> Int
$clength :: forall a. Variant a -> Int
null :: forall a. Variant a -> Bool
$cnull :: forall a. Variant a -> Bool
toList :: forall a. Variant a -> [a]
$ctoList :: forall a. Variant a -> [a]
foldl1 :: forall a. (a -> a -> a) -> Variant a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Variant a -> a
foldr1 :: forall a. (a -> a -> a) -> Variant a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> Variant a -> a
foldl' :: forall b a. (b -> a -> b) -> b -> Variant a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Variant a -> b
foldl :: forall b a. (b -> a -> b) -> b -> Variant a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Variant a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> Variant a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Variant a -> b
foldr :: forall a b. (a -> b -> b) -> b -> Variant a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> Variant a -> b
foldMap' :: forall m a. Monoid m => (a -> m) -> Variant a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Variant a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> Variant a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Variant a -> m
fold :: forall m. Monoid m => Variant m -> m
$cfold :: forall m. Monoid m => Variant m -> m
Foldable, Functor Variant
Foldable Variant
Functor Variant
-> Foldable Variant
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> Variant a -> f (Variant b))
-> (forall (f :: * -> *) a.
    Applicative f =>
    Variant (f a) -> f (Variant a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> Variant a -> m (Variant b))
-> (forall (m :: * -> *) a.
    Monad m =>
    Variant (m a) -> m (Variant a))
-> Traversable Variant
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a. Monad m => Variant (m a) -> m (Variant a)
forall (f :: * -> *) a.
Applicative f =>
Variant (f a) -> f (Variant a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Variant a -> m (Variant b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Variant a -> f (Variant b)
sequence :: forall (m :: * -> *) a. Monad m => Variant (m a) -> m (Variant a)
$csequence :: forall (m :: * -> *) a. Monad m => Variant (m a) -> m (Variant a)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Variant a -> m (Variant b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Variant a -> m (Variant b)
sequenceA :: forall (f :: * -> *) a.
Applicative f =>
Variant (f a) -> f (Variant a)
$csequenceA :: forall (f :: * -> *) a.
Applicative f =>
Variant (f a) -> f (Variant a)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Variant a -> f (Variant b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Variant a -> f (Variant b)
Traversable)