TH.ReifyDataType

Utilities for reifying simplified datatype info. It omits details that aren't usually relevant to generating instances that work with the datatype. This makes it easier to use TH to derive instances.

Documentation

data DataType

Simplified info about a DataD. Omits deriving, strictness, and kind info.

Constructors

DataType

Fields

• dtName :: Name
• dtTvs :: [Name]
• dtCxt :: Cxt
• dtCons :: [DataCon]

Instances

Eq DataType

Methods

(==) :: DataType -> DataType -> Bool

(/=) :: DataType -> DataType -> Bool

Data DataType

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataType -> c DataType

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataType

toConstr :: DataType -> Constr

dataTypeOf :: DataType -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c DataType)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DataType)

gmapT :: (forall b. Data b => b -> b) -> DataType -> DataType

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataType -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataType -> r

gmapQ :: (forall d. Data d => d -> u) -> DataType -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DataType -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataType -> m DataType

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataType -> m DataType

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataType -> m DataType

Ord DataType

Methods

compare :: DataType -> DataType -> Ordering

(<) :: DataType -> DataType -> Bool

(<=) :: DataType -> DataType -> Bool

(>) :: DataType -> DataType -> Bool

(>=) :: DataType -> DataType -> Bool

max :: DataType -> DataType -> DataType

min :: DataType -> DataType -> DataType

Show DataType

Methods

showsPrec :: Int -> DataType -> ShowS

show :: DataType -> String

showList :: [DataType] -> ShowS

Generic DataType

Associated Types

type Rep DataType :: * -> *

Methods

from :: DataType -> Rep DataType x

to :: Rep DataType x -> DataType

type Rep DataType

type Rep DataType = D1 (MetaData "DataType" "TH.ReifyDataType" "th-utilities-0.1.1.1-428Dd1Zt2nU7I1NYLAbiO3" False) (C1 (MetaCons "DataType" PrefixI True) ((:*:) ((:*:) (S1 (MetaSel (Just Symbol "dtName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Name)) (S1 (MetaSel (Just Symbol "dtTvs") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Name]))) ((:*:) (S1 (MetaSel (Just Symbol "dtCxt") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Cxt)) (S1 (MetaSel (Just Symbol "dtCons") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [DataCon])))))

data DataCon

Simplified info about a Con. Omits strictness, and kind info. This is much nicer than consuming Con directly, because it unifies all the constructors into one.

Constructors

DataCon

Fields

• dcName :: Name
• dcTvs :: [Name]
• dcCxt :: Cxt
• dcFields :: [(Maybe Name, Type)]

Instances

Eq DataCon

Methods

(==) :: DataCon -> DataCon -> Bool

(/=) :: DataCon -> DataCon -> Bool

Data DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataCon -> c DataCon

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataCon

toConstr :: DataCon -> Constr

dataTypeOf :: DataCon -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c DataCon)

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DataCon)

gmapT :: (forall b. Data b => b -> b) -> DataCon -> DataCon

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataCon -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataCon -> r

gmapQ :: (forall d. Data d => d -> u) -> DataCon -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DataCon -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

Ord DataCon

Methods

compare :: DataCon -> DataCon -> Ordering

(<) :: DataCon -> DataCon -> Bool

(<=) :: DataCon -> DataCon -> Bool

(>) :: DataCon -> DataCon -> Bool

(>=) :: DataCon -> DataCon -> Bool

max :: DataCon -> DataCon -> DataCon

min :: DataCon -> DataCon -> DataCon

Show DataCon

Methods

showsPrec :: Int -> DataCon -> ShowS

show :: DataCon -> String

showList :: [DataCon] -> ShowS

Generic DataCon

Associated Types

type Rep DataCon :: * -> *

Methods

from :: DataCon -> Rep DataCon x

to :: Rep DataCon x -> DataCon

type Rep DataCon

type Rep DataCon = D1 (MetaData "DataCon" "TH.ReifyDataType" "th-utilities-0.1.1.1-428Dd1Zt2nU7I1NYLAbiO3" False) (C1 (MetaCons "DataCon" PrefixI True) ((:*:) ((:*:) (S1 (MetaSel (Just Symbol "dcName") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Name)) (S1 (MetaSel (Just Symbol "dcTvs") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [Name]))) ((:*:) (S1 (MetaSel (Just Symbol "dcCxt") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 Cxt)) (S1 (MetaSel (Just Symbol "dcFields") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 [(Maybe Name, Type)])))))

reifyDataType :: Name -> Q DataType

Reify the given data or newtype declaration, and yields its DataType representation.

conToDataCons :: Con -> [DataCon]

Convert a Con to a list of DataCon. The result is a list because GadtC and RecGadtC can define multiple constructors.

reifyDataTypeSubstituted :: Type -> Q DataType

Like reifyDataType, but takes a Type instead of just the Name of the datatype. It expects a normal datatype argument (see typeToNamedCon).