Generic.Data.Types

Utilities to derive and transform generic types.

Documentation

newtype Data r p

A wrapper to view a generic Rep as the datatype it's supposed to represent, without needing a declaration.

This can be used to derive types from generic types, and get some instances for free, in particular Generic, Show, Enum, Bounded.

Constructors

Data

Fields

• unData :: r p

Instances

Monad r => Monad (Data r)

Methods

(>>=) :: Data r a -> (a -> Data r b) -> Data r b

(>>) :: Data r a -> Data r b -> Data r b

return :: a -> Data r a

fail :: String -> Data r a

Functor r => Functor (Data r)

Methods

fmap :: (a -> b) -> Data r a -> Data r b

(<$) :: a -> Data r b -> Data r a

Applicative r => Applicative (Data r)

Methods

pure :: a -> Data r a

(<*>) :: Data r (a -> b) -> Data r a -> Data r b

liftA2 :: (a -> b -> c) -> Data r a -> Data r b -> Data r c

(*>) :: Data r a -> Data r b -> Data r b

(<*) :: Data r a -> Data r b -> Data r a

Foldable r => Foldable (Data r)

Methods

fold :: Monoid m => Data r m -> m

foldMap :: Monoid m => (a -> m) -> Data r a -> m

foldr :: (a -> b -> b) -> b -> Data r a -> b

foldr' :: (a -> b -> b) -> b -> Data r a -> b

foldl :: (b -> a -> b) -> b -> Data r a -> b

foldl' :: (b -> a -> b) -> b -> Data r a -> b

foldr1 :: (a -> a -> a) -> Data r a -> a

foldl1 :: (a -> a -> a) -> Data r a -> a

toList :: Data r a -> [a]

null :: Data r a -> Bool

length :: Data r a -> Int

elem :: Eq a => a -> Data r a -> Bool

maximum :: Ord a => Data r a -> a

minimum :: Ord a => Data r a -> a

sum :: Num a => Data r a -> a

product :: Num a => Data r a -> a

Traversable r => Traversable (Data r)

Methods

traverse :: Applicative f => (a -> f b) -> Data r a -> f (Data r b)

sequenceA :: Applicative f => Data r (f a) -> f (Data r a)

mapM :: Monad m => (a -> m b) -> Data r a -> m (Data r b)

sequence :: Monad m => Data r (m a) -> m (Data r a)

Eq1 r => Eq1 (Data r)

Methods

liftEq :: (a -> b -> Bool) -> Data r a -> Data r b -> Bool

Ord1 r => Ord1 (Data r)

Methods

liftCompare :: (a -> b -> Ordering) -> Data r a -> Data r b -> Ordering

GShow1 r => Show1 (Data r)

Methods

liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Data r a -> ShowS

liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Data r a] -> ShowS

Alternative r => Alternative (Data r)

Methods

empty :: Data r a

(<|>) :: Data r a -> Data r a -> Data r a

some :: Data r a -> Data r [a]

many :: Data r a -> Data r [a]

MonadPlus r => MonadPlus (Data r)

Methods

mzero :: Data r a

mplus :: Data r a -> Data r a -> Data r a

Contravariant r => Contravariant (Data r)

Methods

contramap :: (a -> b) -> Data r b -> Data r a

(>$) :: b -> Data r b -> Data r a

Generic1 * (Data r)

Associated Types

type Rep1 (Data r) (f :: Data r -> *) :: k -> *

Methods

from1 :: f a -> Rep1 (Data r) f a

to1 :: Rep1 (Data r) f a -> f a

GBounded r => Bounded (Data r p)

Methods

minBound :: Data r p

maxBound :: Data r p

GEnum r => Enum (Data r p)

Methods

succ :: Data r p -> Data r p

pred :: Data r p -> Data r p

toEnum :: Int -> Data r p

fromEnum :: Data r p -> Int

enumFrom :: Data r p -> [Data r p]

enumFromThen :: Data r p -> Data r p -> [Data r p]

