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 name
. The class also provides functionsRep
Afrom
andto
that convert betweenA
and
and witness the isomorphism.Rep
A - Since all
Rep
types are sums of products, you can define functions over them by performing induction on the structure, or by using predefined combinators that the library provides. Such functions then work for allRep
types. - By combining the conversion functions
from
andto
with the function that works onRep
types, we obtain a function that works on all types that are in theGeneric
class. - 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 theGeneric
class from module GHC.Generics, then an instance of the SOPGeneric
can automatically be derived. There is also Template Haskell code in Generics.SOP.TH that allows to auto-generate an instance ofGeneric
for 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) -- empty
Now we can convert between A
and
(and between Rep
AB
and
).
For example,Rep
B
>>>
from (D (C True) 3) :: Rep A
SOP (S (Z (I (C True) :* I 3 :* Nil)))>>>
to it :: A
D (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
, have a look at the
Generics.SOP.Universe module.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 :: (Generic
a,All2
NFData (Code
a)) => a -> () grnf x = grnfS (from
x) grnfS :: (All2
NFData xss) =>SOP
I
xss -> () grnfS (SOP
(Z
xs)) = grnfP xs grnfS (SOP
(S
xss)) = grnfS (SOP
xss) grnfP :: (All
NFData xs) =>NP
I
xs -> () grnfPNil
= () grnfP (I
x:*
xs) = x `deepseq` (grnfP xs)
The grnf
function performs the conversion between a
and
by applying 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
). It
encodes which constructor was used to construct the original
argument of type 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 :: (Generic
a,All2
NFData (Code
a)) => a -> () grnf =rnf
.hcollapse
.hcmap
(Proxy
::Proxy
NFData) (mapIK
rnf) .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 x
SOP (S (Z (I 2.5 :* I 'A' :* I False :* Nil)))>>>
hcmap (Proxy :: Proxy NFData) (mapIK rnf) it
SOP (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 (
). A
homogeneous structure can be collapsed (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-sop
basic examples,pretty-sop
generic pretty printing,lens-sop
generically computed lenses,json-sop
generic 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 ProductCode (a :: Type) = Head (Code a)
- productTypeFrom :: IsProductType a xs => a -> NP I xs
- productTypeTo :: IsProductType a xs => NP I xs -> a
- type IsEnumType (a :: Type) = (Generic a, All ((~) '[]) (Code a))
- enumTypeFrom :: IsEnumType a => a -> NS (K ()) (Code a)
- enumTypeTo :: IsEnumType a => NS (K ()) (Code a) -> a
- type IsWrappedType (a :: Type) (x :: Type) = (Generic a, Code a ~ '['[x]])
- type WrappedCode (a :: Type) = Head (Head (Code a))
- wrappedTypeFrom :: IsWrappedType a x => a -> x
- wrappedTypeTo :: IsWrappedType a x => x -> a
- type IsNewtype (a :: Type) (x :: Type) = (IsWrappedType a x, Coercible a x)
- newtypeFrom :: IsNewtype a x => a -> x
- newtypeTo :: IsNewtype a x => x -> a
- 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 -> POP StrictnessInfo 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
- hindex :: h f xs -> Int
- type Ejection (f :: k -> Type) (xs :: [k]) = (K (NS f xs) :: k -> Type) -.-> (Maybe :.: f)
- ejections :: SListI xs => NP (Ejection f xs) xs
- shiftEjection :: Ejection f xs a2 -> Ejection f (x ': xs) a2
- 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 Source #
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 a 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
::Rep
a ->Rep
a
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
, ...) instanceGeneric
T -- empty instanceHasDatatypeInfo
T -- 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 -- derivesHasDatatypeInfo
as 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
type Code a :: [[Type]] Source #
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 Source #
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 Source #
Converts from a structural representation back to the original value.
Instances
Generic Bool Source # | |
Generic Ordering Source # | |
Generic RuntimeRep Source # | |
Generic VecCount Source # | |
Generic VecElem Source # | |
Generic R Source # | |
Generic D Source # | |
Generic C Source # | |
Generic S Source # | |
Generic CallStack Source # | |
Generic () Source # | |
Generic Any Source # | |
Generic FFFormat Source # | |
Generic Associativity Source # | |
Defined in Generics.SOP.Instances Associated Types type Code Associativity :: [[Type]] Source # Methods from :: Associativity -> Rep Associativity Source # to :: Rep Associativity -> Associativity Source # | |
Generic DecidedStrictness Source # | |
Defined in Generics.SOP.Instances Associated Types type Code DecidedStrictness :: [[Type]] Source # Methods | |
Generic Fixity Source # | |
Generic SourceStrictness Source # | |
Defined in Generics.SOP.Instances Associated Types type Code SourceStrictness :: [[Type]] Source # Methods from :: SourceStrictness -> Rep SourceStrictness Source # to :: Rep SourceStrictness -> SourceStrictness Source # | |
Generic SourceUnpackedness Source # | |
Defined in Generics.SOP.Instances Associated Types type Code SourceUnpackedness :: [[Type]] Source # Methods from :: SourceUnpackedness -> Rep SourceUnpackedness Source # | |
Generic Lexeme Source # | |
Generic SrcLoc Source # | |
Generic DataRep Source # | |
Generic ConstrRep Source # | |
Generic SpecConstrAnnotation Source # | |
Generic Version Source # | |
Generic All Source # | |
Generic NestedAtomically Source # | |
Generic NoMethodError Source # | |
Generic NonTermination Source # | |
Generic PatternMatchFail Source # | |
Generic RecConError Source # | |
Generic RecSelError Source # | |
Generic RecUpdError Source # | |
Generic TypeError Source # | |
Generic ErrorCall Source # | |
Generic ArithException Source # | |
Generic MaskingState Source # | |
Generic AllocationLimitExceeded Source # | |
Generic ArrayException Source # | |
Generic AssertionFailed Source # | |
Generic AsyncException Source # | |
Generic BlockedIndefinitelyOnMVar Source # | |
Generic BlockedIndefinitelyOnSTM Source # | |
Generic Deadlock Source # | |
Generic IOException Source # | |
Generic GeneralCategory Source # | |
Generic Fixity Source # | |
Generic E0 Source # | |
Generic E1 Source # | |
Generic E12 Source # | |
Generic E2 Source # | |
Generic E3 Source # | |
Generic E6 Source # | |
Generic E9 Source # | |
Generic Void Source # | |
Generic Errno Source # | |
Generic CInt Source # | |
Generic CChar Source # | |
Generic CClock Source # | |
Generic CDouble Source # | |
Generic CFloat Source # | |
Generic CIntMax Source # | |
Generic CIntPtr Source # | |
Generic CLLong Source # | |
Generic CLong Source # | |
Generic CPtrdiff Source # | |
Generic CSChar Source # | |
Generic CSUSeconds Source # | |
Generic CShort Source # | |
Generic CSigAtomic Source # | |
Generic CSize Source # | |
Generic CTime Source # | |
Generic CUChar Source # | |
Generic CUInt Source # | |
Generic CUIntMax Source # | |
Generic CUIntPtr Source # | |
Generic CULLong Source # | |
Generic CULong Source # | |
Generic CUSeconds Source # | |
Generic CUShort Source # | |
Generic CWchar Source # | |
Generic ByteOrder Source # | |
Generic BlockReason Source # | |
Generic ThreadStatus Source # | |
Generic Location Source # | |
Generic SrcLoc Source # | |
Generic Fingerprint Source # | |
Generic BufferState Source # | |
Generic IODeviceType Source # | |
Generic SeekMode Source # | |
Generic CodingProgress Source # | |
Generic CodingFailureMode Source # | |
Generic ExitCode Source # | |
Generic FixIOException Source # | |
Generic IOErrorType Source # | |
Generic HandlePosn Source # | |
Generic LockMode Source # | |
Generic BufferMode Source # | |
Generic Newline Source # | |
Generic NewlineMode Source # | |
Generic CCFlags Source # | |
Generic ConcFlags Source # | |
Generic DebugFlags Source # | |
Generic DoCostCentres Source # | |
Generic DoHeapProfile Source # | |
Generic DoTrace Source # | |
Generic GCFlags Source # | |
Generic GiveGCStats Source # | |
Generic MiscFlags Source # | |
Generic ParFlags Source # | |
Generic ProfFlags Source # | |
Generic RTSFlags Source # | |
Generic TickyFlags Source # | |
Generic TraceFlags Source # | |
Generic StaticPtrInfo Source # | |
Generic GCDetails Source # | |
Generic RTSStats Source # | |
Generic IOMode Source # | |
Generic FieldFormat Source # | |
Generic FormatAdjustment Source # | |
Generic FormatParse Source # | |
Generic FormatSign Source # | |
Generic Number Source # | |
Generic [a] Source # | |
Generic (Maybe a) Source # | |
Generic (Par1 p) Source # | |
Generic (I a) Source # | |
Generic (Dual a) Source # | |
Generic (Endo a) Source # | |
Generic (Product a) Source # | |
Generic (Sum a) Source # | |
Generic (NonEmpty a) Source # | |
Generic (Down a) Source # | |
Generic (Identity a) Source # | |
Generic (First a) Source # | |
Generic (Last a) Source # | |
Generic (Complex a) Source # | |
Generic (Fixed a) Source # | |
Generic (First a) Source # | |
Generic (Last a) Source # | |
Generic (Max a) Source # | |
Generic (Min a) Source # | |
Generic (Option a) Source # | |
Generic (WrappedMonoid m) Source # | |
Generic (Buffer e) Source # | |
Generic (ArgDescr a) Source # | |
Generic (ArgOrder a) Source # | |
Generic (OptDescr a) Source # | |
Generic (Either a b) Source # | |
Generic (V1 p) Source # | |
Generic (U1 p) Source # | |
Generic (a, b) Source # | |
Generic (Proxy t) Source # | |
Generic (Arg a b) Source # | |
Generic (a, b, c) Source # | |
Generic (K a b) Source # | |
Generic (Const a b) Source # | |
Generic (Alt f a) Source # | |
Generic (BufferCodec from to state) Source # | |
Generic (K1 i c p) Source # | |
Generic ((f :+: g) p) Source # | |
Generic ((f :*: g) p) Source # | |
Generic (a, b, c, d) Source # | |
Generic ((f -.-> g) a) Source # | |
Generic (Product f g a) Source # | |
Generic (Sum f g a) Source # | |
Generic (M1 i c f p) Source # | |
Generic ((f :.: g) p) Source # | |
Generic (a, b, c, d, e) Source # | |
Generic ((f :.: g) p) Source # | |
Generic (Compose f g a) Source # | |
Generic (a, b, c, d, e, f) Source # | |
Generic (a, b, c, d, e, f, g) Source # | |
Generic (a, b, c, d, e, f, g, h) Source # | |
Generic (a, b, c, d, e, f, g, h, i) Source # | |
Generic (a, b, c, d, e, f, g, h, i, j) Source # | |
Generic (a, b, c, d, e, f, g, h, i, j, k) Source # | |
Defined in Generics.SOP.Instances | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l) Source # | |
Defined in Generics.SOP.Instances | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m) Source # | |
Defined in Generics.SOP.Instances | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source # | |
Defined in Generics.SOP.Instances | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source # | |
Defined in Generics.SOP.Instances | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) Source # | |
Defined in Generics.SOP.Instances | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) Source # | |
Defined in Generics.SOP.Instances | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) Source # | |
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) Source # | |
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) Source # | |
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) Source # | |
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) :: [[Type]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) Source # | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) Source # | |
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]] Source # 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) Source # 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) Source # | |
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) Source # | |
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]] Source # 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) Source # 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) Source # | |
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) Source # | |
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]] Source # 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) Source # 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) Source # | |
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) Source # | |
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]] Source # 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) Source # 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) Source # | |
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) Source # | |
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]] Source # 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) Source # 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) Source # | |
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) Source # | |
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]] Source # 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) Source # 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) Source # | |
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) Source # | |
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]] Source # 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) Source # 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) Source # | |
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) Source # | |
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]] Source # 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) Source # 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) Source # | |
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) Source # | |
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]] Source # 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) Source # 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) Source # |
type IsProductType (a :: Type) (xs :: [Type]) = (Generic a, Code a ~ '[xs]) Source #
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 ProductCode (a :: Type) = Head (Code a) Source #
Direct access to the part of the code that is relevant for a product type.
Since: 0.4.0.0
productTypeFrom :: IsProductType a xs => a -> NP I xs Source #
Convert from a product type to its product representation.
Since: 0.4.0.0
productTypeTo :: IsProductType a xs => NP I xs -> a Source #
Convert a product representation to the original type.
Since: 0.4.0.0
type IsEnumType (a :: Type) = (Generic a, All ((~) '[]) (Code a)) Source #
Constraint that captures that a datatype is an enumeration type, i.e., none of the constructors have any arguments.
Since: 0.3.1.0
enumTypeFrom :: IsEnumType a => a -> NS (K ()) (Code a) Source #
Convert from an enum type to its sum representation.
Since: 0.4.0.0
enumTypeTo :: IsEnumType a => NS (K ()) (Code a) -> a Source #
Convert a sum representation to ihe original type.
type IsWrappedType (a :: Type) (x :: Type) = (Generic a, Code a ~ '['[x]]) Source #
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 WrappedCode (a :: Type) = Head (Head (Code a)) Source #
Direct access to the part of the code that is relevant for wrapped types and newtypes.
Since: 0.4.0.0
wrappedTypeFrom :: IsWrappedType a x => a -> x Source #
Convert from a wrapped type to its inner type.
Since: 0.4.0.0
wrappedTypeTo :: IsWrappedType a x => x -> a Source #
Convert a type to a wrapped type.
Since: 0.4.0.0
type IsNewtype (a :: Type) (x :: Type) = (IsWrappedType a x, Coercible a x) Source #
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
newtypeFrom :: IsNewtype a x => a -> x Source #
Convert a newtype to its inner type.
This is a specialised synonym for coerce
.
Since: 0.4.0.0
newtypeTo :: IsNewtype a x => x -> a Source #
Convert a type to a newtype.
This is a specialised synonym for coerce
.
Since: 0.4.0.0
n-ary datatypes
data NP (a :: k -> Type) (b :: [k]) :: forall k. (k -> Type) -> [k] -> Type where Source #
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
, the product becomes a
homogeneous list, where the contents of the type-level list are
ignored, but its length still specifies the number of elements.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 | |
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) Source # 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) Source # htraverse' :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> NP f xs -> g (NP f' xs) Source # | |
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) | |
Defined in Data.SOP.NP | |
type Prod (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP | |
type UnProd (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
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 Source #
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
, the result is a homogeneous choice type,
where the contents of the type-level list are ignored, but its
length specifies the number of options.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 | |
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) Source # 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) Source # htraverse' :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> NS f xs -> g (NS f' xs) Source # | |
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) | |
Defined in Data.SOP.NS | |
type Prod (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
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 Source #
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.
A
reflects the structure of a normal Haskell datatype.
The sum structure represents the choice between the different
constructors, the product structure represents the arguments of
each constructor.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 | |
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) Source # 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) Source # htraverse' :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> SOP f xs -> g (SOP f' xs) Source # | |
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) | |
Defined in Data.SOP.NS | |
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) | |
Defined in Data.SOP.NS | |
type Prod (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS | |
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 Source #
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 | |
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) Source # 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) Source # htraverse' :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> POP f xs -> g (POP f' xs) Source # | |
Eq (NP (NP f) xss) => Eq (POP f xss) | |
Ord (NP (NP f) xss) => Ord (POP f xss) | |
Defined in Data.SOP.NP | |
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) | |
Defined in Data.SOP.NP | |
type Prod (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP | |
type UnProd (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS | |
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 Source #
Metadata for a datatype.
A value of type
contains the information about a datatype
that is not contained in DatatypeInfo
c
. This information consists
primarily of the names of the datatype, its constructors, and possibly its
record selectors.Code
c
The constructor indicates whether the datatype has been declared using newtype
or not.
Constructors
ADT :: ModuleName -> DatatypeName -> NP ConstructorInfo xss -> POP StrictnessInfo xss -> DatatypeInfo xss | |
Newtype :: ModuleName -> DatatypeName -> ConstructorInfo '[x] -> DatatypeInfo '['[x]] |
Instances
moduleName :: DatatypeInfo xss -> ModuleName Source #
The module name where a datatype is defined.
Since: 0.2.3.0
datatypeName :: DatatypeInfo xss -> DatatypeName Source #
The name of a datatype (or newtype).
Since: 0.2.3.0
constructorInfo :: DatatypeInfo xss -> NP ConstructorInfo xss Source #
The constructor info for a datatype (or newtype).
Since: 0.2.3.0
data ConstructorInfo :: [Type] -> Type where Source #
Metadata for a single constructor.
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 Source #
The name of a constructor.
Since: 0.2.3.0
data FieldInfo :: Type -> Type where Source #
For records, this functor maps the component to its selector name.
Instances
Functor FieldInfo Source # | |
Eq (FieldInfo a) Source # | |
Ord (FieldInfo a) Source # | |
Defined in Generics.SOP.Metadata | |
Show (FieldInfo a) Source # | |
class Generic a => HasDatatypeInfo a where Source #
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) Source #
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) Source #
Term-level datatype info; by default, the term-level datatype info is produced from the type-level info.
Instances
HasDatatypeInfo Bool Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Bool :: DatatypeInfo Source # Methods datatypeInfo :: proxy Bool -> DatatypeInfo (Code Bool) Source # | |
HasDatatypeInfo Ordering Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Ordering :: DatatypeInfo Source # Methods datatypeInfo :: proxy Ordering -> DatatypeInfo (Code Ordering) Source # | |
HasDatatypeInfo RuntimeRep Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RuntimeRep :: DatatypeInfo Source # Methods datatypeInfo :: proxy RuntimeRep -> DatatypeInfo (Code RuntimeRep) Source # | |
HasDatatypeInfo VecCount Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf VecCount :: DatatypeInfo Source # Methods datatypeInfo :: proxy VecCount -> DatatypeInfo (Code VecCount) Source # | |
HasDatatypeInfo VecElem Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf VecElem :: DatatypeInfo Source # Methods datatypeInfo :: proxy VecElem -> DatatypeInfo (Code VecElem) Source # | |
HasDatatypeInfo R Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf R :: DatatypeInfo Source # Methods datatypeInfo :: proxy R -> DatatypeInfo (Code R) Source # | |
HasDatatypeInfo D Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf D :: DatatypeInfo Source # Methods datatypeInfo :: proxy D -> DatatypeInfo (Code D) Source # | |
HasDatatypeInfo C Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf C :: DatatypeInfo Source # Methods datatypeInfo :: proxy C -> DatatypeInfo (Code C) Source # | |
HasDatatypeInfo S Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf S :: DatatypeInfo Source # Methods datatypeInfo :: proxy S -> DatatypeInfo (Code S) Source # | |
HasDatatypeInfo CallStack Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CallStack :: DatatypeInfo Source # Methods datatypeInfo :: proxy CallStack -> DatatypeInfo (Code CallStack) Source # | |
HasDatatypeInfo () Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf () :: DatatypeInfo Source # Methods datatypeInfo :: proxy () -> DatatypeInfo (Code ()) Source # | |
HasDatatypeInfo Any Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Any :: DatatypeInfo Source # Methods datatypeInfo :: proxy Any -> DatatypeInfo (Code Any) Source # | |
HasDatatypeInfo FFFormat Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FFFormat :: DatatypeInfo Source # Methods datatypeInfo :: proxy FFFormat -> DatatypeInfo (Code FFFormat) Source # | |
HasDatatypeInfo Associativity Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Associativity :: DatatypeInfo Source # Methods datatypeInfo :: proxy Associativity -> DatatypeInfo (Code Associativity) Source # | |
HasDatatypeInfo DecidedStrictness Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf DecidedStrictness :: DatatypeInfo Source # Methods datatypeInfo :: proxy DecidedStrictness -> DatatypeInfo (Code DecidedStrictness) Source # | |
HasDatatypeInfo Fixity Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Fixity :: DatatypeInfo Source # Methods datatypeInfo :: proxy Fixity -> DatatypeInfo (Code Fixity) Source # | |
HasDatatypeInfo SourceStrictness Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf SourceStrictness :: DatatypeInfo Source # Methods datatypeInfo :: proxy SourceStrictness -> DatatypeInfo (Code SourceStrictness) Source # | |
HasDatatypeInfo SourceUnpackedness Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf SourceUnpackedness :: DatatypeInfo Source # Methods datatypeInfo :: proxy SourceUnpackedness -> DatatypeInfo (Code SourceUnpackedness) Source # | |
HasDatatypeInfo Lexeme Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Lexeme :: DatatypeInfo Source # Methods datatypeInfo :: proxy Lexeme -> DatatypeInfo (Code Lexeme) Source # | |
HasDatatypeInfo SrcLoc Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf SrcLoc :: DatatypeInfo Source # Methods datatypeInfo :: proxy SrcLoc -> DatatypeInfo (Code SrcLoc) Source # | |
HasDatatypeInfo DataRep Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf DataRep :: DatatypeInfo Source # Methods datatypeInfo :: proxy DataRep -> DatatypeInfo (Code DataRep) Source # | |
HasDatatypeInfo ConstrRep Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ConstrRep :: DatatypeInfo Source # Methods datatypeInfo :: proxy ConstrRep -> DatatypeInfo (Code ConstrRep) Source # | |
HasDatatypeInfo SpecConstrAnnotation Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf SpecConstrAnnotation :: DatatypeInfo Source # Methods datatypeInfo :: proxy SpecConstrAnnotation -> DatatypeInfo (Code SpecConstrAnnotation) Source # | |
HasDatatypeInfo Version Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Version :: DatatypeInfo Source # Methods datatypeInfo :: proxy Version -> DatatypeInfo (Code Version) Source # | |
HasDatatypeInfo All Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf All :: DatatypeInfo Source # Methods datatypeInfo :: proxy All -> DatatypeInfo (Code All) Source # | |
HasDatatypeInfo NestedAtomically Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf NestedAtomically :: DatatypeInfo Source # Methods datatypeInfo :: proxy NestedAtomically -> DatatypeInfo (Code NestedAtomically) Source # | |
HasDatatypeInfo NoMethodError Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf NoMethodError :: DatatypeInfo Source # Methods datatypeInfo :: proxy NoMethodError -> DatatypeInfo (Code NoMethodError) Source # | |
HasDatatypeInfo NonTermination Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf NonTermination :: DatatypeInfo Source # Methods datatypeInfo :: proxy NonTermination -> DatatypeInfo (Code NonTermination) Source # | |
HasDatatypeInfo PatternMatchFail Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf PatternMatchFail :: DatatypeInfo Source # Methods datatypeInfo :: proxy PatternMatchFail -> DatatypeInfo (Code PatternMatchFail) Source # | |
HasDatatypeInfo RecConError Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RecConError :: DatatypeInfo Source # Methods datatypeInfo :: proxy RecConError -> DatatypeInfo (Code RecConError) Source # | |
HasDatatypeInfo RecSelError Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RecSelError :: DatatypeInfo Source # Methods datatypeInfo :: proxy RecSelError -> DatatypeInfo (Code RecSelError) Source # | |
HasDatatypeInfo RecUpdError Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RecUpdError :: DatatypeInfo Source # Methods datatypeInfo :: proxy RecUpdError -> DatatypeInfo (Code RecUpdError) Source # | |
HasDatatypeInfo TypeError Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf TypeError :: DatatypeInfo Source # Methods datatypeInfo :: proxy TypeError -> DatatypeInfo (Code TypeError) Source # | |
HasDatatypeInfo ErrorCall Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ErrorCall :: DatatypeInfo Source # Methods datatypeInfo :: proxy ErrorCall -> DatatypeInfo (Code ErrorCall) Source # | |
HasDatatypeInfo ArithException Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ArithException :: DatatypeInfo Source # Methods datatypeInfo :: proxy ArithException -> DatatypeInfo (Code ArithException) Source # | |
HasDatatypeInfo MaskingState Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf MaskingState :: DatatypeInfo Source # Methods datatypeInfo :: proxy MaskingState -> DatatypeInfo (Code MaskingState) Source # | |
HasDatatypeInfo AllocationLimitExceeded Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf AllocationLimitExceeded :: DatatypeInfo Source # Methods datatypeInfo :: proxy AllocationLimitExceeded -> DatatypeInfo (Code AllocationLimitExceeded) Source # | |
HasDatatypeInfo ArrayException Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ArrayException :: DatatypeInfo Source # Methods datatypeInfo :: proxy ArrayException -> DatatypeInfo (Code ArrayException) Source # | |
HasDatatypeInfo AssertionFailed Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf AssertionFailed :: DatatypeInfo Source # Methods datatypeInfo :: proxy AssertionFailed -> DatatypeInfo (Code AssertionFailed) Source # | |
HasDatatypeInfo AsyncException Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf AsyncException :: DatatypeInfo Source # Methods datatypeInfo :: proxy AsyncException -> DatatypeInfo (Code AsyncException) Source # | |
HasDatatypeInfo BlockedIndefinitelyOnMVar Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf BlockedIndefinitelyOnMVar :: DatatypeInfo Source # Methods datatypeInfo :: proxy BlockedIndefinitelyOnMVar -> DatatypeInfo (Code BlockedIndefinitelyOnMVar) Source # | |
HasDatatypeInfo BlockedIndefinitelyOnSTM Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf BlockedIndefinitelyOnSTM :: DatatypeInfo Source # Methods datatypeInfo :: proxy BlockedIndefinitelyOnSTM -> DatatypeInfo (Code BlockedIndefinitelyOnSTM) Source # | |
HasDatatypeInfo Deadlock Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Deadlock :: DatatypeInfo Source # Methods datatypeInfo :: proxy Deadlock -> DatatypeInfo (Code Deadlock) Source # | |
HasDatatypeInfo IOException Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf IOException :: DatatypeInfo Source # Methods datatypeInfo :: proxy IOException -> DatatypeInfo (Code IOException) Source # | |
HasDatatypeInfo GeneralCategory Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf GeneralCategory :: DatatypeInfo Source # Methods datatypeInfo :: proxy GeneralCategory -> DatatypeInfo (Code GeneralCategory) Source # | |
HasDatatypeInfo Fixity Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Fixity :: DatatypeInfo Source # Methods datatypeInfo :: proxy Fixity -> DatatypeInfo (Code Fixity) Source # | |
HasDatatypeInfo E0 Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf E0 :: DatatypeInfo Source # Methods datatypeInfo :: proxy E0 -> DatatypeInfo (Code E0) Source # | |
HasDatatypeInfo E1 Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf E1 :: DatatypeInfo Source # Methods datatypeInfo :: proxy E1 -> DatatypeInfo (Code E1) Source # | |
HasDatatypeInfo E12 Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf E12 :: DatatypeInfo Source # Methods datatypeInfo :: proxy E12 -> DatatypeInfo (Code E12) Source # | |
HasDatatypeInfo E2 Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf E2 :: DatatypeInfo Source # Methods datatypeInfo :: proxy E2 -> DatatypeInfo (Code E2) Source # | |
HasDatatypeInfo E3 Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf E3 :: DatatypeInfo Source # Methods datatypeInfo :: proxy E3 -> DatatypeInfo (Code E3) Source # | |
HasDatatypeInfo E6 Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf E6 :: DatatypeInfo Source # Methods datatypeInfo :: proxy E6 -> DatatypeInfo (Code E6) Source # | |
HasDatatypeInfo E9 Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf E9 :: DatatypeInfo Source # Methods datatypeInfo :: proxy E9 -> DatatypeInfo (Code E9) Source # | |
HasDatatypeInfo Void Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Void :: DatatypeInfo Source # Methods datatypeInfo :: proxy Void -> DatatypeInfo (Code Void) Source # | |
HasDatatypeInfo Errno Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Errno :: DatatypeInfo Source # Methods datatypeInfo :: proxy Errno -> DatatypeInfo (Code Errno) Source # | |
HasDatatypeInfo CInt Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CInt :: DatatypeInfo Source # Methods datatypeInfo :: proxy CInt -> DatatypeInfo (Code CInt) Source # | |
HasDatatypeInfo CChar Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CChar :: DatatypeInfo Source # Methods datatypeInfo :: proxy CChar -> DatatypeInfo (Code CChar) Source # | |
HasDatatypeInfo CClock Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CClock :: DatatypeInfo Source # Methods datatypeInfo :: proxy CClock -> DatatypeInfo (Code CClock) Source # | |
HasDatatypeInfo CDouble Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CDouble :: DatatypeInfo Source # Methods datatypeInfo :: proxy CDouble -> DatatypeInfo (Code CDouble) Source # | |
HasDatatypeInfo CFloat Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CFloat :: DatatypeInfo Source # Methods datatypeInfo :: proxy CFloat -> DatatypeInfo (Code CFloat) Source # | |
HasDatatypeInfo CIntMax Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CIntMax :: DatatypeInfo Source # Methods datatypeInfo :: proxy CIntMax -> DatatypeInfo (Code CIntMax) Source # | |
HasDatatypeInfo CIntPtr Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CIntPtr :: DatatypeInfo Source # Methods datatypeInfo :: proxy CIntPtr -> DatatypeInfo (Code CIntPtr) Source # | |
HasDatatypeInfo CLLong Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CLLong :: DatatypeInfo Source # Methods datatypeInfo :: proxy CLLong -> DatatypeInfo (Code CLLong) Source # | |
HasDatatypeInfo CLong Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CLong :: DatatypeInfo Source # Methods datatypeInfo :: proxy CLong -> DatatypeInfo (Code CLong) Source # | |
HasDatatypeInfo CPtrdiff Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CPtrdiff :: DatatypeInfo Source # Methods datatypeInfo :: proxy CPtrdiff -> DatatypeInfo (Code CPtrdiff) Source # | |
HasDatatypeInfo CSChar Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CSChar :: DatatypeInfo Source # Methods datatypeInfo :: proxy CSChar -> DatatypeInfo (Code CSChar) Source # | |
HasDatatypeInfo CSUSeconds Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CSUSeconds :: DatatypeInfo Source # Methods datatypeInfo :: proxy CSUSeconds -> DatatypeInfo (Code CSUSeconds) Source # | |
HasDatatypeInfo CShort Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CShort :: DatatypeInfo Source # Methods datatypeInfo :: proxy CShort -> DatatypeInfo (Code CShort) Source # | |
HasDatatypeInfo CSigAtomic Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CSigAtomic :: DatatypeInfo Source # Methods datatypeInfo :: proxy CSigAtomic -> DatatypeInfo (Code CSigAtomic) Source # | |
HasDatatypeInfo CSize Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CSize :: DatatypeInfo Source # Methods datatypeInfo :: proxy CSize -> DatatypeInfo (Code CSize) Source # | |
HasDatatypeInfo CTime Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CTime :: DatatypeInfo Source # Methods datatypeInfo :: proxy CTime -> DatatypeInfo (Code CTime) Source # | |
HasDatatypeInfo CUChar Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUChar :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUChar -> DatatypeInfo (Code CUChar) Source # | |
HasDatatypeInfo CUInt Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUInt :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUInt -> DatatypeInfo (Code CUInt) Source # | |
HasDatatypeInfo CUIntMax Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUIntMax :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUIntMax -> DatatypeInfo (Code CUIntMax) Source # | |
HasDatatypeInfo CUIntPtr Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUIntPtr :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUIntPtr -> DatatypeInfo (Code CUIntPtr) Source # | |
HasDatatypeInfo CULLong Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CULLong :: DatatypeInfo Source # Methods datatypeInfo :: proxy CULLong -> DatatypeInfo (Code CULLong) Source # | |
HasDatatypeInfo CULong Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CULong :: DatatypeInfo Source # Methods datatypeInfo :: proxy CULong -> DatatypeInfo (Code CULong) Source # | |
HasDatatypeInfo CUSeconds Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUSeconds :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUSeconds -> DatatypeInfo (Code CUSeconds) Source # | |
HasDatatypeInfo CUShort Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUShort :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUShort -> DatatypeInfo (Code CUShort) Source # | |
HasDatatypeInfo CWchar Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CWchar :: DatatypeInfo Source # Methods datatypeInfo :: proxy CWchar -> DatatypeInfo (Code CWchar) Source # | |
HasDatatypeInfo ByteOrder Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ByteOrder :: DatatypeInfo Source # Methods datatypeInfo :: proxy ByteOrder -> DatatypeInfo (Code ByteOrder) Source # | |
HasDatatypeInfo BlockReason Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf BlockReason :: DatatypeInfo Source # Methods datatypeInfo :: proxy BlockReason -> DatatypeInfo (Code BlockReason) Source # | |
HasDatatypeInfo ThreadStatus Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ThreadStatus :: DatatypeInfo Source # Methods datatypeInfo :: proxy ThreadStatus -> DatatypeInfo (Code ThreadStatus) Source # | |
HasDatatypeInfo Location Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Location :: DatatypeInfo Source # Methods datatypeInfo :: proxy Location -> DatatypeInfo (Code Location) Source # | |
HasDatatypeInfo SrcLoc Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf SrcLoc :: DatatypeInfo Source # Methods datatypeInfo :: proxy SrcLoc -> DatatypeInfo (Code SrcLoc) Source # | |
HasDatatypeInfo Fingerprint Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Fingerprint :: DatatypeInfo Source # Methods datatypeInfo :: proxy Fingerprint -> DatatypeInfo (Code Fingerprint) Source # | |
HasDatatypeInfo BufferState Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf BufferState :: DatatypeInfo Source # Methods datatypeInfo :: proxy BufferState -> DatatypeInfo (Code BufferState) Source # | |
HasDatatypeInfo IODeviceType Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf IODeviceType :: DatatypeInfo Source # Methods datatypeInfo :: proxy IODeviceType -> DatatypeInfo (Code IODeviceType) Source # | |
HasDatatypeInfo SeekMode Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf SeekMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy SeekMode -> DatatypeInfo (Code SeekMode) Source # | |
HasDatatypeInfo CodingProgress Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CodingProgress :: DatatypeInfo Source # Methods datatypeInfo :: proxy CodingProgress -> DatatypeInfo (Code CodingProgress) Source # | |
HasDatatypeInfo CodingFailureMode Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CodingFailureMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy CodingFailureMode -> DatatypeInfo (Code CodingFailureMode) Source # | |
HasDatatypeInfo ExitCode Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ExitCode :: DatatypeInfo Source # Methods datatypeInfo :: proxy ExitCode -> DatatypeInfo (Code ExitCode) Source # | |
HasDatatypeInfo FixIOException Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FixIOException :: DatatypeInfo Source # Methods datatypeInfo :: proxy FixIOException -> DatatypeInfo (Code FixIOException) Source # | |
HasDatatypeInfo IOErrorType Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf IOErrorType :: DatatypeInfo Source # Methods datatypeInfo :: proxy IOErrorType -> DatatypeInfo (Code IOErrorType) Source # | |
HasDatatypeInfo HandlePosn Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf HandlePosn :: DatatypeInfo Source # Methods datatypeInfo :: proxy HandlePosn -> DatatypeInfo (Code HandlePosn) Source # | |
HasDatatypeInfo LockMode Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf LockMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy LockMode -> DatatypeInfo (Code LockMode) Source # | |
HasDatatypeInfo BufferMode Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf BufferMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy BufferMode -> DatatypeInfo (Code BufferMode) Source # | |
HasDatatypeInfo Newline Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Newline :: DatatypeInfo Source # Methods datatypeInfo :: proxy Newline -> DatatypeInfo (Code Newline) Source # | |
HasDatatypeInfo NewlineMode Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf NewlineMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy NewlineMode -> DatatypeInfo (Code NewlineMode) Source # | |
HasDatatypeInfo CCFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CCFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy CCFlags -> DatatypeInfo (Code CCFlags) Source # | |
HasDatatypeInfo ConcFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ConcFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy ConcFlags -> DatatypeInfo (Code ConcFlags) Source # | |
HasDatatypeInfo DebugFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf DebugFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy DebugFlags -> DatatypeInfo (Code DebugFlags) Source # | |
HasDatatypeInfo DoCostCentres Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf DoCostCentres :: DatatypeInfo Source # Methods datatypeInfo :: proxy DoCostCentres -> DatatypeInfo (Code DoCostCentres) Source # | |
HasDatatypeInfo DoHeapProfile Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf DoHeapProfile :: DatatypeInfo Source # Methods datatypeInfo :: proxy DoHeapProfile -> DatatypeInfo (Code DoHeapProfile) Source # | |
HasDatatypeInfo DoTrace Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf DoTrace :: DatatypeInfo Source # Methods datatypeInfo :: proxy DoTrace -> DatatypeInfo (Code DoTrace) Source # | |
HasDatatypeInfo GCFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf GCFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy GCFlags -> DatatypeInfo (Code GCFlags) Source # | |
HasDatatypeInfo GiveGCStats Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf GiveGCStats :: DatatypeInfo Source # Methods datatypeInfo :: proxy GiveGCStats -> DatatypeInfo (Code GiveGCStats) Source # | |
HasDatatypeInfo MiscFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf MiscFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy MiscFlags -> DatatypeInfo (Code MiscFlags) Source # | |
HasDatatypeInfo ParFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ParFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy ParFlags -> DatatypeInfo (Code ParFlags) Source # | |
HasDatatypeInfo ProfFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ProfFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy ProfFlags -> DatatypeInfo (Code ProfFlags) Source # | |
HasDatatypeInfo RTSFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RTSFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy RTSFlags -> DatatypeInfo (Code RTSFlags) Source # | |
HasDatatypeInfo TickyFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf TickyFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy TickyFlags -> DatatypeInfo (Code TickyFlags) Source # | |
HasDatatypeInfo TraceFlags Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf TraceFlags :: DatatypeInfo Source # Methods datatypeInfo :: proxy TraceFlags -> DatatypeInfo (Code TraceFlags) Source # | |
HasDatatypeInfo StaticPtrInfo Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf StaticPtrInfo :: DatatypeInfo Source # Methods datatypeInfo :: proxy StaticPtrInfo -> DatatypeInfo (Code StaticPtrInfo) Source # | |
HasDatatypeInfo GCDetails Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf GCDetails :: DatatypeInfo Source # Methods datatypeInfo :: proxy GCDetails -> DatatypeInfo (Code GCDetails) Source # | |
HasDatatypeInfo RTSStats Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RTSStats :: DatatypeInfo Source # Methods datatypeInfo :: proxy RTSStats -> DatatypeInfo (Code RTSStats) Source # | |
HasDatatypeInfo IOMode Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf IOMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy IOMode -> DatatypeInfo (Code IOMode) Source # | |
HasDatatypeInfo FieldFormat Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FieldFormat :: DatatypeInfo Source # Methods datatypeInfo :: proxy FieldFormat -> DatatypeInfo (Code FieldFormat) Source # | |
HasDatatypeInfo FormatAdjustment Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FormatAdjustment :: DatatypeInfo Source # Methods datatypeInfo :: proxy FormatAdjustment -> DatatypeInfo (Code FormatAdjustment) Source # | |
HasDatatypeInfo FormatParse Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FormatParse :: DatatypeInfo Source # Methods datatypeInfo :: proxy FormatParse -> DatatypeInfo (Code FormatParse) Source # | |
HasDatatypeInfo FormatSign Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FormatSign :: DatatypeInfo Source # Methods datatypeInfo :: proxy FormatSign -> DatatypeInfo (Code FormatSign) Source # | |
HasDatatypeInfo Number Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Number :: DatatypeInfo Source # Methods datatypeInfo :: proxy Number -> DatatypeInfo (Code Number) Source # | |
HasDatatypeInfo [a] Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf [a] :: DatatypeInfo Source # Methods datatypeInfo :: proxy [a] -> DatatypeInfo (Code [a]) Source # | |
HasDatatypeInfo (Maybe a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Maybe a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Maybe a) -> DatatypeInfo (Code (Maybe a)) Source # | |
HasDatatypeInfo (Par1 p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Par1 p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Par1 p) -> DatatypeInfo (Code (Par1 p)) Source # | |
HasDatatypeInfo (I a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (I a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (I a) -> DatatypeInfo (Code (I a)) Source # | |
HasDatatypeInfo (Dual a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Dual a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Dual a) -> DatatypeInfo (Code (Dual a)) Source # | |
HasDatatypeInfo (Endo a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Endo a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Endo a) -> DatatypeInfo (Code (Endo a)) Source # | |
HasDatatypeInfo (Product a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Product a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Product a) -> DatatypeInfo (Code (Product a)) Source # | |
HasDatatypeInfo (Sum a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Sum a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Sum a) -> DatatypeInfo (Code (Sum a)) Source # | |
HasDatatypeInfo (NonEmpty a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (NonEmpty a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (NonEmpty a) -> DatatypeInfo (Code (NonEmpty a)) Source # | |
HasDatatypeInfo (Down a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Down a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Down a) -> DatatypeInfo (Code (Down a)) Source # | |
HasDatatypeInfo (Identity a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Identity a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Identity a) -> DatatypeInfo (Code (Identity a)) Source # | |
HasDatatypeInfo (First a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (First a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (First a) -> DatatypeInfo (Code (First a)) Source # | |
HasDatatypeInfo (Last a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Last a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Last a) -> DatatypeInfo (Code (Last a)) Source # | |
HasDatatypeInfo (Complex a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Complex a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Complex a) -> DatatypeInfo (Code (Complex a)) Source # | |
HasDatatypeInfo (Fixed a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Fixed a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Fixed a) -> DatatypeInfo (Code (Fixed a)) Source # | |
HasDatatypeInfo (First a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (First a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (First a) -> DatatypeInfo (Code (First a)) Source # | |
HasDatatypeInfo (Last a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Last a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Last a) -> DatatypeInfo (Code (Last a)) Source # | |
HasDatatypeInfo (Max a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Max a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Max a) -> DatatypeInfo (Code (Max a)) Source # | |
HasDatatypeInfo (Min a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Min a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Min a) -> DatatypeInfo (Code (Min a)) Source # | |
HasDatatypeInfo (Option a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Option a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Option a) -> DatatypeInfo (Code (Option a)) Source # | |
HasDatatypeInfo (WrappedMonoid m) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (WrappedMonoid m) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (WrappedMonoid m) -> DatatypeInfo (Code (WrappedMonoid m)) Source # | |
HasDatatypeInfo (Buffer e) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Buffer e) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Buffer e) -> DatatypeInfo (Code (Buffer e)) Source # | |
HasDatatypeInfo (ArgDescr a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (ArgDescr a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (ArgDescr a) -> DatatypeInfo (Code (ArgDescr a)) Source # | |
HasDatatypeInfo (ArgOrder a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (ArgOrder a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (ArgOrder a) -> DatatypeInfo (Code (ArgOrder a)) Source # | |
HasDatatypeInfo (OptDescr a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (OptDescr a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (OptDescr a) -> DatatypeInfo (Code (OptDescr a)) Source # | |
HasDatatypeInfo (Either a b) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Either a b) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Either a b) -> DatatypeInfo (Code (Either a b)) Source # | |
HasDatatypeInfo (V1 p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (V1 p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (V1 p) -> DatatypeInfo (Code (V1 p)) Source # | |
HasDatatypeInfo (U1 p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (U1 p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (U1 p) -> DatatypeInfo (Code (U1 p)) Source # | |
HasDatatypeInfo (a, b) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b) -> DatatypeInfo (Code (a, b)) Source # | |
HasDatatypeInfo (Proxy t) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Proxy t) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Proxy t) -> DatatypeInfo (Code (Proxy t)) Source # | |
HasDatatypeInfo (Arg a b) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Arg a b) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Arg a b) -> DatatypeInfo (Code (Arg a b)) Source # | |
HasDatatypeInfo (a, b, c) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c) -> DatatypeInfo (Code (a, b, c)) Source # | |
HasDatatypeInfo (K a b) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (K a b) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (K a b) -> DatatypeInfo (Code (K a b)) Source # | |
HasDatatypeInfo (Const a b) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Const a b) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Const a b) -> DatatypeInfo (Code (Const a b)) Source # | |
HasDatatypeInfo (Alt f a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Alt f a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Alt f a) -> DatatypeInfo (Code (Alt f a)) Source # | |
HasDatatypeInfo (BufferCodec from to state) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (BufferCodec from to state) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (BufferCodec from to state) -> DatatypeInfo (Code (BufferCodec from to state)) Source # | |
HasDatatypeInfo (K1 i c p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (K1 i c p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (K1 i c p) -> DatatypeInfo (Code (K1 i c p)) Source # | |
HasDatatypeInfo ((f :+: g) p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f :+: g) p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy ((f :+: g) p) -> DatatypeInfo (Code ((f :+: g) p)) Source # | |
HasDatatypeInfo ((f :*: g) p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f :*: g) p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy ((f :*: g) p) -> DatatypeInfo (Code ((f :*: g) p)) Source # | |
HasDatatypeInfo (a, b, c, d) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d) -> DatatypeInfo (Code (a, b, c, d)) Source # | |
HasDatatypeInfo ((f -.-> g) a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f -.-> g) a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy ((f -.-> g) a) -> DatatypeInfo (Code ((f -.-> g) a)) Source # | |
HasDatatypeInfo (Product f g a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Product f g a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Product f g a) -> DatatypeInfo (Code (Product f g a)) Source # | |
HasDatatypeInfo (Sum f g a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Sum f g a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Sum f g a) -> DatatypeInfo (Code (Sum f g a)) Source # | |
HasDatatypeInfo (M1 i c f p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (M1 i c f p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (M1 i c f p) -> DatatypeInfo (Code (M1 i c f p)) Source # | |
HasDatatypeInfo ((f :.: g) p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f :.: g) p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy ((f :.: g) p) -> DatatypeInfo (Code ((f :.: g) p)) Source # | |
HasDatatypeInfo (a, b, c, d, e) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e) -> DatatypeInfo (Code (a, b, c, d, e)) Source # | |
HasDatatypeInfo ((f :.: g) p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f :.: g) p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy ((f :.: g) p) -> DatatypeInfo (Code ((f :.: g) p)) Source # | |
HasDatatypeInfo (Compose f g a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Compose f g a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Compose f g a) -> DatatypeInfo (Code (Compose f g a)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f) -> DatatypeInfo (Code (a, b, c, d, e, f)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g) -> DatatypeInfo (Code (a, b, c, d, e, f, g)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w) -> DatatypeInfo (Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w)) Source # | |
HasDatatypeInfo (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x) -> DatatypeInfo (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)) Source # | |
HasDatatypeInfo (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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (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) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (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) -> DatatypeInfo (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)) Source # | |
HasDatatypeInfo (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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (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) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (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) -> DatatypeInfo (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)) Source # | |
HasDatatypeInfo (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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (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) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (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) -> DatatypeInfo (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)) Source # | |
HasDatatypeInfo (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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (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) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (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) -> DatatypeInfo (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)) Source # | |
HasDatatypeInfo (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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (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) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (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) -> DatatypeInfo (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)) Source # | |
HasDatatypeInfo (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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (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) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (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) -> DatatypeInfo (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)) Source # |
type DatatypeName = String Source #
The name of a datatype.
type ModuleName = String Source #
The name of a module.
type ConstructorName = String Source #
The name of a data constructor.
data Associativity #
Constructors
LeftAssociative | |
RightAssociative | |
NotAssociative |
Instances
Bounded Associativity | |
Defined in GHC.Generics | |
Enum Associativity | |
Defined in GHC.Generics Methods succ :: Associativity -> Associativity pred :: Associativity -> Associativity toEnum :: Int -> Associativity fromEnum :: Associativity -> Int enumFrom :: Associativity -> [Associativity] enumFromThen :: Associativity -> Associativity -> [Associativity] enumFromTo :: Associativity -> Associativity -> [Associativity] enumFromThenTo :: Associativity -> Associativity -> Associativity -> [Associativity] | |
Eq Associativity | |
Defined in GHC.Generics | |
Data Associativity | |
Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Associativity -> c Associativity gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Associativity toConstr :: Associativity -> Constr dataTypeOf :: Associativity -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Associativity) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Associativity) gmapT :: (forall b. Data b => b -> b) -> Associativity -> Associativity gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Associativity -> r gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Associativity -> r gmapQ :: (forall d. Data d => d -> u) -> Associativity -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Associativity -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Associativity -> m Associativity gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Associativity -> m Associativity gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Associativity -> m Associativity | |
Ord Associativity | |
Defined in GHC.Generics Methods compare :: Associativity -> Associativity -> Ordering (<) :: Associativity -> Associativity -> Bool (<=) :: Associativity -> Associativity -> Bool (>) :: Associativity -> Associativity -> Bool (>=) :: Associativity -> Associativity -> Bool max :: Associativity -> Associativity -> Associativity min :: Associativity -> Associativity -> Associativity | |
Read Associativity | |
Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Associativity readList :: ReadS [Associativity] readPrec :: ReadPrec Associativity readListPrec :: ReadPrec [Associativity] | |
Show Associativity | |
Defined in GHC.Generics Methods showsPrec :: Int -> Associativity -> ShowS show :: Associativity -> String showList :: [Associativity] -> ShowS | |
Ix Associativity | |
Defined in GHC.Generics Methods range :: (Associativity, Associativity) -> [Associativity] index :: (Associativity, Associativity) -> Associativity -> Int unsafeIndex :: (Associativity, Associativity) -> Associativity -> Int inRange :: (Associativity, Associativity) -> Associativity -> Bool rangeSize :: (Associativity, Associativity) -> Int unsafeRangeSize :: (Associativity, Associativity) -> Int | |
Generic Associativity | |
Defined in GHC.Generics Associated Types type Rep Associativity :: Type -> Type | |
SingKind Associativity | |
Defined in GHC.Generics Associated Types type DemoteRep Associativity :: Type Methods fromSing :: Sing a -> DemoteRep Associativity | |
HasDatatypeInfo Associativity Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Associativity :: DatatypeInfo Source # Methods datatypeInfo :: proxy Associativity -> DatatypeInfo (Code Associativity) Source # | |
Generic Associativity Source # | |
Defined in Generics.SOP.Instances Associated Types type Code Associativity :: [[Type]] Source # Methods from :: Associativity -> Rep Associativity Source # to :: Rep Associativity -> Associativity Source # | |
SingI LeftAssociative | |
Defined in GHC.Generics Methods sing :: Sing LeftAssociative | |
SingI RightAssociative | |
Defined in GHC.Generics Methods sing :: Sing RightAssociative | |
SingI NotAssociative | |
Defined in GHC.Generics Methods sing :: Sing NotAssociative | |
type Rep Associativity | |
Defined in GHC.Generics type Rep Associativity = D1 (MetaData "Associativity" "GHC.Generics" "base" False) (C1 (MetaCons "LeftAssociative" PrefixI False) (U1 :: Type -> Type) :+: (C1 (MetaCons "RightAssociative" PrefixI False) (U1 :: Type -> Type) :+: C1 (MetaCons "NotAssociative" PrefixI False) (U1 :: Type -> Type))) | |
type DemoteRep Associativity | |
Defined in GHC.Generics | |
data Sing (a :: Associativity) | |
Defined in GHC.Generics data Sing (a :: Associativity) where
| |
type DatatypeInfoOf Associativity Source # | |
Defined in Generics.SOP.Instances type DatatypeInfoOf Associativity = ADT "GHC.Generics" "Associativity" (Constructor "LeftAssociative" ': (Constructor "RightAssociative" ': (Constructor "NotAssociative" ': ([] :: [ConstructorInfo])))) (([] :: [StrictnessInfo]) ': (([] :: [StrictnessInfo]) ': (([] :: [StrictnessInfo]) ': ([] :: [[StrictnessInfo]])))) | |
type Code Associativity Source # | |
Defined in Generics.SOP.Instances type Code Associativity = ([] :: [Type]) ': (([] :: [Type]) ': (([] :: [Type]) ': ([] :: [[Type]]))) |
Combinators
Constructing products
class HPure (h :: (k -> Type) -> l -> Type) where Source #
Methods
hpure :: SListIN h xs => (forall (a :: k). f a) -> h f xs Source #
Corresponds to pure
directly.
Instances:
hpure
,pure_NP
::SListI
xs => (forall a. f a) ->NP
f xshpure
,pure_POP
::SListI2
xss => (forall a. f a) ->POP
f xss
hcpure :: AllN h c xs => proxy c -> (forall (a :: k). c a => f a) -> h f xs Source #
A variant of hpure
that allows passing in a constrained
argument.
Calling
where 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
states.AllN
h c xs
Instances:
hcpure
,cpure_NP
:: (All
c xs ) => proxy c -> (forall a. c a => f a) ->NP
f xshcpure
,cpure_POP
:: (All2
c xss) => proxy c -> (forall a. c a => f a) ->POP
f xss
Destructing products
type Projection (f :: k -> Type) (xs :: [k]) = (K (NP f xs) :: k -> Type) -.-> f Source #
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 Source #
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 Source #
Application
newtype ((f :: k -> Type) -.-> (g :: k -> Type)) (a :: k) :: forall k. (k -> Type) -> (k -> Type) -> k -> Type infixr 1 Source #
Lifted functions.
Instances
HasDatatypeInfo ((f -.-> g) a) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f -.-> g) a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy ((f -.-> g) a) -> DatatypeInfo (Code ((f -.-> g) a)) Source # | |
Generic ((f -.-> g) a) Source # | |
type DatatypeInfoOf ((f -.-> g) a) Source # | |
Defined in Generics.SOP.Instances | |
type Code ((f -.-> g) a) Source # | |
Defined in Generics.SOP.Instances |
fn :: (f a -> f' a) -> (f -.-> f') a Source #
Construct a lifted function.
Same as Fn
. Only available for uniformity with the
higher-arity versions.
fn_2 :: (f a -> f' a -> f'' a) -> (f -.-> (f' -.-> f'')) a Source #
Construct a binary lifted function.
fn_3 :: (f a -> f' a -> f'' a -> f''' a) -> (f -.-> (f' -.-> (f'' -.-> f'''))) a Source #
Construct a ternary lifted function.
fn_4 :: (f a -> f' a -> f'' a -> f''' a -> f'''' a) -> (f -.-> (f' -.-> (f'' -.-> (f''' -.-> f'''')))) a Source #
Construct a quarternary lifted function.
type family Prod (h :: (k -> Type) -> l -> Type) :: (k -> Type) -> l -> Type Source #
Maps a structure containing sums to the corresponding product structure.
Instances
type Prod (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
type Prod (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS | |
type Prod (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP | |
type Prod (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP |
class (Prod (Prod h) ~ Prod h, HPure (Prod h)) => HAp (h :: (k -> Type) -> l -> Type) where Source #
A generalization of <*>
.
Methods
hap :: Prod h (f -.-> g) xs -> h f xs -> h g xs Source #
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 ->NP
f xs ->NP
g xshap
,ap_NS
::NP
(f -.-> g) xs ->NS
f xs ->NS
g xshap
,ap_POP
::POP
(f -.-> g) xss ->POP
f xss ->POP
g xsshap
,ap_SOP
::POP
(f -.-> g) xss ->SOP
f xss ->SOP
g xss
Lifting / mapping
hliftA :: (SListIN (Prod h) xs, HAp h) => (forall (a :: k). f a -> f' a) -> h f xs -> h f' xs Source #
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:
hliftA
f xs =hpure
(fn
f) `hap
` xs
Instances:
hliftA
,liftA_NP
::SListI
xs => (forall a. f a -> f' a) ->NP
f xs ->NP
f' xshliftA
,liftA_NS
::SListI
xs => (forall a. f a -> f' a) ->NS
f xs ->NS
f' xshliftA
,liftA_POP
::SListI2
xss => (forall a. f a -> f' a) ->POP
f xss ->POP
f' xsshliftA
,liftA_SOP
::SListI2
xss => (forall a. f a -> f' a) ->SOP
f xss ->SOP
f' 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 Source #
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:
hliftA2
f xs ys =hpure
(fn_2
f) `hap
` xs `hap
` ys
Instances:
hliftA2
,liftA2_NP
::SListI
xs => (forall a. f a -> f' a -> f'' a) ->NP
f xs ->NP
f' xs ->NP
f'' xshliftA2
,liftA2_NS
::SListI
xs => (forall a. f a -> f' a -> f'' a) ->NP
f xs ->NS
f' xs ->NS
f'' xshliftA2
,liftA2_POP
::SListI2
xss => (forall a. f a -> f' a -> f'' a) ->POP
f xss ->POP
f' xss ->POP
f'' xsshliftA2
,liftA2_SOP
::SListI2
xss => (forall a. f a -> f' a -> f'' a) ->POP
f xss ->SOP
f' xss ->SOP
f'' 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 Source #
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:
hliftA3
f xs ys zs =hpure
(fn_3
f) `hap
` xs `hap
` ys `hap
` zs
Instances:
hliftA3
,liftA3_NP
::SListI
xs => (forall a. f a -> f' a -> f'' a -> f''' a) ->NP
f xs ->NP
f' xs ->NP
f'' xs ->NP
f''' xshliftA3
,liftA3_NS
::SListI
xs => (forall a. f a -> f' a -> f'' a -> f''' a) ->NP
f xs ->NP
f' xs ->NS
f'' xs ->NS
f''' xshliftA3
,liftA3_POP
::SListI2
xss => (forall a. f a -> f' a -> f'' a -> f''' a) ->POP
f xss ->POP
f' xss ->POP
f'' xss ->POP
f''' xshliftA3
,liftA3_SOP
::SListI2
xss => (forall a. f a -> f' a -> f'' a -> f''' a) ->POP
f xss ->POP
f' xss ->SOP
f'' xss ->SOP
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 Source #
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 Source #
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 Source #
hmap :: (SListIN (Prod h) xs, HAp h) => (forall (a :: k). f a -> f' a) -> h f xs -> h f' xs Source #
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 Source #
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 Source #
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 Source #
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 Source #
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 Source #
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) Source #
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 Source #
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 Source #
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 Source #
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 Source #
Maps a structure containing products to the corresponding sum structure.
Since: sop-core-0.2.4.0
Instances
type UnProd (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
type UnProd (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS |
class UnProd (Prod h) ~ h => HApInjs (h :: (k -> Type) -> l -> Type) where Source #
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] Source #
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
::SListI
xs =>NP
f xs -> [NS
f xs ]hapInjs
,apInjs_SOP
::SListI2
xss =>POP
f xs -> [SOP
f 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] Source #
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] Source #
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 Source #
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 Source #
A class for determining which choice in a sum-like structure a value represents.
Methods
hindex :: h f xs -> Int Source #
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
returns a number between
hindex
x0
and n - 1
representing the index of the choice
made by x
.
Instances:
hindex
,index_NS
::NS
f xs -> Inthindex
,index_SOP
::SOP
f 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
type Ejection (f :: k -> Type) (xs :: [k]) = (K (NS f xs) :: k -> Type) -.-> (Maybe :.: f) Source #
The type of ejections from an n-ary sum.
An ejection is the pattern matching function for one part of the n-ary sum.
It is the opposite of an Injection
.
Since: sop-core-0.5.0.0
ejections :: SListI xs => NP (Ejection f xs) xs Source #
Compute all ejections from an n-ary sum.
Each element of the resulting product contains one of the ejections.
Since: sop-core-0.5.0.0
shiftEjection :: Ejection f xs a2 -> Ejection f (x ': xs) a2 Source #
Since: sop-core-0.5.0.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 Source #
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_NP
p `hap
` xs
Instances:
hcliftA'
::All2
c xss => proxy c -> (forall xs.All
c xs => f xs -> f' xs) ->NP
f xss ->NP
f' xsshcliftA'
::All2
c xss => proxy c -> (forall xs.All
c xs => f xs -> f' xs) ->NS
f xss ->NS
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 Source #
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 Source #
Like hcliftA'
, but for ternary 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 Source #
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 Source #
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 Source #
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
contains a single NS
(K
a)a
, and an
contains
a list of NP
(K
a)a
s.
Instances:
hcollapse
,collapse_NP
::NP
(K
a) xs -> [a]hcollapse
,collapse_NS
::NS
(K
a) xs -> ahcollapse
,collapse_POP
::POP
(K
a) xss -> [[a]]hcollapse
,collapse_SOP
::SOP
(K
a) 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 Source #
Methods
hctraverse_ :: (AllN h c xs, Applicative g) => proxy c -> (forall (a :: k). c a => f a -> g ()) -> h f xs -> g () Source #
Corresponds to traverse_
.
Instances:
hctraverse_
,ctraverse__NP
:: (All
c xs ,Applicative
g) => proxy c -> (forall a. c a => f a -> g ()) ->NP
f xs -> g ()hctraverse_
,ctraverse__NS
:: (All2
c xs ,Applicative
g) => proxy c -> (forall a. c a => f a -> g ()) ->NS
f xs -> g ()hctraverse_
,ctraverse__POP
:: (All
c xss,Applicative
g) => proxy c -> (forall a. c a => f a -> g ()) ->POP
f xss -> g ()hctraverse_
,ctraverse__SOP
:: (All2
c xss,Applicative
g) => proxy c -> (forall a. c a => f a -> g ()) ->SOP
f 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 () Source #
Unconstrained version of hctraverse_
.
Instances:
traverse_
,traverse__NP
:: (SListI
xs ,Applicative
g) => (forall a. f a -> g ()) ->NP
f xs -> g ()traverse_
,traverse__NS
:: (SListI
xs ,Applicative
g) => (forall a. f a -> g ()) ->NS
f xs -> g ()traverse_
,traverse__POP
:: (SListI2
xss,Applicative
g) => (forall a. f a -> g ()) ->POP
f xss -> g ()traverse_
,traverse__SOP
:: (SListI2
xss,Applicative
g) => (forall a. f a -> g ()) ->SOP
f xss -> g ()
Since: sop-core-0.3.2.0
Instances
HTraverse_ (SOP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NS | |
HTraverse_ (NS :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NS | |
HTraverse_ (POP :: (k -> Type) -> [[k]] -> Type) | |
Defined in Data.SOP.NP | |
HTraverse_ (NP :: (k -> Type) -> [k] -> Type) | |
Defined in Data.SOP.NP |
hcfoldMap :: (HTraverse_ h, AllN h c xs, Monoid m) => proxy c -> (forall (a :: k). c a => f a -> m) -> h f xs -> m Source #
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 () Source #
Flipped version of hctraverse_
.
Since: sop-core-0.3.2.0
class HAp h => HSequence (h :: (k -> Type) -> l -> Type) where Source #
A generalization of sequenceA
.
Methods
hsequence' :: (SListIN h xs, Applicative f) => h (f :.: g) xs -> f (h g xs) Source #
Corresponds to sequenceA
.
Lifts an applicative functor out of a structure.
Instances:
hsequence'
,sequence'_NP
:: (SListI
xs ,Applicative
f) =>NP
(f:.:
g) xs -> f (NP
g xs )hsequence'
,sequence'_NS
:: (SListI
xs ,Applicative
f) =>NS
(f:.:
g) xs -> f (NS
g xs )hsequence'
,sequence'_POP
:: (SListI2
xss,Applicative
f) =>POP
(f:.:
g) xss -> f (POP
g xss)hsequence'
,sequence'_SOP
:: (SListI2
xss,Applicative
f) =>SOP
(f:.:
g) xss -> f (SOP
g 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) Source #
Corresponds to traverse
.
Instances:
hctraverse'
,ctraverse'_NP
:: (All
c xs ,Applicative
g) => proxy c -> (forall a. c a => f a -> g (f' a)) ->NP
f xs -> g (NP
f' xs )hctraverse'
,ctraverse'_NS
:: (All2
c xs ,Applicative
g) => proxy c -> (forall a. c a => f a -> g (f' a)) ->NS
f xs -> g (NS
f' xs )hctraverse'
,ctraverse'_POP
:: (All
c xss,Applicative
g) => proxy c -> (forall a. c a => f a -> g (f' a)) ->POP
f xss -> g (POP
f' xss)hctraverse'
,ctraverse'_SOP
:: (All2
c xss,Applicative
g) => proxy c -> (forall a. c a => f a -> g (f' a)) ->SOP
f xss -> g (SOP
f' 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) Source #
Unconstrained variant of htraverse'
.
Instances:
htraverse'
,traverse'_NP
:: (SListI
xs ,Applicative
g) => (forall a. c a => f a -> g (f' a)) ->NP
f xs -> g (NP
f' xs )htraverse'
,traverse'_NS
:: (SListI2
xs ,Applicative
g) => (forall a. c a => f a -> g (f' a)) ->NS
f xs -> g (NS
f' xs )htraverse'
,traverse'_POP
:: (SListI
xss,Applicative
g) => (forall a. c a => f a -> g (f' a)) ->POP
f xss -> g (POP
f' xss)htraverse'
,traverse'_SOP
:: (SListI2
xss,Applicative
g) => (forall a. c a => f a -> g (f' a)) ->SOP
f xss -> g (SOP
f' 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) Source # 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) Source # htraverse' :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> SOP f xs -> g (SOP f' xs) Source # | |
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) Source # 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) Source # htraverse' :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> NS f xs -> g (NS f' xs) Source # | |
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) Source # 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) Source # htraverse' :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> POP f xs -> g (POP f' xs) Source # | |
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) Source # 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) Source # htraverse' :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g (f' a)) -> NP f xs -> g (NP f' xs) Source # |
hsequence :: (SListIN h xs, SListIN (Prod h) xs, HSequence h, Applicative f) => h f xs -> f (h I xs) Source #
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) Source #
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) Source #
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) Source #
Flipped version of hctraverse
.
Since: sop-core-0.3.2.0
Expanding sums to products
class HExpand (h :: (k -> Type) -> l -> Type) where Source #
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 Source #
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
::SListI
xs => (forall x . f x) ->NS
f xs ->NP
f xshexpand
,expand_SOP
::SListI2
xss => (forall x . f x) ->SOP
f xss ->POP
f 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 Source #
Variant of hexpand
that allows passing a constrained default.
Instances:
hcexpand
,cexpand_NS
::All
c xs => proxy c -> (forall x . c x => f x) ->NS
f xs ->NP
f xshcexpand
,cexpand_SOP
::All2
c xss => proxy c -> (forall x . c x => f x) ->SOP
f xss ->POP
f 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 Source #
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 Source #
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 => h1 f xs -> h2 g ys Source #
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 Source #
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 Source #
Specialization of hcoerce
.
Since: sop-core-0.3.1.0
Partial operations
fromList :: SListI xs => [a] -> Maybe (NP (K a :: k -> Type) xs) Source #
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 Source #
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 |
Defined in Data.SOP.BasicFunctors | |
NFData2 (K :: Type -> Type -> Type) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
Ord2 (K :: Type -> Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> K a c -> K b d -> Ordering | |
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 |
Defined in Data.SOP.BasicFunctors Methods liftShowsPrec2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> Int -> K a b -> ShowS liftShowList2 :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> (Int -> b -> ShowS) -> ([b] -> ShowS) -> [K a b] -> ShowS | |
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 | |
Traversable (K a :: Type -> Type) | |
Eq a => Eq1 (K a :: Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
NFData a => NFData1 (K a :: Type -> Type) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
Ord a => Ord1 (K a :: Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftCompare :: (a0 -> b -> Ordering) -> K a a0 -> K a b -> Ordering | |
Read a => Read1 (K a :: Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftReadsPrec :: (Int -> ReadS a0) -> ReadS [a0] -> Int -> ReadS (K a a0) liftReadList :: (Int -> ReadS a0) -> ReadS [a0] -> ReadS [K a a0] liftReadPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec (K a a0) liftReadListPrec :: ReadPrec a0 -> ReadPrec [a0] -> ReadPrec [K a a0] | |
Show a => Show1 (K a :: Type -> Type) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> K a a0 -> ShowS liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [K a a0] -> ShowS | |
Eq a => Eq (K a b) | |
Ord a => Ord (K a b) | |
Read a => Read (K a b) | |
Defined in Data.SOP.BasicFunctors | |
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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (K a b) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (K a b) -> DatatypeInfo (Code (K a b)) Source # | |
Generic (K a b) Source # | |
type Rep (K a b) | |
Defined in Data.SOP.BasicFunctors type Rep (K a b) = D1 (MetaData "K" "Data.SOP.BasicFunctors" "sop-core-0.5.0.1-CJJL01S53WkJifrHVaTMB5" True) (C1 (MetaCons "K" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a))) | |
type DatatypeInfoOf (K a b) Source # | |
Defined in Generics.SOP.Instances | |
type Code (K a b) Source # | |
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 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 | |
Traversable I | |
Eq1 I | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors | |
NFData1 I | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
Ord1 I | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftCompare :: (a -> b -> Ordering) -> I a -> I b -> Ordering | |
Read1 I | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (I a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [I a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (I a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [I a] | |
Show1 I | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> I a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [I a] -> ShowS | |
Eq a => Eq (I a) | |
Ord a => Ord (I a) | |
Read a => Read (I a) | |
Defined in Data.SOP.BasicFunctors | |
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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (I a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (I a) -> DatatypeInfo (Code (I a)) Source # | |
Generic (I a) Source # | |
type Rep (I a) | |
Defined in Data.SOP.BasicFunctors type Rep (I a) = D1 (MetaData "I" "Data.SOP.BasicFunctors" "sop-core-0.5.0.1-CJJL01S53WkJifrHVaTMB5" True) (C1 (MetaCons "I" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a))) | |
type DatatypeInfoOf (I a) Source # | |
Defined in Generics.SOP.Instances | |
type Code (I a) Source # | |
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 Source #
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 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 |
Defined in Data.SOP.BasicFunctors | |
(NFData1 f, NFData1 g) => NFData1 (f :.: g) | Since: sop-core-0.2.5.0 |
Defined in Data.SOP.BasicFunctors | |
(Ord1 f, Ord1 g) => Ord1 (f :.: g) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftCompare :: (a -> b -> Ordering) -> (f :.: g) a -> (f :.: g) b -> Ordering | |
(Read1 f, Read1 g) => Read1 (f :.: g) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS ((f :.: g) a) liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [(f :.: g) a] liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec ((f :.: g) a) liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [(f :.: g) a] | |
(Show1 f, Show1 g) => Show1 (f :.: g) | Since: sop-core-0.2.4.0 |
Defined in Data.SOP.BasicFunctors Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> (f :.: g) a -> ShowS liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [(f :.: g) a] -> ShowS | |
(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) | |
Defined in Data.SOP.BasicFunctors | |
(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) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ((f :.: g) p) :: DatatypeInfo Source # Methods datatypeInfo :: proxy ((f :.: g) p) -> DatatypeInfo (Code ((f :.: g) p)) Source # | |
Generic ((f :.: g) p) Source # | |
type Rep ((f :.: g) p) | |
Defined in Data.SOP.BasicFunctors type Rep ((f :.: g) p) = D1 (MetaData ":.:" "Data.SOP.BasicFunctors" "sop-core-0.5.0.1-CJJL01S53WkJifrHVaTMB5" True) (C1 (MetaCons "Comp" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f (g p))))) | |
type DatatypeInfoOf ((f :.: g) p) Source # | |
Defined in Generics.SOP.Instances | |
type Code ((f :.: g) p) Source # | |
Defined in Generics.SOP.Instances |
Mapping functions
mapIII :: (a -> b -> c) -> I a -> I b -> I c Source #
Lift the given function.
Since: sop-core-0.2.5.0
mapIIK :: (a -> b -> c) -> I a -> I b -> K c d Source #
Lift the given function.
Since: sop-core-0.2.5.0
mapIKI :: (a -> b -> c) -> I a -> K b d -> I c Source #
Lift the given function.
Since: sop-core-0.2.5.0
mapIKK :: (a -> b -> c) -> I a -> K b d -> K c e Source #
Lift the given function.
Since: sop-core-0.2.5.0
mapKII :: (a -> b -> c) -> K a d -> I b -> I c Source #
Lift the given function.
Since: sop-core-0.2.5.0
mapKIK :: (a -> b -> c) -> K a d -> I b -> K c e Source #
Lift the given function.
Since: sop-core-0.2.5.0
mapKKI :: (a -> b -> c) -> K a d -> K b e -> I c Source #
Lift the given function.
Since: sop-core-0.2.5.0
mapKKK :: (a -> b -> c) -> K a d -> K b e -> K c f Source #
Lift the given function.
Since: sop-core-0.2.5.0
Mapping constraints
class (AllF c xs, SListI xs) => All (c :: k -> Constraint) (xs :: [k]) Source #
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
(or similar) in the
definition of 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 [] Source # | |
(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) Source # |
type All2 (c :: k -> Constraint) = All (All c) Source #
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 Source #
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 Source #
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]) Source #
Require a constraint 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]]) Source #
Require a constraint 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 Source #
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 Source #
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 Source #
Composition of constraints.
Note that the result of the composition must be a constraint,
and therefore, in
, the kind of Compose
f gf
is k ->
.
The kind of Constraint
g
, however, is l -> k
and can thus be a 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
satisfy 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 Source #
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) Source #
The constraint
is equivalent
to LiftedCoercible
f g x y
.Coercible
(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 ... Source #
Type family that forces a type-level list to be of the same shape as the given type-level list.
Since 0.5.0.0, this only tests the top-level structure of
the list, and is intended to be used in conjunction with
a separate construct (such as the AllZip
, AllZipF
combination to tie the recursive knot). The reason is that
making SameShapeAs
directly recursive leads to quadratic
compile times.
The main use of this constraint is to help type inference to learn something about otherwise unknown type-level lists.
Since: sop-core-0.5.0.0
Equations
SameShapeAs ([] :: [a]) (ys :: [b]) = ys ~ ([] :: [b]) | |
SameShapeAs (x ': xs :: [a1]) (ys :: [a2]) = ys ~ (Head ys ': Tail ys) |
Singletons
data SList (a :: [k]) :: forall k. [k] -> Type where Source #
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) Source #
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) Source #
Require a singleton for every inner list in a list of lists.
sList :: SListI xs => SList xs Source #
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 Source #
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 Source #
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 Source #
Occasionally 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 Source #
The length of a type-level list.
Since: sop-core-0.2
Re-exports
data Proxy (t :: k) :: forall k. k -> Type #
Constructors
Proxy |
Instances
Generic1 (Proxy :: k -> Type) | |
Monad (Proxy :: Type -> Type) | |
Functor (Proxy :: Type -> Type) | |
Applicative (Proxy :: Type -> Type) | |
Foldable (Proxy :: Type -> Type) | |
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 | |
Traversable (Proxy :: Type -> Type) | |
Alternative (Proxy :: Type -> Type) | |
MonadPlus (Proxy :: Type -> Type) | |
Bounded (Proxy t) | |
Defined in Data.Proxy | |
Enum (Proxy s) | |
Defined in Data.Proxy | |
Eq (Proxy s) | |
Data t => Data (Proxy t) | |
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) 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) | |
Read (Proxy t) | |
Defined in Data.Proxy | |
Show (Proxy s) | |
Ix (Proxy s) | |
Generic (Proxy t) | |
Semigroup (Proxy s) | |
Monoid (Proxy s) | |
HasDatatypeInfo (Proxy t) Source # | |
Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Proxy t) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Proxy t) -> DatatypeInfo (Code (Proxy t)) Source # | |
Generic (Proxy t) Source # | |
type Rep1 (Proxy :: k -> Type) | |
Defined in GHC.Generics type Rep1 (Proxy :: k -> Type) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: k -> Type)) | |
type Rep (Proxy t) | |
Defined in GHC.Generics type Rep (Proxy t) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: Type -> Type)) | |
type DatatypeInfoOf (Proxy t) Source # | |
Defined in Generics.SOP.Instances type DatatypeInfoOf (Proxy t) = ADT "Data.Proxy" "Proxy" (Constructor "Proxy" ': ([] :: [ConstructorInfo])) (([] :: [StrictnessInfo]) ': ([] :: [[StrictnessInfo]])) | |
type Code (Proxy t) Source # | |
Defined in Generics.SOP.Instances |