| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Generics.SOP
Description
Main module of generics-sop
In most cases, you will probably want to import just this module,
and possibly Generics.SOP.TH if you want to use Template Haskell
to generate Generic instances for you.
Generic programming with sums of products
You need this library if you want to define your own generic functions in the sum-of-products SOP style. Generic programming in the SOP style follows the following idea:
- A large class of datatypes can be viewed in a uniform, structured
way: the choice between constructors is represented using an n-ary
sum (called
NS), and the arguments of each constructor are represented using an n-ary product (calledNP). - The library captures the notion of a datatype being representable
in the following way. There is a class
Generic, which for a given datatypeA, associates the isomorphic SOP representation with the original type under the nameRepAfromandtothat convert betweenAandRepA - Since all
Reptypes are sums of products, you can define functions over them by performing induction on the structure, of by using predefined combinators that the library provides. Such functions then work for allReptypes. - By combining the conversion functions
fromandtowith the function that works onReptypes, we obtain a function that works on all types that are in theGenericclass. - Most types can very easily be made an instance of
Generic. For example, if the datatype can be represented using GHC's built-in approach to generic programming and has an instance for theGenericclass from module GHC.Generics, then an instance of the SOPGenericcan automatically be derived. There is also Template Haskell code in Generics.SOP.TH that allows to auto-generate an instance ofGenericfor most types.
Example
Instantiating a datatype for use with SOP generics
Let's assume we have the datatypes:
data A = C Bool | D A Int | E (B ()) data B a = F | G a Char Bool
To create Generic instances for A and B via GHC.Generics, we say
{-# LANGUAGE DeriveGeneric #-}
import qualified GHC.Generics as GHC
import Generics.SOP
data A = C Bool | D A Int | E (B ())
deriving (Show, GHC.Generic)
data B a = F | G a Char Bool
deriving (Show, GHC.Generic)
instance Generic A -- empty
instance Generic (B a) -- emptyNow we can convert between A and Rep AB and Rep B
>>>from (D (C True) 3) :: Rep ASOP (S (Z (I (C True) :* I 3 :* Nil)))>>>to it :: AD (C True) 3
Note that the transformation is shallow: In D (C True) 3, the
inner value C True of type A is not affected by the
transformation.
For more details about Rep A
Defining a generic function
As an example of a generic function, let us define a generic
version of rnf from the deepseq package.
The type of rnf is
NFData a => a -> ()
and the idea is that for a term x of type a in the
NFData class, rnf x forces complete evaluation
of x (i.e., evaluation to normal form), and returns ().
We call the generic version of this function grnf. A direct
definition in SOP style, making use of structural recursion on the
sums and products, looks as follows:
grnf :: (Generica,All2NFData (Codea)) => a -> () grnf x = grnfS (fromx) grnfS :: (All2NFData xss) =>SOPIxss -> () grnfS (SOP(Zxs)) = grnfP xs grnfS (SOP(Sxss)) = grnfS (SOPxss) grnfP :: (AllNFData xs) =>NPIxs -> () grnfPNil= () grnfP (Ix:*xs) = x `deepseq` (grnfP xs)
The grnf function performs the conversion between a and Rep afrom and then applies grnfS. The type of grnf
indicates that a must be in the Generic class so that we can
apply from, and that all the components of a (i.e., all the types
that occur as constructor arguments) must be in the NFData class
(All2).
The function grnfS traverses the outer sum structure of the
sum of products (note that Rep a = SOP I (Code a)a. Once we've found the constructor in question
(Z), we traverse the arguments of that constructor using grnfP.
The function grnfP traverses the product structure of the
constructor arguments. Each argument is evaluated using the
deepseq function from the NFData
class. This requires that all components of the product must be
in the NFData class (All) and triggers the corresponding
constraints on the other functions. Once the end of the product
is reached (Nil), we return ().
Defining a generic function using combinators
In many cases, generic functions can be written in a much more concise way by avoiding the explicit structural recursion and resorting to the powerful combinators provided by this library instead.
For example, the grnf function can also be defined as a one-liner
as follows:
grnf :: (Generica,All2NFData (Codea)) => a -> () grnf =rnf.hcollapse.hcmap(Proxy::ProxyNFData) (mapIKrnf) .from
mapIK and friends (mapII, mapKI, etc.) are small helpers for working
with I and K functors, for example mapIK is defined as
mapIK f = \ (I x) -> K (f x)
The following interaction should provide an idea of the individual transformation steps:
>>>let x = G 2.5 'A' False :: B Double>>>from xSOP (S (Z (I 2.5 :* I 'A' :* I False :* Nil)))>>>hcmap (Proxy :: Proxy NFData) (mapIK rnf) itSOP (S (Z (K () :* K () :* K () :* Nil)))>>>hcollapse it[(),(),()]>>>rnf it()
The from call converts into the structural representation.
Via hcmap, we apply rnf to all the components. The result
is a sum of products of the same shape, but the components are
no longer heterogeneous (I), but homogeneous (K ()hcollapse) into a
normal Haskell list. Finally, rnf actually forces evaluation
of this list (and thereby actually drives the evaluation of all
the previous steps) and produces the final result.
Using a generic function
We can directly invoke grnf on any type that is an instance of
class Generic.
>>>grnf (G 2.5 'A' False)()>>>grnf (G 2.5 undefined False)*** Exception: Prelude.undefined ...
Note that the type of grnf requires that all components of the
type are in the NFData class. For a recursive
datatype such as B, this means that we have to make A
(and in this case, also B) an instance of NFData
in order to be able to use the grnf function. But we can use grnf
to supply the instance definitions:
instance NFData A where rnf = grnf instance NFData a => NFData (B a) where rnf = grnf
More examples
The best way to learn about how to define generic functions in the SOP style is to look at a few simple examples. Examples are provided by the following packages:
basic-sopbasic examples,pretty-sopgeneric pretty printing,lens-sopgenerically computed lenses,json-sopgeneric JSON conversions.
The generic functions in these packages use a wide variety of the combinators that are offered by the library.
Paper
A detailed description of the ideas behind this library is provided by the paper:
- Edsko de Vries and Andres Löh. True Sums of Products. Workshop on Generic Programming (WGP) 2014.
Synopsis
- class All SListI (Code a) => Generic (a :: Type) where
- type Rep a = SOP I (Code a)
- type IsProductType (a :: Type) (xs :: [Type]) = (Generic a, Code a ~ '[xs])
- type IsEnumType (a :: Type) = (Generic a, All ((~) '[]) (Code a))
- type IsWrappedType (a :: Type) (x :: Type) = (Generic a, Code a ~ '['[x]])
- type IsNewtype (a :: Type) (x :: Type) = (IsWrappedType a x, Coercible a x)
- data NP (a :: k -> Type) (b :: [k]) :: forall k. (k -> Type) -> [k] -> Type where
- data NS (a :: k -> Type) (b :: [k]) :: forall k. (k -> Type) -> [k] -> Type where
- newtype SOP (f :: k -> Type) (xss :: [[k]]) :: forall k. (k -> Type) -> [[k]] -> Type = SOP (NS (NP f) xss)
- unSOP :: SOP f xss -> NS (NP f) xss
- newtype POP (f :: k -> Type) (xss :: [[k]]) :: forall k. (k -> Type) -> [[k]] -> Type = POP (NP (NP f) xss)
- unPOP :: POP f xss -> NP (NP f) xss
- data DatatypeInfo :: [[Type]] -> Type where
- ADT :: ModuleName -> DatatypeName -> NP ConstructorInfo xss -> DatatypeInfo xss
- Newtype :: ModuleName -> DatatypeName -> ConstructorInfo '[x] -> DatatypeInfo '['[x]]
- moduleName :: DatatypeInfo xss -> ModuleName
- datatypeName :: DatatypeInfo xss -> DatatypeName
- constructorInfo :: DatatypeInfo xss -> NP ConstructorInfo xss
- data ConstructorInfo :: [Type] -> Type where
- Constructor :: SListI xs => ConstructorName -> ConstructorInfo xs
- Infix :: ConstructorName -> Associativity -> Fixity -> ConstructorInfo '[x, y]
- Record :: SListI xs => ConstructorName -> NP FieldInfo xs -> ConstructorInfo xs
- constructorName :: ConstructorInfo xs -> ConstructorName
- data FieldInfo :: Type -> Type where
- fieldName :: FieldInfo a -> FieldName
- class Generic a => HasDatatypeInfo a where
- type DatatypeInfoOf a :: DatatypeInfo
- datatypeInfo :: proxy a -> DatatypeInfo (Code a)
- type DatatypeName = String
- type ModuleName = String
- type ConstructorName = String
- type FieldName = String
- data Associativity
- type Fixity = Int
- class HPure (h :: (k -> Type) -> l -> Type) where
- hd :: NP f (x ': xs) -> f x
- tl :: NP f (x ': xs) -> NP f xs
- type Projection (f :: k -> Type) (xs :: [k]) = (K (NP f xs) :: k -> Type) -.-> f
- projections :: SListI xs => NP (Projection f xs) xs
- shiftProjection :: Projection f xs a2 -> Projection f (x ': xs) a2
- newtype ((f :: k -> Type) -.-> (g :: k -> Type)) (a :: k) :: forall k. (k -> Type) -> (k -> Type) -> k -> Type = Fn {
- apFn :: f a -> g a
- fn :: (f a -> f' a) -> (f -.-> f') a
- fn_2 :: (f a -> f' a -> f'' a) -> (f -.-> (f' -.-> f'')) a
- fn_3 :: (f a -> f' a -> f'' a -> f''' a) -> (f -.-> (f' -.-> (f'' -.-> f'''))) a
- fn_4 :: (f a -> f' a -> f'' a -> f''' a -> f'''' a) -> (f -.-> (f' -.-> (f'' -.-> (f''' -.-> f'''')))) a
- type family Prod (h :: (k -> Type) -> l -> Type) :: (k -> Type) -> l -> Type
- class (Prod (Prod h) ~ Prod h, HPure (Prod h)) => HAp (h :: (k -> Type) -> l -> Type) where
- hliftA :: (SListIN (Prod h) xs, HAp h) => (forall (a :: k). f a -> f' a) -> h f xs -> h f' xs
- hliftA2 :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall (a :: k). f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs
- hliftA3 :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall (a :: k). f a -> f' a -> f'' a -> f''' a) -> Prod h f xs -> Prod h f' xs -> h f'' xs -> h f''' xs
- hcliftA :: (AllN (Prod h) c xs, HAp h) => proxy c -> (forall (a :: k). c a => f a -> f' a) -> h f xs -> h f' xs
- hcliftA2 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall (a :: k). c a => f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs
- hcliftA3 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall (a :: k). c a => f a -> f' a -> f'' a -> f''' a) -> Prod h f xs -> Prod h f' xs -> h f'' xs -> h f''' xs
- hmap :: (SListIN (Prod h) xs, HAp h) => (forall (a :: k). f a -> f' a) -> h f xs -> h f' xs
- hzipWith :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall (a :: k). f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs
- hzipWith3 :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall (a :: k). f a -> f' a -> f'' a -> f''' a) -> Prod h f xs -> Prod h f' xs -> h f'' xs -> h f''' xs
- hcmap :: (AllN (Prod h) c xs, HAp h) => proxy c -> (forall (a :: k). c a => f a -> f' a) -> h f xs -> h f' xs
- hczipWith :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall (a :: k). c a => f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs
- hczipWith3 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall (a :: k). c a => f a -> f' a -> f'' a -> f''' a) -> Prod h f xs -> Prod h f' xs -> h f'' xs -> h f''' xs
- type Injection (f :: k -> Type) (xs :: [k]) = f -.-> (K (NS f xs) :: k -> Type)
- injections :: SListI xs => NP (Injection f xs) xs
- shift :: Injection f xs a2 -> Injection f (x ': xs) a2
- shiftInjection :: Injection f xs a2 -> Injection f (x ': xs) a2
- type family UnProd (h :: (k -> Type) -> l -> Type) :: (k -> Type) -> l -> Type
- class UnProd (Prod h) ~ h => HApInjs (h :: (k -> Type) -> l -> Type) where
- apInjs_NP :: SListI xs => NP f xs -> [NS f xs]
- apInjs_POP :: SListI xss => POP f xss -> [SOP f xss]
- unZ :: NS f (x ': ([] :: [k])) -> f x
- class HIndex (h :: (k -> Type) -> l -> Type) where
- hcliftA' :: (All2 c xss, Prod h ~ (NP :: ([k] -> Type) -> [[k]] -> Type), HAp h) => proxy c -> (forall (xs :: [k]). All c xs => f xs -> f' xs) -> h f xss -> h f' xss
- hcliftA2' :: (All2 c xss, Prod h ~ (NP :: ([k] -> Type) -> [[k]] -> Type), HAp h) => proxy c -> (forall (xs :: [k]). All c xs => f xs -> f' xs -> f'' xs) -> Prod h f xss -> h f' xss -> h f'' xss
- hcliftA3' :: (All2 c xss, Prod h ~ (NP :: ([k] -> Type) -> [[k]] -> Type), HAp h) => proxy c -> (forall (xs :: [k]). All c xs => f xs -> f' xs -> f'' xs -> f''' xs) -> Prod h f xss -> Prod h f' xss -> h f'' xss -> h f''' xss
- compare_NS :: r -> (forall (x :: k). f x -> g x -> r) -> r -> NS f xs -> NS g xs -> r
- ccompare_NS :: All c xs => proxy c -> r -> (forall (x :: k). c x => f x -> g x -> r) -> r -> NS f xs -> NS g xs -> r
- compare_SOP :: r -> (forall (xs :: [k]). NP f xs -> NP g xs -> r) -> r -> SOP f xss -> SOP g xss -> r
- ccompare_SOP :: All2 c xss => proxy c -> r -> (forall (xs :: [k]). All c xs => NP f xs -> NP g xs -> r) -> r -> SOP f xss -> SOP g xss -> r
- type family CollapseTo (h :: (k -> Type) -> l -> Type) x :: Type
- class HCollapse (h :: (k -> Type) -> l -> Type) where
- hcollapse :: SListIN h xs => h (K a :: k -> Type) xs -> CollapseTo h a
- class HTraverse_ (h :: (k -> Type) -> l -> Type) where
- hctraverse_ :: (AllN h c xs, Applicative g) => proxy c -> (forall (a :: k). c a => f a -> g ()) -> h f xs -> g ()
- htraverse_ :: (SListIN h xs, Applicative g) => (forall (a :: k). f a -> g ()) -> h f xs -> g ()
- hcfoldMap :: (HTraverse_ h, AllN h c xs, Monoid m) => proxy c -> (forall (a :: k). c a => f a -> m) -> h f xs -> m
- hcfor_ :: (HTraverse_ h, AllN h c xs, Applicative g) => proxy c -> h f xs -> (forall (a :: k). c a => f a -> g ()) -> g ()
- class HAp h => HSequence (h :: (k -> Type) -> l -> Type) where
- hsequence' :: (SListIN h xs, Applicative f) => h (f :.: g) xs -> f (h g xs)
- hctraverse' :: (AllN h c xs, Applicative g) => proxy c -> (forall (a :: k). c a => f a -> g (f' a)) -> h f xs -> g (h f' xs)
- htraverse' :: (SListIN h xs, Applicative g) => (forall (a :: k). f a -> g (f' a)) -> h f xs -> g (h f' xs)
- hsequence :: (SListIN h xs, SListIN (Prod h) xs, HSequence h, Applicative f) => h f xs -> f (h I xs)
- hsequenceK :: (SListIN h xs, SListIN (Prod h) xs, Applicative f, HSequence h) => h (K (f a) :: k -> Type) xs -> f (h (K a :: k -> Type) xs)
- hctraverse :: (HSequence h, AllN h c xs, Applicative g) => proxy c -> (forall a. c a => f a -> g a) -> h f xs -> g (h I xs)
- hcfor :: (HSequence h, AllN h c xs, Applicative g) => proxy c -> h f xs -> (forall a. c a => f a -> g a) -> g (h I xs)
- class HExpand (h :: (k -> Type) -> l -> Type) where
- class ((Same h1 :: (k2 -> Type) -> l2 -> Type) ~ h2, (Same h2 :: (k1 -> Type) -> l1 -> Type) ~ h1) => HTrans (h1 :: (k1 -> Type) -> l1 -> Type) (h2 :: (k2 -> Type) -> l2 -> Type) where
- hfromI :: (AllZipN (Prod h1) (LiftedCoercible I f) xs ys, HTrans h1 h2) => h1 I xs -> h2 f ys
- htoI :: (AllZipN (Prod h1) (LiftedCoercible f I) xs ys, HTrans h1 h2) => h1 f xs -> h2 I ys
- fromList :: SListI xs => [a] -> Maybe (NP (K a :: k -> Type) xs)
- newtype K a (b :: k) :: forall k. Type -> k -> Type = K a
- unK :: K a b -> a
- newtype I a = I a
- unI :: I a -> a
- newtype ((f :: l -> Type) :.: (g :: k -> l)) (p :: k) :: forall l k. (l -> Type) -> (k -> l) -> k -> Type = Comp (f (g p))
- unComp :: (f :.: g) p -> f (g p)
- mapII :: (a -> b) -> I a -> I b
- mapIK :: (a -> b) -> I a -> K b c
- mapKI :: (a -> b) -> K a c -> I b
- mapKK :: (a -> b) -> K a c -> K b d
- mapIII :: (a -> b -> c) -> I a -> I b -> I c
- mapIIK :: (a -> b -> c) -> I a -> I b -> K c d
- mapIKI :: (a -> b -> c) -> I a -> K b d -> I c
- mapIKK :: (a -> b -> c) -> I a -> K b d -> K c e
- mapKII :: (a -> b -> c) -> K a d -> I b -> I c
- mapKIK :: (a -> b -> c) -> K a d -> I b -> K c e
- mapKKI :: (a -> b -> c) -> K a d -> K b e -> I c
- mapKKK :: (a -> b -> c) -> K a d -> K b e -> K c f
- class (AllF c xs, SListI xs) => All (c :: k -> Constraint) (xs :: [k])
- type All2 (c :: k -> Constraint) = All (All c)
- cpara_SList :: All c xs => proxy c -> r ([] :: [k]) -> (forall (y :: k) (ys :: [k]). (c y, All c ys) => r ys -> r (y ': ys)) -> r xs
- ccase_SList :: All c xs => proxy c -> r ([] :: [k]) -> (forall (y :: k) (ys :: [k]). (c y, All c ys) => r (y ': ys)) -> r xs
- class (SListI xs, SListI ys, SameShapeAs xs ys, SameShapeAs ys xs, AllZipF c xs ys) => AllZip (c :: a -> b -> Constraint) (xs :: [a]) (ys :: [b])
- class (AllZipF (AllZip f) xss yss, SListI xss, SListI yss, SameShapeAs xss yss, SameShapeAs yss xss) => AllZip2 (f :: a -> b -> Constraint) (xss :: [[a]]) (yss :: [[b]])
- type family AllN (h :: (k -> Type) -> l -> Type) (c :: k -> Constraint) :: l -> Constraint
- type family AllZipN (h :: (k -> Type) -> l -> Type) (c :: k1 -> k2 -> Constraint) :: l1 -> l2 -> Constraint
- class f (g x) => Compose (f :: k -> Constraint) (g :: k1 -> k) (x :: k1)
- class (f x, g x) => And (f :: k -> Constraint) (g :: k -> Constraint) (x :: k)
- class Top (x :: k)
- class Coercible (f x) (g y) => LiftedCoercible (f :: k -> k0) (g :: k1 -> k0) (x :: k) (y :: k1)
- type family SameShapeAs (xs :: [a]) (ys :: [b]) :: Constraint where ...
- data SList (a :: [k]) :: forall k. [k] -> Type where
- type SListI = All (Top :: k -> Constraint)
- type SListI2 = All (SListI :: [k] -> Constraint)
- sList :: SListI xs => SList xs
- para_SList :: SListI xs => r ([] :: [k]) -> (forall (y :: k) (ys :: [k]). SListI ys => r ys -> r (y ': ys)) -> r xs
- case_SList :: SListI xs => r ([] :: [k]) -> (forall (y :: k) (ys :: [k]). SListI ys => r (y ': ys)) -> r xs
- data Shape (a :: [k]) :: forall k. [k] -> Type where
- shape :: SListI xs => Shape xs
- lengthSList :: SListI xs => proxy xs -> Int
- data Proxy (t :: k) :: forall k. k -> Type = Proxy
Codes and interpretations
class All SListI (Code a) => Generic (a :: Type) where #
The class of representable datatypes.
The SOP approach to generic programming is based on viewing
datatypes as a representation (Rep) built from the sum of
products of its components. The components of are datatype
are specified using the Code type family.
The isomorphism between the original Haskell datatype and its
representation is witnessed by the methods of this class,
from and to. So for instances of this class, the following
laws should (in general) hold:
to.from===id:: a -> afrom.to===id::Repa ->Repa
You typically don't define instances of this class by hand, but rather derive the class instance automatically.
Option 1: Derive via the built-in GHC-generics. For this, you
need to use the DeriveGeneric extension to first derive an
instance of the Generic class from module GHC.Generics.
With this, you can then give an empty instance for Generic, and
the default definitions will just work. The pattern looks as
follows:
import qualified GHC.Generics as GHC import Generics.SOP ... data T = ... deriving (GHC.Generic, ...) instanceGenericT -- empty instanceHasDatatypeInfoT -- empty, if you want/need metadata
Option 2: Derive via Template Haskell. For this, you need to
enable the TemplateHaskell extension. You can then use
deriveGeneric from module Generics.SOP.TH
to have the instance generated for you. The pattern looks as
follows:
import Generics.SOP import Generics.SOP.TH ... data T = ...deriveGeneric''T -- derivesHasDatatypeInfoas well
Tradeoffs: Whether to use Option 1 or 2 is mainly a matter of personal taste. The version based on Template Haskell probably has less run-time overhead.
Non-standard instances:
It is possible to give Generic instances manually that deviate
from the standard scheme, as long as at least
to.from===id:: a -> a
still holds.
Minimal complete definition
Nothing
Associated Types
The code of a datatype.
This is a list of lists of its components. The outer list contains one element per constructor. The inner list contains one element per constructor argument (field).
Example: The datatype
data Tree = Leaf Int | Node Tree Tree
is supposed to have the following code:
type instance Code (Tree a) = '[ '[ Int ] , '[ Tree, Tree ] ]
Methods
Converts from a value to its structural representation.
from :: (GFrom a, Generic a, Rep a ~ SOP I (GCode a)) => a -> Rep a #
Converts from a value to its structural representation.
Converts from a structural representation back to the original value.
to :: (GTo a, Generic a, Rep a ~ SOP I (GCode a)) => Rep a -> a #
Converts from a structural representation back to the original value.
Instances
| Generic Bool # | |
| Generic Ordering # | |
| Generic RuntimeRep # | |
Defined in Generics.SOP.Instances Associated Types type Code RuntimeRep :: [[Type]] # | |
| Generic VecCount # | |
| Generic VecElem # | |
| Generic R # | |
| Generic D # | |
| Generic C # | |
| Generic S # | |
| Generic CallStack # | |
| Generic () # | |
| Generic FFFormat # | |
| Generic E0 # | |
| Generic E1 # | |
| Generic E2 # | |
| Generic E3 # | |
| Generic E6 # | |
| Generic E9 # | |
| Generic E12 # | |
| Generic Void # | |
| Generic StaticPtrInfo # | |
Defined in Generics.SOP.Instances Associated Types type Code StaticPtrInfo :: [[Type]] # | |
| Generic SpecConstrAnnotation # | |
Defined in Generics.SOP.Instances Associated Types type Code SpecConstrAnnotation :: [[Type]] # Methods | |
| Generic DataRep # | |
| Generic ConstrRep # | |
| Generic Fixity # | |
| Generic SrcLoc # | |
| Generic Location # | |
| Generic GiveGCStats # | |
Defined in Generics.SOP.Instances Associated Types type Code GiveGCStats :: [[Type]] # | |
| Generic GCFlags # | |
| Generic ConcFlags # | |
| Generic MiscFlags # | |
| Generic DebugFlags # | |
Defined in Generics.SOP.Instances Associated Types type Code DebugFlags :: [[Type]] # | |
| Generic DoCostCentres # | |
Defined in Generics.SOP.Instances Associated Types type Code DoCostCentres :: [[Type]] # | |
| Generic CCFlags # | |
| Generic DoHeapProfile # | |
Defined in Generics.SOP.Instances Associated Types type Code DoHeapProfile :: [[Type]] # | |
| Generic ProfFlags # | |
| Generic DoTrace # | |
| Generic TraceFlags # | |
Defined in Generics.SOP.Instances Associated Types type Code TraceFlags :: [[Type]] # | |
| Generic TickyFlags # | |
Defined in Generics.SOP.Instances Associated Types type Code TickyFlags :: [[Type]] # | |
| Generic ParFlags # | |
| Generic RTSFlags # | |
| Generic RTSStats # | |
| Generic GCDetails # | |
| Generic ByteOrder # | |
| Generic FormatAdjustment # | |
Defined in Generics.SOP.Instances Associated Types type Code FormatAdjustment :: [[Type]] # Methods from :: FormatAdjustment -> Rep FormatAdjustment # to :: Rep FormatAdjustment -> FormatAdjustment # | |
| Generic FormatSign # | |
Defined in Generics.SOP.Instances Associated Types type Code FormatSign :: [[Type]] # | |
| Generic FieldFormat # | |
Defined in Generics.SOP.Instances Associated Types type Code FieldFormat :: [[Type]] # | |
| Generic FormatParse # | |
Defined in Generics.SOP.Instances Associated Types type Code FormatParse :: [[Type]] # | |
| Generic Version # | |
| Generic HandlePosn # | |
Defined in Generics.SOP.Instances Associated Types type Code HandlePosn :: [[Type]] # | |
| Generic LockMode # | |
| Generic PatternMatchFail # | |
Defined in Generics.SOP.Instances Associated Types type Code PatternMatchFail :: [[Type]] # Methods from :: PatternMatchFail -> Rep PatternMatchFail # to :: Rep PatternMatchFail -> PatternMatchFail # | |
| Generic RecSelError # | |
Defined in Generics.SOP.Instances Associated Types type Code RecSelError :: [[Type]] # | |
| Generic RecConError # | |
Defined in Generics.SOP.Instances Associated Types type Code RecConError :: [[Type]] # | |
| Generic RecUpdError # | |
Defined in Generics.SOP.Instances Associated Types type Code RecUpdError :: [[Type]] # | |
| Generic NoMethodError # | |
Defined in Generics.SOP.Instances Associated Types type Code NoMethodError :: [[Type]] # | |
| Generic TypeError # | |
| Generic NonTermination # | |
Defined in Generics.SOP.Instances Associated Types type Code NonTermination :: [[Type]] # | |
| Generic NestedAtomically # | |
Defined in Generics.SOP.Instances Associated Types type Code NestedAtomically :: [[Type]] # Methods from :: NestedAtomically -> Rep NestedAtomically # to :: Rep NestedAtomically -> NestedAtomically # | |
| Generic BlockReason # | |
Defined in Generics.SOP.Instances Associated Types type Code BlockReason :: [[Type]] # | |
| Generic ThreadStatus # | |
Defined in Generics.SOP.Instances Associated Types type Code ThreadStatus :: [[Type]] # | |
| Generic Errno # | |
| Generic CodingFailureMode # | |
Defined in Generics.SOP.Instances Associated Types type Code CodingFailureMode :: [[Type]] # Methods from :: CodingFailureMode -> Rep CodingFailureMode # to :: Rep CodingFailureMode -> CodingFailureMode # | |
| Generic BlockedIndefinitelyOnMVar # | |
Defined in Generics.SOP.Instances Associated Types type Code BlockedIndefinitelyOnMVar :: [[Type]] # | |
| Generic BlockedIndefinitelyOnSTM # | |
Defined in Generics.SOP.Instances Associated Types type Code BlockedIndefinitelyOnSTM :: [[Type]] # | |
| Generic Deadlock # | |
| Generic AllocationLimitExceeded # | |
Defined in Generics.SOP.Instances Associated Types type Code AllocationLimitExceeded :: [[Type]] # Methods from :: AllocationLimitExceeded -> Rep AllocationLimitExceeded # to :: Rep AllocationLimitExceeded -> AllocationLimitExceeded # | |
| Generic AssertionFailed # | |
Defined in Generics.SOP.Instances Associated Types type Code AssertionFailed :: [[Type]] # Methods from :: AssertionFailed -> Rep AssertionFailed # to :: Rep AssertionFailed -> AssertionFailed # | |
| Generic AsyncException # | |
Defined in Generics.SOP.Instances Associated Types type Code AsyncException :: [[Type]] # | |
| Generic ArrayException # | |
Defined in Generics.SOP.Instances Associated Types type Code ArrayException :: [[Type]] # | |
| Generic FixIOException # | |
Defined in Generics.SOP.Instances Associated Types type Code FixIOException :: [[Type]] # | |
| Generic ExitCode # | |
| Generic IOErrorType # | |
Defined in Generics.SOP.Instances Associated Types type Code IOErrorType :: [[Type]] # | |
| Generic BufferMode # | |
Defined in Generics.SOP.Instances Associated Types type Code BufferMode :: [[Type]] # | |
| Generic Newline # | |
| Generic NewlineMode # | |
Defined in Generics.SOP.Instances Associated Types type Code NewlineMode :: [[Type]] # | |
| Generic IODeviceType # | |
Defined in Generics.SOP.Instances Associated Types type Code IODeviceType :: [[Type]] # | |
| Generic SeekMode # | |
| Generic CodingProgress # | |
Defined in Generics.SOP.Instances Associated Types type Code CodingProgress :: [[Type]] # | |
| Generic BufferState # | |
Defined in Generics.SOP.Instances Associated Types type Code BufferState :: [[Type]] # | |
| Generic MaskingState # | |
Defined in Generics.SOP.Instances Associated Types type Code MaskingState :: [[Type]] # | |
| Generic IOException # | |
Defined in Generics.SOP.Instances Associated Types type Code IOException :: [[Type]] # | |
| Generic ErrorCall # | |
| Generic ArithException # | |
Defined in Generics.SOP.Instances Associated Types type Code ArithException :: [[Type]] # | |
| Generic All # | |
| Generic Any # | |
| Generic Fixity # | |
| Generic Associativity # | |
Defined in Generics.SOP.Instances Associated Types type Code Associativity :: [[Type]] # | |
| Generic SourceUnpackedness # | |
Defined in Generics.SOP.Instances Associated Types type Code SourceUnpackedness :: [[Type]] # Methods | |
| Generic SourceStrictness # | |
Defined in Generics.SOP.Instances Associated Types type Code SourceStrictness :: [[Type]] # Methods from :: SourceStrictness -> Rep SourceStrictness # to :: Rep SourceStrictness -> SourceStrictness # | |
| Generic DecidedStrictness # | |
Defined in Generics.SOP.Instances Associated Types type Code DecidedStrictness :: [[Type]] # Methods from :: DecidedStrictness -> Rep DecidedStrictness # to :: Rep DecidedStrictness -> DecidedStrictness # | |
| Generic CChar # | |
| Generic CSChar # | |
| Generic CUChar # | |
| Generic CShort # | |
| Generic CUShort # | |
| Generic CInt # | |
| Generic CUInt # | |
| Generic CLong # | |
| Generic CULong # | |
| Generic CLLong # | |
| Generic CULLong # | |
| Generic CFloat # | |
| Generic CDouble # | |
| Generic CPtrdiff # | |
| Generic CSize # | |
| Generic CWchar # | |
| Generic CSigAtomic # | |
Defined in Generics.SOP.Instances Associated Types type Code CSigAtomic :: [[Type]] # | |
| Generic CClock # | |
| Generic CTime # | |
| Generic CUSeconds # | |
| Generic CSUSeconds # | |
Defined in Generics.SOP.Instances Associated Types type Code CSUSeconds :: [[Type]] # | |
| Generic CIntPtr # | |
| Generic CUIntPtr # | |
| Generic CIntMax # | |
| Generic CUIntMax # | |
| Generic IOMode # | |
| Generic Fingerprint # | |
Defined in Generics.SOP.Instances Associated Types type Code Fingerprint :: [[Type]] # | |
| Generic Lexeme # | |
| Generic Number # | |
| Generic GeneralCategory # | |
Defined in Generics.SOP.Instances Associated Types type Code GeneralCategory :: [[Type]] # Methods from :: GeneralCategory -> Rep GeneralCategory # to :: Rep GeneralCategory -> GeneralCategory # | |
| Generic SrcLoc # | |
| Generic [a] # | |
| Generic (Maybe a) # | |
| Generic (Par1 p) # | |
| Generic (Complex a) # | |
| Generic (Fixed a) # | |
| Generic (Min a) # | |
| Generic (Max a) # | |
| Generic (First a) # | |
| Generic (Last a) # | |
| Generic (WrappedMonoid m) # | |
Defined in Generics.SOP.Instances Associated Types type Code (WrappedMonoid m) :: [[Type]] # Methods from :: WrappedMonoid m -> Rep (WrappedMonoid m) # to :: Rep (WrappedMonoid m) -> WrappedMonoid m # | |
| Generic (Option a) # | |
| Generic (ArgOrder a) # | |
| Generic (OptDescr a) # | |
| Generic (ArgDescr a) # | |
| Generic (Identity a) # | |
| Generic (Buffer e) # | |
| Generic (First a) # | |
| Generic (Last a) # | |
| Generic (Dual a) # | |
| Generic (Endo a) # | |
| Generic (Sum a) # | |
| Generic (Product a) # | |
| Generic (Down a) # | |
| Generic (NonEmpty a) # | |
| Generic (I a) # | |
| Generic (Either a b) # | |
| Generic (V1 p) # | |
| Generic (U1 p) # | |
| Generic (a, b) # | |
| Generic (Arg a b) # | |
| Generic (Proxy t) # | |
| Generic (a, b, c) # | |
| Generic (BufferCodec from to state) # | |
Defined in Generics.SOP.Instances Associated Types type Code (BufferCodec from to state) :: [[Type]] # Methods from :: BufferCodec from to state -> Rep (BufferCodec from to state) # to :: Rep (BufferCodec from to state) -> BufferCodec from to state # | |
| Generic (Const a b) # | |
| Generic (Alt f a) # | |
| Generic (K a b) # | |
| Generic (K1 i c p) # | |
| Generic ((f :+: g) p) # | |
| Generic ((f :*: g) p) # | |
| Generic (a, b, c, d) # | |
| Generic (Product f g a) # | |
| Generic (Sum f g a) # | |
| Generic ((f -.-> g) a) # | |
| Generic (M1 i c f p) # | |
| Generic ((f :.: g) p) # | |
| Generic (a, b, c, d, e) # | |
| Generic (Compose f g a) # | |
| Generic ((f :.: g) p) # | |
| Generic (a, b, c, d, e, f) # | |
| Generic (a, b, c, d, e, f, g) # | |
| Generic (a, b, c, d, e, f, g, h) # | |
| Generic (a, b, c, d, e, f, g, h, i) # | |
| Generic (a, b, c, d, e, f, g, h, i, j) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) # | |
Defined in Generics.SOP.Instances | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28) # | |
| Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28, t29) # | |
Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28, t29) :: [[Type]] # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28, t29) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28, t29) # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28, t29) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z, t26, t27, t28, t29) # | |
type IsProductType (a :: Type) (xs :: [Type]) = (Generic a, Code a ~ '[xs]) #
Constraint that captures that a datatype is a product type, i.e., a type with a single constructor.
It also gives access to the code for the arguments of that constructor.
Since: 0.3.1.0
type IsEnumType (a :: Type) = (Generic a, All ((~) '[]) (Code a)) #
Constraint that captures that a datatype is an enumeration type, i.e., none of the constructors have any arguments.
Since: 0.3.1.0
type IsWrappedType (a :: Type) (x :: Type) = (Generic a, Code a ~ '['[x]]) #
Constraint that captures that a datatype is a single-constructor, single-field datatype. This always holds for newtype-defined types, but it can also be true for data-defined types.
The constraint also gives access to the type that is wrapped.
Since: 0.3.1.0
type IsNewtype (a :: Type) (x :: Type) = (IsWrappedType a x, Coercible a x) #
Constraint that captures that a datatype is a newtype. This makes use of the fact that newtypes are always coercible to the type they wrap, whereas datatypes are not.
Since: 0.3.1.0
n-ary datatypes
data NP (a :: k -> Type) (b :: [k]) :: forall k. (k -> Type) -> [k] -> Type where #
An n-ary product.
The product is parameterized by a type constructor f and
indexed by a type-level list xs. The length of the list
determines the number of elements in the product, and if the
i-th element of the list is of type x, then the i-th
element of the product is of type f x.
The constructor names are chosen to resemble the names of the list constructors.
Two common instantiations of f are the identity functor I
and the constant functor K. For I, the product becomes a
heterogeneous list, where the type-level list describes the
types of its components. For K a
In the context of the SOP approach to generic programming, an n-ary product describes the structure of the arguments of a single data constructor.
Examples:
I 'x' :* I True :* Nil :: NP I '[ Char, Bool ] K 0 :* K 1 :* Nil :: NP (K Int) '[ Char, Bool ] Just 'x' :* Nothing :* Nil :: NP Maybe '[ Char, Bool ]
Constructors
| Nil :: forall k (a :: k -> Type) (b :: [k]). NP a ([] :: [k]) | |
| (:*) :: forall k (a :: k -> Type) (b :: [k]) (x :: k) (xs :: [k]). a x -> NP a xs -> NP a (x ': xs) infixr 5 |
Instances
| HTrans (NP :: (k1 -> Type) -> [k1] -> Type) (NP :: (k2 -> Type) -> [k2] -> Type) | |
| HPure (NP :: (k -> Type) -> [k] -> Type) | |
| HAp (NP :: (k -> Type) -> [k] -> Type) | |
| HCollapse (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP | |
| HTraverse_ (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP Methods hctraverse_ :: (AllN NP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NP f xs -> g () # htraverse_ :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NP f xs -> g () # | |
| HSequence (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP Methods hsequence' :: (SListIN NP xs, Applicative f) => NP (f :.: g) xs -> f (NP g xs) # hctraverse' :: (AllN NP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g (f' a)) -> NP f xs -> g (NP f' xs) # htraverse' :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> NP f xs -> g (NP f' xs) # | |
| All (Compose Eq f) xs => Eq (NP f xs) | |
| (All (Compose Eq f) xs, All (Compose Ord f) xs) => Ord (NP f xs) | |
| All (Compose Show f) xs => Show (NP f xs) | |
| All (Compose Semigroup f) xs => Semigroup (NP f xs) | Since: sop-core-0.4.0.0 |
| (All (Compose Monoid f) xs, All (Compose Semigroup f) xs) => Monoid (NP f xs) | Since: sop-core-0.4.0.0 |
| All (Compose NFData f) xs => NFData (NP f xs) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.NP | |
| type Same (NP :: (k1 -> Type) -> [k1] -> Type) | |
| type Prod (NP :: (k -> Type) -> [k] -> Type) | |
| type UnProd (NP :: (k -> Type) -> [k] -> Type) | |
| type CollapseTo (NP :: (k -> Type) -> [k] -> Type) a | |
Defined in Data.SOP.NP | |
| type SListIN (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP | |
| type AllN (NP :: (k -> Type) -> [k] -> Type) (c :: k -> Constraint) | |
Defined in Data.SOP.NP | |
| type AllZipN (NP :: (k -> Type) -> [k] -> Type) (c :: a -> b -> Constraint) | |
Defined in Data.SOP.NP | |
data NS (a :: k -> Type) (b :: [k]) :: forall k. (k -> Type) -> [k] -> Type where #
An n-ary sum.
The sum is parameterized by a type constructor f and
indexed by a type-level list xs. The length of the list
determines the number of choices in the sum and if the
i-th element of the list is of type x, then the i-th
choice of the sum is of type f x.
The constructor names are chosen to resemble Peano-style
natural numbers, i.e., Z is for "zero", and S is for
"successor". Chaining S and Z chooses the corresponding
component of the sum.
Examples:
Z :: f x -> NS f (x ': xs) S . Z :: f y -> NS f (x ': y ': xs) S . S . Z :: f z -> NS f (x ': y ': z ': xs) ...
Note that empty sums (indexed by an empty list) have no non-bottom elements.
Two common instantiations of f are the identity functor I
and the constant functor K. For I, the sum becomes a
direct generalization of the Either type to arbitrarily many
choices. For K a
In the context of the SOP approach to generic programming, an n-ary sum describes the top-level structure of a datatype, which is a choice between all of its constructors.
Examples:
Z (I 'x') :: NS I '[ Char, Bool ] S (Z (I True)) :: NS I '[ Char, Bool ] S (Z (K 1)) :: NS (K Int) '[ Char, Bool ]
Constructors
| Z :: forall k (a :: k -> Type) (b :: [k]) (x :: k) (xs :: [k]). a x -> NS a (x ': xs) | |
| S :: forall k (a :: k -> Type) (b :: [k]) (xs :: [k]) (x :: k). NS a xs -> NS a (x ': xs) |
Instances
| HTrans (NS :: (k1 -> Type) -> [k1] -> Type) (NS :: (k2 -> Type) -> [k2] -> Type) | |
| HAp (NS :: (k -> Type) -> [k] -> Type) | |
| HCollapse (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
| HTraverse_ (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS Methods hctraverse_ :: (AllN NS c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NS f xs -> g () # htraverse_ :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NS f xs -> g () # | |
| HSequence (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS Methods hsequence' :: (SListIN NS xs, Applicative f) => NS (f :.: g) xs -> f (NS g xs) # hctraverse' :: (AllN NS c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g (f' a)) -> NS f xs -> g (NS f' xs) # htraverse' :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> NS f xs -> g (NS f' xs) # | |
| HIndex (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
| HApInjs (NS :: (k -> Type) -> [k] -> Type) | |
| HExpand (NS :: (k -> Type) -> [k] -> Type) | |
| All (Compose Eq f) xs => Eq (NS f xs) | |
| (All (Compose Eq f) xs, All (Compose Ord f) xs) => Ord (NS f xs) | |
| All (Compose Show f) xs => Show (NS f xs) | |
| All (Compose NFData f) xs => NFData (NS f xs) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.NS | |
| type Same (NS :: (k1 -> Type) -> [k1] -> Type) | |
| type Prod (NS :: (k -> Type) -> [k] -> Type) | |
| type CollapseTo (NS :: (k -> Type) -> [k] -> Type) a | |
Defined in Data.SOP.NS | |
| type SListIN (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
| type AllN (NS :: (k -> Type) -> [k] -> Type) (c :: k -> Constraint) | |
Defined in Data.SOP.NS | |
newtype SOP (f :: k -> Type) (xss :: [[k]]) :: forall k. (k -> Type) -> [[k]] -> Type #
A sum of products.
This is a 'newtype' for an NS of an NP. The elements of the
(inner) products are applications of the parameter f. The type
SOP is indexed by the list of lists that determines the sizes
of both the (outer) sum and all the (inner) products, as well as
the types of all the elements of the inner products.
An SOP I
Instances
| HTrans (SOP :: (k1 -> Type) -> [[k1]] -> Type) (SOP :: (k2 -> Type) -> [[k2]] -> Type) | |
| HAp (SOP :: (k -> Type) -> [[k]] -> Type) | |
| HCollapse (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS | |
| HTraverse_ (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS Methods hctraverse_ :: (AllN SOP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> SOP f xs -> g () # htraverse_ :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> SOP f xs -> g () # | |
| HSequence (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS Methods hsequence' :: (SListIN SOP xs, Applicative f) => SOP (f :.: g) xs -> f (SOP g xs) # hctraverse' :: (AllN SOP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g (f' a)) -> SOP f xs -> g (SOP f' xs) # htraverse' :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> SOP f xs -> g (SOP f' xs) # | |
| HIndex (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS | |
| HApInjs (SOP :: (k -> Type) -> [[k]] -> Type) | |
| HExpand (SOP :: (k -> Type) -> [[k]] -> Type) | |
| Eq (NS (NP f) xss) => Eq (SOP f xss) | |
| Ord (NS (NP f) xss) => Ord (SOP f xss) | |
| Show (NS (NP f) xss) => Show (SOP f xss) | |
| NFData (NS (NP f) xss) => NFData (SOP f xss) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.NS | |
| type Same (SOP :: (k1 -> Type) -> [[k1]] -> Type) | |
| type Prod (SOP :: (k -> Type) -> [[k]] -> Type) | |
| type CollapseTo (SOP :: (k -> Type) -> [[k]] -> Type) a | |
Defined in Data.SOP.NS | |
| type SListIN (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS | |
| type AllN (SOP :: (k -> Type) -> [[k]] -> Type) (c :: k -> Constraint) | |
Defined in Data.SOP.NS | |
newtype POP (f :: k -> Type) (xss :: [[k]]) :: forall k. (k -> Type) -> [[k]] -> Type #
A product of products.
This is a 'newtype' for an NP of an NP. The elements of the
inner products are applications of the parameter f. The type
POP is indexed by the list of lists that determines the lengths
of both the outer and all the inner products, as well as the types
of all the elements of the inner products.
A POP is reminiscent of a two-dimensional table (but the inner
lists can all be of different length). In the context of the SOP
approach to generic programming, a POP is useful to represent
information that is available for all arguments of all constructors
of a datatype.
Instances
| HTrans (POP :: (k1 -> Type) -> [[k1]] -> Type) (POP :: (k2 -> Type) -> [[k2]] -> Type) | |
| HPure (POP :: (k -> Type) -> [[k]] -> Type) | |
| HAp (POP :: (k -> Type) -> [[k]] -> Type) | |
| HCollapse (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP | |
| HTraverse_ (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP Methods hctraverse_ :: (AllN POP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> POP f xs -> g () # htraverse_ :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> POP f xs -> g () # | |
| HSequence (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP Methods hsequence' :: (SListIN POP xs, Applicative f) => POP (f :.: g) xs -> f (POP g xs) # hctraverse' :: (AllN POP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g (f' a)) -> POP f xs -> g (POP f' xs) # htraverse' :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> POP f xs -> g (POP f' xs) # | |
| Eq (NP (NP f) xss) => Eq (POP f xss) | |
| Ord (NP (NP f) xss) => Ord (POP f xss) | |
| Show (NP (NP f) xss) => Show (POP f xss) | |
| Semigroup (NP (NP f) xss) => Semigroup (POP f xss) | Since: sop-core-0.4.0.0 |
| Monoid (NP (NP f) xss) => Monoid (POP f xss) | Since: sop-core-0.4.0.0 |
| NFData (NP (NP f) xss) => NFData (POP f xss) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.NP | |
| type Same (POP :: (k1 -> Type) -> [[k1]] -> Type) | |
| type Prod (POP :: (k -> Type) -> [[k]] -> Type) | |
| type UnProd (POP :: (k -> Type) -> [[k]] -> Type) | |
| type CollapseTo (POP :: (k -> Type) -> [[k]] -> Type) a | |
Defined in Data.SOP.NP | |
| type SListIN (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP | |
| type AllN (POP :: (k -> Type) -> [[k]] -> Type) (c :: k -> Constraint) | |
Defined in Data.SOP.NP | |
| type AllZipN (POP :: (k -> Type) -> [[k]] -> Type) (c :: a -> b -> Constraint) | |
Defined in Data.SOP.NP | |
Metadata
data DatatypeInfo :: [[Type]] -> Type where #
Metadata for a datatype.
A value of type DatatypeInfo cCode c
The constructor indicates whether the datatype has been declared using newtype
or not.
Constructors
| ADT :: ModuleName -> DatatypeName -> NP ConstructorInfo xss -> DatatypeInfo xss | |
| Newtype :: ModuleName -> DatatypeName -> ConstructorInfo '[x] -> DatatypeInfo '['[x]] |
Instances
| All (Compose Eq ConstructorInfo) xs => Eq (DatatypeInfo xs) # | |
Defined in Generics.SOP.Metadata Methods (==) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # (/=) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # | |
| (All (Compose Eq ConstructorInfo) xs, All (Compose Ord ConstructorInfo) xs) => Ord (DatatypeInfo xs) # | |
Defined in Generics.SOP.Metadata Methods compare :: DatatypeInfo xs -> DatatypeInfo xs -> Ordering # (<) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # (<=) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # (>) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # (>=) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # max :: DatatypeInfo xs -> DatatypeInfo xs -> DatatypeInfo xs # min :: DatatypeInfo xs -> DatatypeInfo xs -> DatatypeInfo xs # | |
| All (Compose Show ConstructorInfo) xs => Show (DatatypeInfo xs) # | |
Defined in Generics.SOP.Metadata Methods showsPrec :: Int -> DatatypeInfo xs -> ShowS # show :: DatatypeInfo xs -> String # showList :: [DatatypeInfo xs] -> ShowS # | |
moduleName :: DatatypeInfo xss -> ModuleName #
The module name where a datatype is defined.
Since: 0.2.3.0
datatypeName :: DatatypeInfo xss -> DatatypeName #
The name of a datatype (or newtype).
Since: 0.2.3.0
constructorInfo :: DatatypeInfo xss -> NP ConstructorInfo xss #
The constructor info for a datatype (or newtype).
Since: 0.2.3.0
data ConstructorInfo :: [Type] -> Type where #
Metadata for a single constructors.
This is indexed by the product structure of the constructor components.
Constructors
| Constructor :: SListI xs => ConstructorName -> ConstructorInfo xs | |
| Infix :: ConstructorName -> Associativity -> Fixity -> ConstructorInfo '[x, y] | |
| Record :: SListI xs => ConstructorName -> NP FieldInfo xs -> ConstructorInfo xs |
Instances
constructorName :: ConstructorInfo xs -> ConstructorName #
The name of a constructor.
Since: 0.2.3.0
data FieldInfo :: Type -> Type where #
For records, this functor maps the component to its selector name.
Instances
| Functor FieldInfo # | |
| Eq (FieldInfo a) # | |
| Ord (FieldInfo a) # | |
Defined in Generics.SOP.Metadata | |
| Show (FieldInfo a) # | |
class Generic a => HasDatatypeInfo a where #
A class of datatypes that have associated metadata.
It is possible to use the sum-of-products approach to generic programming without metadata. If you need metadata in a function, an additional constraint on this class is in order.
You typically don't define instances of this class by hand, but
rather derive the class instance automatically. See the documentation
of Generic for the options.
Minimal complete definition
Nothing
Methods
datatypeInfo :: proxy a -> DatatypeInfo (Code a) #
Term-level datatype info; by default, the term-level datatype info is produced from the type-level info.
datatypeInfo :: (GDatatypeInfo a, GCode a ~ Code a) => proxy a -> DatatypeInfo (Code a) #
Term-level datatype info; by default, the term-level datatype info is produced from the type-level info.
Instances
type DatatypeName = String #
The name of a datatype.
type ModuleName = String #
The name of a module.
type ConstructorName = String #
The name of a data constructor.
data Associativity #
Datatype to represent the associativity of a constructor
Constructors
| LeftAssociative | |
| RightAssociative | |
| NotAssociative |
Instances
Combinators
Constructing products
class HPure (h :: (k -> Type) -> l -> Type) where #
Methods
hpure :: SListIN h xs => (forall (a :: k). f a) -> h f xs #
Corresponds to pure directly.
Instances:
hpure,pure_NP::SListIxs => (forall a. f a) ->NPf xshpure,pure_POP::SListI2xss => (forall a. f a) ->POPf xss
hcpure :: AllN h c xs => proxy c -> (forall (a :: k). c a => f a) -> h f xs #
A variant of hpure that allows passing in a constrained
argument.
Calling hcpure f ss :: h f xs causes f to be
applied at all the types that are contained in xs. Therefore,
the constraint c has to be satisfied for all elements of xs,
which is what AllN h c xs
Instances:
hcpure,cpure_NP:: (Allc xs ) => proxy c -> (forall a. c a => f a) ->NPf xshcpure,cpure_POP:: (All2c xss) => proxy c -> (forall a. c a => f a) ->POPf xss
Destructing products
type Projection (f :: k -> Type) (xs :: [k]) = (K (NP f xs) :: k -> Type) -.-> f #
The type of projections from an n-ary product.
A projection is a function from the n-ary product to a single element.
projections :: SListI xs => NP (Projection f xs) xs #
Compute all projections from an n-ary product.
Each element of the resulting product contains one of the projections.
shiftProjection :: Projection f xs a2 -> Projection f (x ': xs) a2 #
Application
newtype ((f :: k -> Type) -.-> (g :: k -> Type)) (a :: k) :: forall k. (k -> Type) -> (k -> Type) -> k -> Type infixr 1 #
Lifted functions.
Instances
| HasDatatypeInfo ((f -.-> g) a) # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f -.-> g) a) :: DatatypeInfo # Methods datatypeInfo :: proxy ((f -.-> g) a) -> DatatypeInfo (Code ((f -.-> g) a)) # | |
| Generic ((f -.-> g) a) # | |
| type DatatypeInfoOf ((f -.-> g) a) # | |
Defined in Generics.SOP.Instances | |
| type Code ((f -.-> g) a) # | |
Defined in Generics.SOP.Instances | |
fn :: (f a -> f' a) -> (f -.-> f') a #
Construct a lifted function.
Same as Fn. Only available for uniformity with the
higher-arity versions.
fn_3 :: (f a -> f' a -> f'' a -> f''' a) -> (f -.-> (f' -.-> (f'' -.-> f'''))) a #
Construct a ternary lifted function.
fn_4 :: (f a -> f' a -> f'' a -> f''' a -> f'''' a) -> (f -.-> (f' -.-> (f'' -.-> (f''' -.-> f'''')))) a #
Construct a quarternary lifted function.
type family Prod (h :: (k -> Type) -> l -> Type) :: (k -> Type) -> l -> Type #
Maps a structure containing sums to the corresponding product structure.
class (Prod (Prod h) ~ Prod h, HPure (Prod h)) => HAp (h :: (k -> Type) -> l -> Type) where #
A generalization of <*>.
Methods
hap :: Prod h (f -.-> g) xs -> h f xs -> h g xs #
Corresponds to <*>.
For products (NP) as well as products of products
(POP), the correspondence is rather direct. We combine
a structure containing (lifted) functions and a compatible structure
containing corresponding arguments into a compatible structure
containing results.
The same combinator can also be used to combine a product structure of functions with a sum structure of arguments, which then results in another sum structure of results. The sum structure determines which part of the product structure will be used.
Instances:
hap,ap_NP::NP(f -.-> g) xs ->NPf xs ->NPg xshap,ap_NS::NP(f -.-> g) xs ->NSf xs ->NSg xshap,ap_POP::POP(f -.-> g) xss ->POPf xss ->POPg xsshap,ap_SOP::POP(f -.-> g) xss ->SOPf xss ->SOPg xss
Lifting / mapping
hliftA :: (SListIN (Prod h) xs, HAp h) => (forall (a :: k). f a -> f' a) -> h f xs -> h f' xs #
A generalized form of liftA,
which in turn is a generalized map.
Takes a lifted function and applies it to every element of a structure while preserving its shape.
Specification:
hliftAf xs =hpure(fnf) `hap` xs
Instances:
hliftA,liftA_NP::SListIxs => (forall a. f a -> f' a) ->NPf xs ->NPf' xshliftA,liftA_NS::SListIxs => (forall a. f a -> f' a) ->NSf xs ->NSf' xshliftA,liftA_POP::SListI2xss => (forall a. f a -> f' a) ->POPf xss ->POPf' xsshliftA,liftA_SOP::SListI2xss => (forall a. f a -> f' a) ->SOPf xss ->SOPf' xss
hliftA2 :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall (a :: k). f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs #
A generalized form of liftA2,
which in turn is a generalized zipWith.
Takes a lifted binary function and uses it to combine two structures of equal shape into a single structure.
It either takes two product structures to a product structure, or one product and one sum structure to a sum structure.
Specification:
hliftA2f xs ys =hpure(fn_2f) `hap` xs `hap` ys
Instances:
hliftA2,liftA2_NP::SListIxs => (forall a. f a -> f' a -> f'' a) ->NPf xs ->NPf' xs ->NPf'' xshliftA2,liftA2_NS::SListIxs => (forall a. f a -> f' a -> f'' a) ->NPf xs ->NSf' xs ->NSf'' xshliftA2,liftA2_POP::SListI2xss => (forall a. f a -> f' a -> f'' a) ->POPf xss ->POPf' xss ->POPf'' xsshliftA2,liftA2_SOP::SListI2xss => (forall a. f a -> f' a -> f'' a) ->POPf xss ->SOPf' xss ->SOPf'' xss
hliftA3 :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall (a :: k). f a -> f' a -> f'' a -> f''' a) -> Prod h f xs -> Prod h f' xs -> h f'' xs -> h f''' xs #
A generalized form of liftA3,
which in turn is a generalized zipWith3.
Takes a lifted ternary function and uses it to combine three structures of equal shape into a single structure.
It either takes three product structures to a product structure, or two product structures and one sum structure to a sum structure.
Specification:
hliftA3f xs ys zs =hpure(fn_3f) `hap` xs `hap` ys `hap` zs
Instances:
hliftA3,liftA3_NP::SListIxs => (forall a. f a -> f' a -> f'' a -> f''' a) ->NPf xs ->NPf' xs ->NPf'' xs ->NPf''' xshliftA3,liftA3_NS::SListIxs => (forall a. f a -> f' a -> f'' a -> f''' a) ->NPf xs ->NPf' xs ->NSf'' xs ->NSf''' xshliftA3,liftA3_POP::SListI2xss => (forall a. f a -> f' a -> f'' a -> f''' a) ->POPf xss ->POPf' xss ->POPf'' xss ->POPf''' xshliftA3,liftA3_SOP::SListI2xss => (forall a. f a -> f' a -> f'' a -> f''' a) ->POPf xss ->POPf' xss ->SOPf'' xss ->SOPf''' xs
hcliftA :: (AllN (Prod h) c xs, HAp h) => proxy c -> (forall (a :: k). c a => f a -> f' a) -> h f xs -> h f' xs #
hcliftA2 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall (a :: k). c a => f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs #
hcliftA3 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall (a :: k). c a => f a -> f' a -> f'' a -> f''' a) -> Prod h f xs -> Prod h f' xs -> h f'' xs -> h f''' xs #
hmap :: (SListIN (Prod h) xs, HAp h) => (forall (a :: k). f a -> f' a) -> h f xs -> h f' xs #
Another name for hliftA.
Since: sop-core-0.2
hzipWith :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall (a :: k). f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs #
Another name for hliftA2.
Since: sop-core-0.2
hzipWith3 :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall (a :: k). f a -> f' a -> f'' a -> f''' a) -> Prod h f xs -> Prod h f' xs -> h f'' xs -> h f''' xs #
Another name for hliftA3.
Since: sop-core-0.2
hcmap :: (AllN (Prod h) c xs, HAp h) => proxy c -> (forall (a :: k). c a => f a -> f' a) -> h f xs -> h f' xs #
Another name for hcliftA.
Since: sop-core-0.2
hczipWith :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall (a :: k). c a => f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs #
Another name for hcliftA2.
Since: sop-core-0.2
hczipWith3 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall (a :: k). c a => f a -> f' a -> f'' a -> f''' a) -> Prod h f xs -> Prod h f' xs -> h f'' xs -> h f''' xs #
Another name for hcliftA3.
Since: sop-core-0.2
Constructing sums
type Injection (f :: k -> Type) (xs :: [k]) = f -.-> (K (NS f xs) :: k -> Type) #
The type of injections into an n-ary sum.
If you expand the type synonyms and newtypes involved, you get
Injection f xs a = (f -.-> K (NS f xs)) a ~= f a -> K (NS f xs) a ~= f a -> NS f xs
If we pick a to be an element of xs, this indeed corresponds to an
injection into the sum.
injections :: SListI xs => NP (Injection f xs) xs #
Compute all injections into an n-ary sum.
Each element of the resulting product contains one of the injections.
shift :: Injection f xs a2 -> Injection f (x ': xs) a2 #
Shift an injection.
Given an injection, return an injection into a sum that is one component larger.
shiftInjection :: Injection f xs a2 -> Injection f (x ': xs) a2 #
Shift an injection.
Given an injection, return an injection into a sum that is one component larger.
type family UnProd (h :: (k -> Type) -> l -> Type) :: (k -> Type) -> l -> Type #
Maps a structure containing products to the corresponding sum structure.
Since: sop-core-0.2.4.0
class UnProd (Prod h) ~ h => HApInjs (h :: (k -> Type) -> l -> Type) where #
A class for applying all injections corresponding to a sum-like structure to a table containing suitable arguments.
Methods
hapInjs :: SListIN h xs => Prod h f xs -> [h f xs] #
For a given table (product-like structure), produce a list where each element corresponds to the application of an injection function into the corresponding sum-like structure.
Instances:
hapInjs,apInjs_NP::SListIxs =>NPf xs -> [NSf xs ]hapInjs,apInjs_SOP::SListI2xss =>POPf xs -> [SOPf xss]
Examples:
>>>hapInjs (I 'x' :* I True :* I 2 :* Nil) :: [NS I '[Char, Bool, Int]][Z (I 'x'),S (Z (I True)),S (S (Z (I 2)))]
>>>hapInjs (POP ((I 'x' :* Nil) :* (I True :* I 2 :* Nil) :* Nil)) :: [SOP I '[ '[Char], '[Bool, Int]]][SOP (Z (I 'x' :* Nil)),SOP (S (Z (I True :* I 2 :* Nil)))]
Unfortunately the type-signatures are required in GHC-7.10 and older.
Since: sop-core-0.2.4.0
apInjs_NP :: SListI xs => NP f xs -> [NS f xs] #
Apply injections to a product.
Given a product containing all possible choices, produce a list of sums by applying each injection to the appropriate element.
Example:
>>>apInjs_NP (I 'x' :* I True :* I 2 :* Nil)[Z (I 'x'),S (Z (I True)),S (S (Z (I 2)))]
apInjs_POP :: SListI xss => POP f xss -> [SOP f xss] #
Apply injections to a product of product.
This operates on the outer product only. Given a product containing all possible choices (that are products), produce a list of sums (of products) by applying each injection to the appropriate element.
Example:
>>>apInjs_POP (POP ((I 'x' :* Nil) :* (I True :* I 2 :* Nil) :* Nil))[SOP (Z (I 'x' :* Nil)),SOP (S (Z (I True :* I 2 :* Nil)))]
Destructing sums
unZ :: NS f (x ': ([] :: [k])) -> f x #
Extract the payload from a unary sum.
For larger sums, this function would be partial, so it is only provided with a rather restrictive type.
Example:
>>>unZ (Z (I 'x'))I 'x'
Since: sop-core-0.2.2.0
class HIndex (h :: (k -> Type) -> l -> Type) where #
A class for determining which choice in a sum-like structure a value represents.
Methods
If h is a sum-like structure representing a choice
between n different options, and x is a value of
type h f xs, then hindex x0 and n - 1 representing the index of the choice
made by x.
Instances:
hindex,index_NS::NSf xs -> Inthindex,index_SOP::SOPf xs -> Int
Examples:
>>>hindex (S (S (Z (I False))))2>>>hindex (Z (K ()))0>>>hindex (SOP (S (Z (I True :* I 'x' :* Nil))))1
Since: sop-core-0.2.4.0
Dealing with All c
All chcliftA' :: (All2 c xss, Prod h ~ (NP :: ([k] -> Type) -> [[k]] -> Type), HAp h) => proxy c -> (forall (xs :: [k]). All c xs => f xs -> f' xs) -> h f xss -> h f' xss #
Lift a constrained function operating on a list-indexed structure to a function on a list-of-list-indexed structure.
This is a variant of hcliftA.
Specification:
hcliftA'p f xs =hpure(fn_2$ \AllDictC-> f) `hap`allDict_NPp `hap` xs
Instances:
hcliftA'::All2c xss => proxy c -> (forall xs.Allc xs => f xs -> f' xs) ->NPf xss ->NPf' xsshcliftA'::All2c xss => proxy c -> (forall xs.Allc xs => f xs -> f' xs) ->NSf xss ->NSf' xss
hcliftA2' :: (All2 c xss, Prod h ~ (NP :: ([k] -> Type) -> [[k]] -> Type), HAp h) => proxy c -> (forall (xs :: [k]). All c xs => f xs -> f' xs -> f'' xs) -> Prod h f xss -> h f' xss -> h f'' xss #
Like hcliftA', but for binary functions.
hcliftA3' :: (All2 c xss, Prod h ~ (NP :: ([k] -> Type) -> [[k]] -> Type), HAp h) => proxy c -> (forall (xs :: [k]). All c xs => f xs -> f' xs -> f'' xs -> f''' xs) -> Prod h f xss -> Prod h f' xss -> h f'' xss -> h f''' xss #
Like hcliftA', but for ternay functions.
Comparison
Arguments
| :: r | what to do if first is smaller |
| -> (forall (x :: k). f x -> g x -> r) | what to do if both are equal |
| -> r | what to do if first is larger |
| -> NS f xs | |
| -> NS g xs | |
| -> r |
Compare two sums with respect to the choice they are making.
A value that chooses the first option is considered smaller than one that chooses the second option.
If the choices are different, then either the first (if the first is smaller than the second) or the third (if the first is larger than the second) argument are called. If both choices are equal, then the second argument is called, which has access to the elements contained in the sums.
Since: sop-core-0.3.2.0
Arguments
| :: All c xs | |
| => proxy c | |
| -> r | what to do if first is smaller |
| -> (forall (x :: k). c x => f x -> g x -> r) | what to do if both are equal |
| -> r | what to do if first is larger |
| -> NS f xs | |
| -> NS g xs | |
| -> r |
Constrained version of compare_NS.
Since: sop-core-0.3.2.0
Arguments
| :: r | what to do if first is smaller |
| -> (forall (xs :: [k]). NP f xs -> NP g xs -> r) | what to do if both are equal |
| -> r | what to do if first is larger |
| -> SOP f xss | |
| -> SOP g xss | |
| -> r |
Compare two sums of products with respect to the choice in the sum they are making.
Only the sum structure is used for comparison.
This is a small wrapper around ccompare_NS for
a common special case.
Since: sop-core-0.3.2.0
Arguments
| :: All2 c xss | |
| => proxy c | |
| -> r | what to do if first is smaller |
| -> (forall (xs :: [k]). All c xs => NP f xs -> NP g xs -> r) | what to do if both are equal |
| -> r | what to do if first is larger |
| -> SOP f xss | |
| -> SOP g xss | |
| -> r |
Constrained version of compare_SOP.
Since: sop-core-0.3.2.0
Collapsing
type family CollapseTo (h :: (k -> Type) -> l -> Type) x :: Type #
Maps products to lists, and sums to identities.
Instances
| type CollapseTo (NS :: (k -> Type) -> [k] -> Type) a | |
Defined in Data.SOP.NS | |
| type CollapseTo (SOP :: (k -> Type) -> [[k]] -> Type) a | |
Defined in Data.SOP.NS | |
| type CollapseTo (NP :: (k -> Type) -> [k] -> Type) a | |
Defined in Data.SOP.NP | |
| type CollapseTo (POP :: (k -> Type) -> [[k]] -> Type) a | |
Defined in Data.SOP.NP | |
class HCollapse (h :: (k -> Type) -> l -> Type) where #
A class for collapsing a heterogeneous structure into a homogeneous one.
Methods
hcollapse :: SListIN h xs => h (K a :: k -> Type) xs -> CollapseTo h a #
Collapse a heterogeneous structure with homogeneous elements into a homogeneous structure.
If a heterogeneous structure is instantiated to the constant
functor K, then it is in fact homogeneous. This function
maps such a value to a simpler Haskell datatype reflecting that.
An NS (K a)a, and an NP (K a)as.
Instances:
hcollapse,collapse_NP::NP(Ka) xs -> [a]hcollapse,collapse_NS::NS(Ka) xs -> ahcollapse,collapse_POP::POP(Ka) xss -> [[a]]hcollapse,collapse_SOP::SOP(Ka) xss -> [a]
Instances
| HCollapse (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS | |
| HCollapse (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
| HCollapse (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP | |
| HCollapse (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP | |
Folding and sequencing
class HTraverse_ (h :: (k -> Type) -> l -> Type) where #
Methods
hctraverse_ :: (AllN h c xs, Applicative g) => proxy c -> (forall (a :: k). c a => f a -> g ()) -> h f xs -> g () #
Corresponds to traverse_.
Instances:
hctraverse_,ctraverse__NP:: (Allc xs ,Applicativeg) => proxy c -> (forall a. c a => f a -> g ()) ->NPf xs -> g ()hctraverse_,ctraverse__NS:: (All2c xs ,Applicativeg) => proxy c -> (forall a. c a => f a -> g ()) ->NSf xs -> g ()hctraverse_,ctraverse__POP:: (Allc xss,Applicativeg) => proxy c -> (forall a. c a => f a -> g ()) ->POPf xss -> g ()hctraverse_,ctraverse__SOP:: (All2c xss,Applicativeg) => proxy c -> (forall a. c a => f a -> g ()) ->SOPf xss -> g ()
Since: sop-core-0.3.2.0
htraverse_ :: (SListIN h xs, Applicative g) => (forall (a :: k). f a -> g ()) -> h f xs -> g () #
Unconstrained version of hctraverse_.
Instances:
traverse_,traverse__NP:: (SListIxs ,Applicativeg) => (forall a. f a -> g ()) ->NPf xs -> g ()traverse_,traverse__NS:: (SListIxs ,Applicativeg) => (forall a. f a -> g ()) ->NSf xs -> g ()traverse_,traverse__POP:: (SListI2xss,Applicativeg) => (forall a. f a -> g ()) ->POPf xss -> g ()traverse_,traverse__SOP:: (SListI2xss,Applicativeg) => (forall a. f a -> g ()) ->SOPf xss -> g ()
Since: sop-core-0.3.2.0
Instances
| HTraverse_ (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS Methods hctraverse_ :: (AllN SOP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> SOP f xs -> g () # htraverse_ :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> SOP f xs -> g () # | |
| HTraverse_ (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS Methods hctraverse_ :: (AllN NS c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NS f xs -> g () # htraverse_ :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NS f xs -> g () # | |
| HTraverse_ (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP Methods hctraverse_ :: (AllN POP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> POP f xs -> g () # htraverse_ :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> POP f xs -> g () # | |
| HTraverse_ (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP Methods hctraverse_ :: (AllN NP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NP f xs -> g () # htraverse_ :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NP f xs -> g () # | |
hcfoldMap :: (HTraverse_ h, AllN h c xs, Monoid m) => proxy c -> (forall (a :: k). c a => f a -> m) -> h f xs -> m #
Special case of hctraverse_.
Since: sop-core-0.3.2.0
hcfor_ :: (HTraverse_ h, AllN h c xs, Applicative g) => proxy c -> h f xs -> (forall (a :: k). c a => f a -> g ()) -> g () #
Flipped version of hctraverse_.
Since: sop-core-0.3.2.0
class HAp h => HSequence (h :: (k -> Type) -> l -> Type) where #
A generalization of sequenceA.
Methods
hsequence' :: (SListIN h xs, Applicative f) => h (f :.: g) xs -> f (h g xs) #
Corresponds to sequenceA.
Lifts an applicative functor out of a structure.
Instances:
hsequence',sequence'_NP:: (SListIxs ,Applicativef) =>NP(f:.:g) xs -> f (NPg xs )hsequence',sequence'_NS:: (SListIxs ,Applicativef) =>NS(f:.:g) xs -> f (NSg xs )hsequence',sequence'_POP:: (SListI2xss,Applicativef) =>POP(f:.:g) xss -> f (POPg xss)hsequence',sequence'_SOP:: (SListI2xss,Applicativef) =>SOP(f:.:g) xss -> f (SOPg xss)
hctraverse' :: (AllN h c xs, Applicative g) => proxy c -> (forall (a :: k). c a => f a -> g (f' a)) -> h f xs -> g (h f' xs) #
Corresponds to traverse.
Instances:
hctraverse',ctraverse'_NP:: (Allc xs ,Applicativeg) => proxy c -> (forall a. c a => f a -> g (f' a)) ->NPf xs -> g (NPf' xs )hctraverse',ctraverse'_NS:: (All2c xs ,Applicativeg) => proxy c -> (forall a. c a => f a -> g (f' a)) ->NSf xs -> g (NSf' xs )hctraverse',ctraverse'_POP:: (Allc xss,Applicativeg) => proxy c -> (forall a. c a => f a -> g (f' a)) ->POPf xss -> g (POPf' xss)hctraverse',ctraverse'_SOP:: (All2c xss,Applicativeg) => proxy c -> (forall a. c a => f a -> g (f' a)) ->SOPf xss -> g (SOPf' xss)
Since: sop-core-0.3.2.0
htraverse' :: (SListIN h xs, Applicative g) => (forall (a :: k). f a -> g (f' a)) -> h f xs -> g (h f' xs) #
Unconstrained variant of htraverse'.
Instances:
htraverse',traverse'_NP:: (SListIxs ,Applicativeg) => (forall a. c a => f a -> g (f' a)) ->NPf xs -> g (NPf' xs )htraverse',traverse'_NS:: (SListI2xs ,Applicativeg) => (forall a. c a => f a -> g (f' a)) ->NSf xs -> g (NSf' xs )htraverse',traverse'_POP:: (SListIxss,Applicativeg) => (forall a. c a => f a -> g (f' a)) ->POPf xss -> g (POPf' xss)htraverse',traverse'_SOP:: (SListI2xss,Applicativeg) => (forall a. c a => f a -> g (f' a)) ->SOPf xss -> g (SOPf' xss)
Since: sop-core-0.3.2.0
Instances
| HSequence (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS Methods hsequence' :: (SListIN SOP xs, Applicative f) => SOP (f :.: g) xs -> f (SOP g xs) # hctraverse' :: (AllN SOP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g (f' a)) -> SOP f xs -> g (SOP f' xs) # htraverse' :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> SOP f xs -> g (SOP f' xs) # | |
| HSequence (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS Methods hsequence' :: (SListIN NS xs, Applicative f) => NS (f :.: g) xs -> f (NS g xs) # hctraverse' :: (AllN NS c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g (f' a)) -> NS f xs -> g (NS f' xs) # htraverse' :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> NS f xs -> g (NS f' xs) # | |
| HSequence (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP Methods hsequence' :: (SListIN POP xs, Applicative f) => POP (f :.: g) xs -> f (POP g xs) # hctraverse' :: (AllN POP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g (f' a)) -> POP f xs -> g (POP f' xs) # htraverse' :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> POP f xs -> g (POP f' xs) # | |
| HSequence (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP Methods hsequence' :: (SListIN NP xs, Applicative f) => NP (f :.: g) xs -> f (NP g xs) # hctraverse' :: (AllN NP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g (f' a)) -> NP f xs -> g (NP f' xs) # htraverse' :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> NP f xs -> g (NP f' xs) # | |
hsequence :: (SListIN h xs, SListIN (Prod h) xs, HSequence h, Applicative f) => h f xs -> f (h I xs) #
Special case of hsequence' where g = .I
hsequenceK :: (SListIN h xs, SListIN (Prod h) xs, Applicative f, HSequence h) => h (K (f a) :: k -> Type) xs -> f (h (K a :: k -> Type) xs) #
Special case of hsequence' where g = .K a
hctraverse :: (HSequence h, AllN h c xs, Applicative g) => proxy c -> (forall a. c a => f a -> g a) -> h f xs -> g (h I xs) #
Special case of hctraverse' where f' = .I
Since: sop-core-0.3.2.0
hcfor :: (HSequence h, AllN h c xs, Applicative g) => proxy c -> h f xs -> (forall a. c a => f a -> g a) -> g (h I xs) #
Flipped version of hctraverse.
Since: sop-core-0.3.2.0
Expanding sums to products
class HExpand (h :: (k -> Type) -> l -> Type) where #
A class for expanding sum structures into corresponding product structures, filling in the slots not targeted by the sum with default values.
Since: sop-core-0.2.5.0
Methods
hexpand :: SListIN (Prod h) xs => (forall (x :: k). f x) -> h f xs -> Prod h f xs #
Expand a given sum structure into a corresponding product structure by placing the value contained in the sum into the corresponding position in the product, and using the given default value for all other positions.
Instances:
hexpand,expand_NS::SListIxs => (forall x . f x) ->NSf xs ->NPf xshexpand,expand_SOP::SListI2xss => (forall x . f x) ->SOPf xss ->POPf xss
Examples:
>>>hexpand Nothing (S (Z (Just 3))) :: NP Maybe '[Char, Int, Bool]Nothing :* Just 3 :* Nothing :* Nil>>>hexpand [] (SOP (S (Z ([1,2] :* "xyz" :* Nil)))) :: POP [] '[ '[Bool], '[Int, Char] ]POP (([] :* Nil) :* ([1,2] :* "xyz" :* Nil) :* Nil)
Since: sop-core-0.2.5.0
hcexpand :: AllN (Prod h) c xs => proxy c -> (forall (x :: k). c x => f x) -> h f xs -> Prod h f xs #
Variant of hexpand that allows passing a constrained default.
Instances:
hcexpand,cexpand_NS::Allc xs => proxy c -> (forall x . c x => f x) ->NSf xs ->NPf xshcexpand,cexpand_SOP::All2c xss => proxy c -> (forall x . c x => f x) ->SOPf xss ->POPf xss
Examples:
>>>hcexpand (Proxy :: Proxy Bounded) (I minBound) (S (Z (I 20))) :: NP I '[Bool, Int, Ordering]I False :* I 20 :* I LT :* Nil>>>hcexpand (Proxy :: Proxy Num) (I 0) (SOP (S (Z (I 1 :* I 2 :* Nil)))) :: POP I '[ '[Double], '[Int, Int] ]POP ((I 0.0 :* Nil) :* (I 1 :* I 2 :* Nil) :* Nil)
Since: sop-core-0.2.5.0
Transformation of index lists and coercions
class ((Same h1 :: (k2 -> Type) -> l2 -> Type) ~ h2, (Same h2 :: (k1 -> Type) -> l1 -> Type) ~ h1) => HTrans (h1 :: (k1 -> Type) -> l1 -> Type) (h2 :: (k2 -> Type) -> l2 -> Type) where #
A class for transforming structures into related structures with a different index list, as long as the index lists have the same shape and the elements and interpretation functions are suitably related.
Since: sop-core-0.3.1.0
Methods
htrans :: AllZipN (Prod h1) c xs ys => proxy c -> (forall (x :: k1) (y :: k2). c x y => f x -> g y) -> h1 f xs -> h2 g ys #
Transform a structure into a related structure given a conversion function for the elements.
Since: sop-core-0.3.1.0
hcoerce :: (AllZipN (Prod h1) (LiftedCoercible f g) xs ys, HTrans h1 h2) => h1 f xs -> h2 g ys #
Safely coerce a structure into a representationally equal structure.
This is a special case of htrans, but can be implemented more efficiently;
for example in terms of unsafeCoerce.
Examples:
>>>hcoerce (I (Just LT) :* I (Just 'x') :* I (Just True) :* Nil) :: NP Maybe '[Ordering, Char, Bool]Just LT :* Just 'x' :* Just True :* Nil>>>hcoerce (SOP (Z (K True :* K False :* Nil))) :: SOP I '[ '[Bool, Bool], '[Bool] ]SOP (Z (I True :* I False :* Nil))
Since: sop-core-0.3.1.0
Instances
| HTrans (SOP :: (k1 -> Type) -> [[k1]] -> Type) (SOP :: (k2 -> Type) -> [[k2]] -> Type) | |
| HTrans (NS :: (k1 -> Type) -> [k1] -> Type) (NS :: (k2 -> Type) -> [k2] -> Type) | |
| HTrans (POP :: (k1 -> Type) -> [[k1]] -> Type) (POP :: (k2 -> Type) -> [[k2]] -> Type) | |
| HTrans (NP :: (k1 -> Type) -> [k1] -> Type) (NP :: (k2 -> Type) -> [k2] -> Type) | |
hfromI :: (AllZipN (Prod h1) (LiftedCoercible I f) xs ys, HTrans h1 h2) => h1 I xs -> h2 f ys #
Specialization of hcoerce.
Since: sop-core-0.3.1.0
htoI :: (AllZipN (Prod h1) (LiftedCoercible f I) xs ys, HTrans h1 h2) => h1 f xs -> h2 I ys #
Specialization of hcoerce.
Since: sop-core-0.3.1.0
Partial operations
fromList :: SListI xs => [a] -> Maybe (NP (K a :: k -> Type) xs) #
Construct a homogeneous n-ary product from a normal Haskell list.
Returns Nothing if the length of the list does not exactly match the
expected size of the product.
Utilities
Basic functors
newtype K a (b :: k) :: forall k. Type -> k -> Type #
The constant type functor.
Like Constant, but kind-polymorphic
in its second argument and with a shorter name.
Constructors
| K a |
Instances
| Eq2 (K :: Type -> Type -> Type) | Since: sop-core-0.2.4.0 |
| Ord2 (K :: Type -> Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
| Read2 (K :: Type -> Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftReadsPrec2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> Int -> ReadS (K a b) # liftReadList2 :: (Int -> ReadS a) -> ReadS [a] -> (Int -> ReadS b) -> ReadS [b] -> ReadS [K a b] # liftReadPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec (K a b) # liftReadListPrec2 :: ReadPrec a -> ReadPrec [a] -> ReadPrec b -> ReadPrec [b] -> ReadPrec [K a b] # | |
| Show2 (K :: Type -> Type -> Type) | Since: sop-core-0.2.4.0 |
| NFData2 (K :: Type -> Type -> Type) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
| Functor (K a :: Type -> Type) | |
| Monoid a => Applicative (K a :: Type -> Type) | |
| Foldable (K a :: Type -> Type) | |
Defined in Data.SOP.BasicFunctors Methods fold :: Monoid m => K a m -> m # foldMap :: Monoid m => (a0 -> m) -> K a a0 -> m # foldr :: (a0 -> b -> b) -> b -> K a a0 -> b # foldr' :: (a0 -> b -> b) -> b -> K a a0 -> b # foldl :: (b -> a0 -> b) -> b -> K a a0 -> b # foldl' :: (b -> a0 -> b) -> b -> K a a0 -> b # foldr1 :: (a0 -> a0 -> a0) -> K a a0 -> a0 # foldl1 :: (a0 -> a0 -> a0) -> K a a0 -> a0 # elem :: Eq a0 => a0 -> K a a0 -> Bool # maximum :: Ord a0 => K a a0 -> a0 # minimum :: Ord a0 => K a a0 -> a0 # | |
| Traversable (K a :: Type -> Type) | |
| Eq a => Eq1 (K a :: Type -> Type) | Since: sop-core-0.2.4.0 |
| Ord a => Ord1 (K a :: Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
| Read a => Read1 (K a :: Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
| Show a => Show1 (K a :: Type -> Type) | Since: sop-core-0.2.4.0 |
| NFData a => NFData1 (K a :: Type -> Type) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
| Eq a => Eq (K a b) | |
| Ord a => Ord (K a b) | |
| Read a => Read (K a b) | |
| Show a => Show (K a b) | |
| Generic (K a b) | |
| Semigroup a => Semigroup (K a b) | Since: sop-core-0.4.0.0 |
| Monoid a => Monoid (K a b) | Since: sop-core-0.4.0.0 |
| NFData a => NFData (K a b) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
| HasDatatypeInfo (K a b) # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (K a b) :: DatatypeInfo # Methods datatypeInfo :: proxy (K a b) -> DatatypeInfo (Code (K a b)) # | |
| Generic (K a b) # | |
| type Rep (K a b) | |
Defined in Data.SOP.BasicFunctors | |
| type DatatypeInfoOf (K a b) # | |
Defined in Generics.SOP.Instances | |
| type Code (K a b) # | |
Defined in Generics.SOP.Instances | |
The identity type functor.
Like Identity, but with a shorter name.
Constructors
| I a |
Instances
| Monad I | |
| Functor I | |
| Applicative I | |
| Foldable I | |
Defined in Data.SOP.BasicFunctors Methods fold :: Monoid m => I m -> m # foldMap :: Monoid m => (a -> m) -> I a -> m # foldr :: (a -> b -> b) -> b -> I a -> b # foldr' :: (a -> b -> b) -> b -> I a -> b # foldl :: (b -> a -> b) -> b -> I a -> b # foldl' :: (b -> a -> b) -> b -> I a -> b # foldr1 :: (a -> a -> a) -> I a -> a # foldl1 :: (a -> a -> a) -> I a -> a # elem :: Eq a => a -> I a -> Bool # maximum :: Ord a => I a -> a # | |
| Traversable I | |
| Eq1 I | Since: sop-core-0.2.4.0 |
| Ord1 I | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
| Read1 I | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
| Show1 I | Since: sop-core-0.2.4.0 |
| NFData1 I | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
| Eq a => Eq (I a) | |
| Ord a => Ord (I a) | |
| Read a => Read (I a) | |
| Show a => Show (I a) | |
| Generic (I a) | |
| Semigroup a => Semigroup (I a) | Since: sop-core-0.4.0.0 |
| Monoid a => Monoid (I a) | Since: sop-core-0.4.0.0 |
| NFData a => NFData (I a) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
| HasDatatypeInfo (I a) # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (I a) :: DatatypeInfo # Methods datatypeInfo :: proxy (I a) -> DatatypeInfo (Code (I a)) # | |
| Generic (I a) # | |
| type Rep (I a) | |
Defined in Data.SOP.BasicFunctors | |
| type DatatypeInfoOf (I a) # | |
Defined in Generics.SOP.Instances | |
| type Code (I a) # | |
Defined in Generics.SOP.Instances | |
newtype ((f :: l -> Type) :.: (g :: k -> l)) (p :: k) :: forall l k. (l -> Type) -> (k -> l) -> k -> Type infixr 7 #
Composition of functors.
Like Compose, but kind-polymorphic
and with a shorter name.
Constructors
| Comp (f (g p)) |
Instances
| (Functor f, Functor g) => Functor (f :.: g) | |
| (Applicative f, Applicative g) => Applicative (f :.: g) | Since: sop-core-0.2.5.0 |
| (Foldable f, Foldable g) => Foldable (f :.: g) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors Methods fold :: Monoid m => (f :.: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a # toList :: (f :.: g) a -> [a] # length :: (f :.: g) a -> Int # elem :: Eq a => a -> (f :.: g) a -> Bool # maximum :: Ord a => (f :.: g) a -> a # minimum :: Ord a => (f :.: g) a -> a # | |
| (Traversable f, Traversable g) => Traversable (f :.: g) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
| (Eq1 f, Eq1 g) => Eq1 (f :.: g) | Since: sop-core-0.2.4.0 |
| (Ord1 f, Ord1 g) => Ord1 (f :.: g) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
| (Read1 f, Read1 g) => Read1 (f :.: g) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
| (Show1 f, Show1 g) => Show1 (f :.: g) | Since: sop-core-0.2.4.0 |
| (NFData1 f, NFData1 g) => NFData1 (f :.: g) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
| (Eq1 f, Eq1 g, Eq a) => Eq ((f :.: g) a) | |
| (Ord1 f, Ord1 g, Ord a) => Ord ((f :.: g) a) | |
Defined in Data.SOP.BasicFunctors | |
| (Read1 f, Read1 g, Read a) => Read ((f :.: g) a) | |
| (Show1 f, Show1 g, Show a) => Show ((f :.: g) a) | |
| Generic ((f :.: g) p) | |
| Semigroup (f (g x)) => Semigroup ((f :.: g) x) | Since: sop-core-0.4.0.0 |
| Monoid (f (g x)) => Monoid ((f :.: g) x) | Since: sop-core-0.4.0.0 |
| NFData (f (g a)) => NFData ((f :.: g) a) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
| HasDatatypeInfo ((f :.: g) p) # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f :.: g) p) :: DatatypeInfo # Methods datatypeInfo :: proxy ((f :.: g) p) -> DatatypeInfo (Code ((f :.: g) p)) # | |
| Generic ((f :.: g) p) # | |
| type Rep ((f :.: g) p) | |
Defined in Data.SOP.BasicFunctors | |
| type DatatypeInfoOf ((f :.: g) p) # | |
Defined in Generics.SOP.Instances | |
| type Code ((f :.: g) p) # | |
Defined in Generics.SOP.Instances | |
Mapping functions
Mapping constraints
class (AllF c xs, SListI xs) => All (c :: k -> Constraint) (xs :: [k]) #
Require a constraint for every element of a list.
If you have a datatype that is indexed over a type-level
list, then you can use All to indicate that all elements
of that type-level list must satisfy a given constraint.
Example: The constraint
All Eq '[ Int, Bool, Char ]
is equivalent to the constraint
(Eq Int, Eq Bool, Eq Char)
Example: A type signature such as
f :: All Eq xs => NP I xs -> ...
means that f can assume that all elements of the n-ary
product satisfy Eq.
Note on superclasses: ghc cannot deduce superclasses from All
constraints.
You might expect the following to compile
class (Eq a) => MyClass a foo :: (All Eq xs) => NP f xs -> z foo = [..] bar :: (All MyClass xs) => NP f xs -> x bar = foo
but it will fail with an error saying that it was unable to
deduce the class constraint AllF Eq xsbar.
In cases like this you can use Dict from Data.SOP.Dict
to prove conversions between constraints.
See this answer on SO for more details.
Minimal complete definition
Instances
| All (c :: k -> Constraint) ([] :: [k]) | |
Defined in Data.SOP.Constraint Methods cpara_SList :: proxy c -> r [] -> (forall (y :: k0) (ys :: [k0]). (c y, All c ys) => r ys -> r (y ': ys)) -> r [] # | |
| (c x, All c xs) => All (c :: a -> Constraint) (x ': xs :: [a]) | |
Defined in Data.SOP.Constraint Methods cpara_SList :: proxy c -> r [] -> (forall (y :: k) (ys :: [k]). (c y, All c ys) => r ys -> r (y ': ys)) -> r (x ': xs) # | |
type All2 (c :: k -> Constraint) = All (All c) #
Require a constraint for every element of a list of lists.
If you have a datatype that is indexed over a type-level
list of lists, then you can use All2 to indicate that all
elements of the inner lists must satisfy a given constraint.
Example: The constraint
All2 Eq '[ '[ Int ], '[ Bool, Char ] ]
is equivalent to the constraint
(Eq Int, Eq Bool, Eq Char)
Example: A type signature such as
f :: All2 Eq xss => SOP I xs -> ...
means that f can assume that all elements of the sum
of product satisfy Eq.
Since 0.4.0.0, this is merely a synonym for 'All (All c)'.
Since: sop-core-0.4.0.0
cpara_SList :: All c xs => proxy c -> r ([] :: [k]) -> (forall (y :: k) (ys :: [k]). (c y, All c ys) => r ys -> r (y ': ys)) -> r xs #
Constrained paramorphism for a type-level list.
The advantage of writing functions in terms of cpara_SList is that
they are then typically not recursive, and can be unfolded statically if
the type-level list is statically known.
Since: sop-core-0.4.0.0
ccase_SList :: All c xs => proxy c -> r ([] :: [k]) -> (forall (y :: k) (ys :: [k]). (c y, All c ys) => r (y ': ys)) -> r xs #
Constrained case distinction on a type-level list.
Since: sop-core-0.4.0.0
class (SListI xs, SListI ys, SameShapeAs xs ys, SameShapeAs ys xs, AllZipF c xs ys) => AllZip (c :: a -> b -> Constraint) (xs :: [a]) (ys :: [b]) #
Require a constraint for pointwise for every pair of elements from two lists.
Example: The constraint
All (~) '[ Int, Bool, Char ] '[ a, b, c ]
is equivalent to the constraint
(Int ~ a, Bool ~ b, Char ~ c)
Since: sop-core-0.3.1.0
Instances
| (SListI xs, SListI ys, SameShapeAs xs ys, SameShapeAs ys xs, AllZipF c xs ys) => AllZip (c :: a -> b -> Constraint) (xs :: [a]) (ys :: [b]) | |
Defined in Data.SOP.Constraint | |
class (AllZipF (AllZip f) xss yss, SListI xss, SListI yss, SameShapeAs xss yss, SameShapeAs yss xss) => AllZip2 (f :: a -> b -> Constraint) (xss :: [[a]]) (yss :: [[b]]) #
Require a constraint for pointwise for every pair of elements from two lists of lists.
Instances
| (AllZipF (AllZip f) xss yss, SListI xss, SListI yss, SameShapeAs xss yss, SameShapeAs yss xss) => AllZip2 (f :: a -> b -> Constraint) (xss :: [[a]]) (yss :: [[b]]) | |
Defined in Data.SOP.Constraint | |
type family AllN (h :: (k -> Type) -> l -> Type) (c :: k -> Constraint) :: l -> Constraint #
A generalization of All and All2.
The family AllN expands to All or All2 depending on whether
the argument is indexed by a list or a list of lists.
Instances
| type AllN (SOP :: (k -> Type) -> [[k]] -> Type) (c :: k -> Constraint) | |
Defined in Data.SOP.NS | |
| type AllN (POP :: (k -> Type) -> [[k]] -> Type) (c :: k -> Constraint) | |
Defined in Data.SOP.NP | |
| type AllN (NS :: (k -> Type) -> [k] -> Type) (c :: k -> Constraint) | |
Defined in Data.SOP.NS | |
| type AllN (NP :: (k -> Type) -> [k] -> Type) (c :: k -> Constraint) | |
Defined in Data.SOP.NP | |
type family AllZipN (h :: (k -> Type) -> l -> Type) (c :: k1 -> k2 -> Constraint) :: l1 -> l2 -> Constraint #
A generalization of AllZip and AllZip2.
The family AllZipN expands to AllZip or AllZip2 depending on
whther the argument is indexed by a list or a list of lists.
Instances
| type AllZipN (POP :: (k -> Type) -> [[k]] -> Type) (c :: a -> b -> Constraint) | |
Defined in Data.SOP.NP | |
| type AllZipN (NP :: (k -> Type) -> [k] -> Type) (c :: a -> b -> Constraint) | |
Defined in Data.SOP.NP | |
Other constraints
class f (g x) => Compose (f :: k -> Constraint) (g :: k1 -> k) (x :: k1) infixr 9 #
Composition of constraints.
Note that the result of the composition must be a constraint,
and therefore, in Compose f gf is k -> .
The kind of Constraintg, however, is l -> k and can thus be an normal
type constructor.
A typical use case is in connection with All on an NP or an
NS. For example, in order to denote that all elements on an
NP f xsShow, we can say All (Compose Show f) xs
Since: sop-core-0.2
Instances
| f (g x) => Compose (f :: k2 -> Constraint) (g :: k1 -> k2) (x :: k1) | |
Defined in Data.SOP.Constraint | |
class (f x, g x) => And (f :: k -> Constraint) (g :: k -> Constraint) (x :: k) infixl 7 #
Pairing of constraints.
Since: sop-core-0.2
Instances
| (f x, g x) => And (f :: k -> Constraint) (g :: k -> Constraint) (x :: k) | |
Defined in Data.SOP.Constraint | |
A constraint that can always be satisfied.
Since: sop-core-0.2
Instances
| Top (x :: k) | |
Defined in Data.SOP.Constraint | |
class Coercible (f x) (g y) => LiftedCoercible (f :: k -> k0) (g :: k1 -> k0) (x :: k) (y :: k1) #
The constraint LiftedCoercible f g x yCoercible (f x) (g y)
Since: sop-core-0.3.1.0
Instances
| Coercible (f x) (g y) => LiftedCoercible (f :: k2 -> k0) (g :: k1 -> k0) (x :: k2) (y :: k1) | |
Defined in Data.SOP.Constraint | |
type family SameShapeAs (xs :: [a]) (ys :: [b]) :: Constraint where ... #
Type family that forces a type-level list to be of the same shape as the given type-level list.
The main use of this constraint is to help type inference to learn something about otherwise unknown type-level lists.
Since: sop-core-0.3.1.0
Equations
| SameShapeAs ([] :: [a]) (ys :: [b]) = ys ~ ([] :: [b]) | |
| SameShapeAs (x ': xs :: [a]) (ys :: [b]) = (ys ~ (Head ys ': Tail ys), SameShapeAs xs (Tail ys)) |
Singletons
data SList (a :: [k]) :: forall k. [k] -> Type where #
Explicit singleton list.
A singleton list can be used to reveal the structure of
a type-level list argument that the function is quantified
over. For every type-level list xs, there is one non-bottom
value of type SList xs
Note that these singleton lists are polymorphic in the list elements; we do not require a singleton representation for them.
Since: sop-core-0.2
Constructors
| SNil :: forall k (a :: [k]). SList ([] :: [k]) | |
| SCons :: forall k (a :: [k]) (xs :: [k]) (x :: k). SListI xs => SList (x ': xs) |
type SListI = All (Top :: k -> Constraint) #
Implicit singleton list.
A singleton list can be used to reveal the structure of a type-level list argument that the function is quantified over.
Since 0.4.0.0, this is now defined in terms of All.
A singleton list provides a witness for a type-level list
where the elements need not satisfy any additional
constraints.
Since: sop-core-0.4.0.0
type SListI2 = All (SListI :: [k] -> Constraint) #
Require a singleton for every inner list in a list of lists.
sList :: SListI xs => SList xs #
Get hold of an explicit singleton (that one can then pattern match on) for a type-level list
para_SList :: SListI xs => r ([] :: [k]) -> (forall (y :: k) (ys :: [k]). SListI ys => r ys -> r (y ': ys)) -> r xs #
Paramorphism for a type-level list.
Since: sop-core-0.4.0.0
case_SList :: SListI xs => r ([] :: [k]) -> (forall (y :: k) (ys :: [k]). SListI ys => r (y ': ys)) -> r xs #
Case distinction on a type-level list.
Since: sop-core-0.4.0.0
Shape of type-level lists
data Shape (a :: [k]) :: forall k. [k] -> Type where #
Occassionally it is useful to have an explicit, term-level, representation of type-level lists (esp because of https://ghc.haskell.org/trac/ghc/ticket/9108 )
Constructors
| ShapeNil :: forall k (a :: [k]). Shape ([] :: [k]) | |
| ShapeCons :: forall k (a :: [k]) (xs :: [k]) (x :: k). SListI xs => Shape xs -> Shape (x ': xs) |
lengthSList :: SListI xs => proxy xs -> Int #
The length of a type-level list.
Since: sop-core-0.2
Re-exports
data Proxy (t :: k) :: forall k. k -> Type #
Proxy is a type that holds no data, but has a phantom parameter of
arbitrary type (or even kind). Its use is to provide type information, even
though there is no value available of that type (or it may be too costly to
create one).
Historically, Proxy :: Proxy a'undefined :: a' idiom.
>>>Proxy :: Proxy (Void, Int -> Int)Proxy
Proxy can even hold types of higher kinds,
>>>Proxy :: Proxy EitherProxy
>>>Proxy :: Proxy FunctorProxy
>>>Proxy :: Proxy complicatedStructureProxy
Constructors
| Proxy |
Instances
| Generic1 (Proxy :: k -> Type) | |
| Monad (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Functor (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Applicative (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Foldable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
Defined in Data.Foldable Methods fold :: Monoid m => Proxy m -> m # foldMap :: Monoid m => (a -> m) -> Proxy a -> m # foldr :: (a -> b -> b) -> b -> Proxy a -> b # foldr' :: (a -> b -> b) -> b -> Proxy a -> b # foldl :: (b -> a -> b) -> b -> Proxy a -> b # foldl' :: (b -> a -> b) -> b -> Proxy a -> b # foldr1 :: (a -> a -> a) -> Proxy a -> a # foldl1 :: (a -> a -> a) -> Proxy a -> a # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # | |
| Traversable (Proxy :: Type -> Type) | Since: base-4.7.0.0 |
| Alternative (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| MonadPlus (Proxy :: Type -> Type) | Since: base-4.9.0.0 |
| Bounded (Proxy t) | Since: base-4.7.0.0 |
| Enum (Proxy s) | Since: base-4.7.0.0 |
| Eq (Proxy s) | Since: base-4.7.0.0 |
| Data t => Data (Proxy t) | Since: base-4.7.0.0 |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # | |
| Ord (Proxy s) | Since: base-4.7.0.0 |
| Read (Proxy t) | Since: base-4.7.0.0 |
| Show (Proxy s) | Since: base-4.7.0.0 |
| Ix (Proxy s) | Since: base-4.7.0.0 |
Defined in Data.Proxy | |
| Generic (Proxy t) | |
| Semigroup (Proxy s) | Since: base-4.9.0.0 |
| Monoid (Proxy s) | Since: base-4.7.0.0 |
| HasDatatypeInfo (Proxy t) # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Proxy t) :: DatatypeInfo # Methods datatypeInfo :: proxy (Proxy t) -> DatatypeInfo (Code (Proxy t)) # | |
| Generic (Proxy t) # | |
| type Rep1 (Proxy :: k -> Type) | Since: base-4.6.0.0 |
| type Rep (Proxy t) | Since: base-4.6.0.0 |
| type DatatypeInfoOf (Proxy t) # | |
Defined in Generics.SOP.Instances type DatatypeInfoOf (Proxy t) = ADT "Data.Proxy" "Proxy" (Constructor "Proxy" ': ([] :: [ConstructorInfo])) | |
| type Code (Proxy t) # | |
Defined in Generics.SOP.Instances | |