enumFromTo :: Data r p -> Data r p -> [Data r p]

enumFromThenTo :: Data r p -> Data r p -> Data r p -> [Data r p]

Eq (r p) => Eq (Data r p)

Methods

(==) :: Data r p -> Data r p -> Bool

(/=) :: Data r p -> Data r p -> Bool

Ord (r p) => Ord (Data r p)

Methods

compare :: Data r p -> Data r p -> Ordering

(<) :: Data r p -> Data r p -> Bool

(<=) :: Data r p -> Data r p -> Bool

(>) :: Data r p -> Data r p -> Bool

(>=) :: Data r p -> Data r p -> Bool

max :: Data r p -> Data r p -> Data r p

min :: Data r p -> Data r p -> Data r p

(GShow1 r, Show p) => Show (Data r p)

Methods

showsPrec :: Int -> Data r p -> ShowS

show :: Data r p -> String

showList :: [Data r p] -> ShowS

(Functor r, Contravariant r) => Generic (Data r p)

Associated Types

type Rep (Data r p) :: * -> *

Methods

from :: Data r p -> Rep (Data r p) x

to :: Rep (Data r p) x -> Data r p

Semigroup (r p) => Semigroup (Data r p)

Methods

(<>) :: Data r p -> Data r p -> Data r p

sconcat :: NonEmpty (Data r p) -> Data r p

stimes :: Integral b => b -> Data r p -> Data r p

Monoid (r p) => Monoid (Data r p)

Methods

mempty :: Data r p

mappend :: Data r p -> Data r p -> Data r p

mconcat :: [Data r p] -> Data r p

type Rep1 * (Data r)

type Rep1 * (Data r) = r

type Rep (Data r p)

type Rep (Data r p) = r

type family Map (s :: TyFun a b -> Type) (r :: k -> Type) :: k -> Type

Apply a type function on every field of a type.

Instances

type Map a b k s (V1 k)

type Map a b k s (V1 k) = V1 k

type Map a b k s (U1 k)

type Map a b k s (U1 k) = U1 k

type Map a b k s ((:*:) k f g)

type Map a b k s ((:*:) k f g) = (:*:) k (Map a b k s f) (Map a b k s g)

type Map a b k s ((:+:) k f g)

type Map a b k s ((:+:) k f g) = (:+:) k (Map a b k s f) (Map a b k s g)

type Map a b k s (M1 k i c f)

type Map a b k s (M1 k i c f) = M1 k i c (Map a b k s f)

type Map * * k s (K1 k i c)

type Map * * k s (K1 k i c) = K1 k i ((@@) * * s c)

Defunctionalization

data TyFun :: Type -> Type -> Type

type (~>) a b = TyFun a b -> Type infixr 0

Kind of function symbols

type family (f :: TyFun k1 k2 -> Type) @@ (x :: k1) :: k2 infixl 9

Instances

type (@@) k2 k2 (Id k2 k2) x

type (@@) k2 k2 (Id k2 k2) x = x

type (@@) k1 k2 (TyCon k1 k2 f) x

type (@@) k1 k2 (TyCon k1 k2 f) x = f x

type (@@) k1 k2 (Const k1 k2 t) x

type (@@) k1 k2 (Const k1 k2 t) x = t

data Id :: TyFun k1 k2 -> Type

Identity function symbol

Instances

type (@@) k2 k2 (Id k2 k2) x

type (@@) k2 k2 (Id k2 k2) x = x

data TyCon :: (k1 -> k2) -> TyFun k1 k2 -> Type

Type constructor function symbol

Instances

type (@@) k1 k2 (TyCon k1 k2 f) x

type (@@) k1 k2 (TyCon k1 k2 f) x = f x

data Const :: k2 -> TyFun k1 k2 -> Type

Constant function symbol

Instances

type (@@) k1 k2 (Const k1 k2 t) x

type (@@) k1 k2 (Const k1 k2 t) x = t