Safe Haskell	None
Language	Haskell2010

Generics.SOP

Contents

Codes and interpretations
n-ary datatypes
Metadata
Combinators
Utilities

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 (called NP).
The library captures the notion of a datatype being representable in the following way. There is a class Generic, which for a given datatype A, associates the isomorphic SOP representation with the original type under the name Rep A. The class also provides functions from and to that convert between A and Rep A and witness the isomorphism.
Since all Rep types are sums of products, you can define functions over them by performing induction on the structure, of by using predefined combinators that the library provides. Such functions then work for all Rep types.
By combining the conversion functions from and to with the function that works on Rep types, we obtain a function that works on all types that are in the Generic 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 the Generic class from module GHC.Generics, then an instance of the SOP Generic can automatically be derived. There is also Template Haskell code in Generics.SOP.TH that allows to auto-generate an instance of Generic 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 Rep A (and between B and Rep B). For example,

>>> 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 Rep A, have a look at the Generics.SOP.Universe module.

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 -> ()
grnfP Nil         = ()
grnfP (I x :* xs) = x `deepseq` (grnfP xs)

The grnf function performs the conversion between a and Rep a by applying from and then applies grnfS. The type of grnf indicates that a must be in the Generic class so that we can apply from, and that all the components of a (i.e., all the types that occur as constructor arguments) must be in the NFData class (All2).

The function grnfS traverses the outer sum structure of the sum of products (note that Rep a = SOP I (Code a)). It encodes which constructor was used to construct the original argument of type 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 (K ()). A homogeneous structure can be collapsed (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 :: *) where
- type Code a :: [[*]]
type Rep a = SOP I (Code a)
type IsProductType (a :: *) (xs :: [*]) = (Generic a, Code a ~ '[xs])
type IsEnumType (a :: *) = (Generic a, All ((~) '[]) (Code a))
type IsWrappedType (a :: *) (x :: *) = (Generic a, Code a ~ '['[x]])
type IsNewtype (a :: *) (x :: *) = (IsWrappedType a x, Coercible a x)
data NP :: (k -> *) -> [k] -> * where
- Nil :: NP f '[]
- (:*) :: f x -> NP f xs -> NP f (x ': xs)
data NS :: (k -> *) -> [k] -> * where
- Z :: f x -> NS f (x ': xs)
- S :: NS f xs -> NS f (x ': xs)
newtype SOP (f :: k -> *) (xss :: [[k]]) = SOP (NS (NP f) xss)
unSOP :: SOP f xss -> NS (NP f) xss
newtype POP (f :: k -> *) (xss :: [[k]]) = POP (NP (NP f) xss)
unPOP :: POP f xss -> NP (NP f) xss
data DatatypeInfo :: [[*]] -> * where
- ADT :: ModuleName -> DatatypeName -> NP ConstructorInfo xss -> DatatypeInfo xss
- Newtype :: ModuleName -> DatatypeName -> ConstructorInfo '[x] -> DatatypeInfo '['[x]]
moduleName :: DatatypeInfo xss -> ModuleName
datatypeName :: DatatypeInfo xss -> DatatypeName
constructorInfo :: DatatypeInfo xss -> NP ConstructorInfo xss
data ConstructorInfo :: [*] -> * 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 :: * -> * where
- FieldInfo :: FieldName -> FieldInfo a
fieldName :: FieldInfo a -> FieldName
class HasDatatypeInfo a where
- type DatatypeInfoOf a :: DatatypeInfo
type DatatypeName = String
type ModuleName = String
type ConstructorName = String
type FieldName = String
data Associativity
- = LeftAssociative
- | RightAssociative
- | NotAssociative
type Fixity = Int
class HPure (h :: (k -> *) -> l -> *) where
hd :: NP f (x ': xs) -> f x
tl :: NP f (x ': xs) -> NP f xs
type Projection (f :: k -> *) (xs :: [k]) = K (NP f xs) -.-> f
projections :: forall xs f. SListI xs => NP (Projection f xs) xs
shiftProjection :: Projection f xs a -> Projection f (x ': xs) a
newtype (f -.-> g) a = 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 -> *) -> l -> *) :: (k -> *) -> l -> *
class (Prod (Prod h) ~ Prod h, HPure (Prod h)) => HAp (h :: (k -> *) -> l -> *) where
hliftA :: (SListIN (Prod h) xs, HAp h) => (forall a. f a -> f' a) -> h f xs -> h f' xs
hliftA2 :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall a. 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. 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. 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. 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. 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. f a -> f' a) -> h f xs -> h f' xs
hzipWith :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall a. 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. 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. 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. 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. 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 -> *) (xs :: [k]) = f -.-> K (NS f xs)
injections :: forall xs f. SListI xs => NP (Injection f xs) xs
shift :: Injection f xs a -> Injection f (x ': xs) a
shiftInjection :: Injection f xs a -> Injection f (x ': xs) a
type family UnProd (h :: (k -> *) -> l -> *) :: (k -> *) -> l -> *
class UnProd (Prod h) ~ h => HApInjs (h :: (k -> *) -> l -> *) 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] -> f x
class HIndex (h :: (k -> *) -> l -> *) where
hcliftA' :: (All2 c xss, Prod h ~ NP, HAp h) => proxy c -> (forall xs. All c xs => f xs -> f' xs) -> h f xss -> h f' xss
hcliftA2' :: (All2 c xss, Prod h ~ NP, HAp h) => proxy c -> (forall xs. 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, HAp h) => proxy c -> (forall xs. 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 :: forall r f g xs. r -> (forall x. f x -> g x -> r) -> r -> NS f xs -> NS g xs -> r
ccompare_NS :: forall c proxy r f g xs. All c xs => proxy c -> r -> (forall x. c x => f x -> g x -> r) -> r -> NS f xs -> NS g xs -> r
compare_SOP :: forall r f g xss. r -> (forall xs. NP f xs -> NP g xs -> r) -> r -> SOP f xss -> SOP g xss -> r
ccompare_SOP :: forall c proxy r f g xss. All2 c xss => proxy c -> r -> (forall xs. All c xs => NP f xs -> NP g xs -> r) -> r -> SOP f xss -> SOP g xss -> r
type family CollapseTo (h :: (k -> *) -> l -> *) (x :: *) :: *
class HCollapse (h :: (k -> *) -> l -> *) where
class HTraverse_ (h :: (k -> *) -> l -> *) where
hcfoldMap :: (HTraverse_ h, AllN h c xs, Monoid m) => proxy c -> (forall a. 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. c a => f a -> g ()) -> g ()
class HAp h => HSequence (h :: (k -> *) -> l -> *) where
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)) xs -> f (h (K a) 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 -> *) -> l -> *) where
class (Same h1 ~ h2, Same h2 ~ h1) => HTrans (h1 :: (k1 -> *) -> l1 -> *) (h2 :: (k2 -> *) -> l2 -> *) 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) xs)
newtype K (a :: *) (b :: k) = K a
unK :: K a b -> a
newtype I (a :: *) = I a
unI :: I a -> a
newtype ((f :: l -> *) :.: (g :: k -> l)) (p :: k) = 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 f xs, SListI xs) => All (f :: k -> Constraint) (xs :: [k])
class (AllF (All f) xss, SListI xss) => All2 f xss
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 xss yss
type family AllN (h :: (k -> *) -> l -> *) (c :: k -> Constraint) :: l -> Constraint
type family AllZipN (h :: (k -> *) -> l -> *) (c :: k1 -> k2 -> Constraint) :: l1 -> l2 -> Constraint
class f (g x) => Compose f g x
class (f x, g x) => And f g x
class Top x
class Coercible (f x) (g y) => LiftedCoercible f g x y
type family SameShapeAs (xs :: [a]) (ys :: [b]) :: Constraint where ...
data SList :: [k] -> * where
- SNil :: SList '[]
- SCons :: SListI xs => SList (x ': xs)
class SListI (xs :: [k]) where
type SListI2 = All SListI
type Sing = SList
class SListI xs => SingI (xs :: [k]) where
data Shape :: [k] -> * where
- ShapeNil :: Shape '[]
- ShapeCons :: SListI xs => Shape xs -> Shape (x ': xs)
shape :: forall (xs :: [k]). SListI xs => Shape xs
lengthSList :: forall (xs :: [k]) proxy. SListI xs => proxy xs -> Int
lengthSing :: SListI xs => proxy xs -> Int
data Proxy (t :: k) :: forall k. k -> * = Proxy

Codes and interpretations

class All SListI (Code a) => Generic (a :: *) 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 are datatype are specified using the Code type family.

The isomorphism between the original Haskell datatype and its representation is witnessed by the methods of this class, from and to. So for instances of this class, the following laws should (in general) hold:

to . from === id :: a -> a
from . 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, ...)

instance Generic T -- empty
instance HasDatatypeInfo 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 -- derives HasDatatypeInfo 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.

Associated Types

type Code a :: [[*]] 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

from :: a -> Rep a Source #

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.

to :: Rep a -> a Source #

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 #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Bool :: [[*]] Source # Methods from :: Bool -> Rep Bool Source # to :: Rep Bool -> Bool Source #
Generic Ordering Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Ordering :: [[*]] Source # Methods from :: Ordering -> Rep Ordering Source # to :: Rep Ordering -> Ordering Source #
Generic () Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code () :: [[*]] Source # Methods from :: () -> Rep () Source # to :: Rep () -> () Source #
Generic DataRep Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code DataRep :: [[*]] Source # Methods from :: DataRep -> Rep DataRep Source # to :: Rep DataRep -> DataRep Source #
Generic ConstrRep Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code ConstrRep :: [[*]] Source # Methods from :: ConstrRep -> Rep ConstrRep Source # to :: Rep ConstrRep -> ConstrRep Source #
Generic Fixity Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Fixity :: [[*]] Source # Methods from :: Fixity -> Rep Fixity Source # to :: Rep Fixity -> Fixity Source #
Generic FormatAdjustment Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code FormatAdjustment :: [[*]] Source # Methods from :: FormatAdjustment -> Rep FormatAdjustment Source # to :: Rep FormatAdjustment -> FormatAdjustment Source #
Generic FormatSign Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code FormatSign :: [[*]] Source # Methods from :: FormatSign -> Rep FormatSign Source # to :: Rep FormatSign -> FormatSign Source #
Generic FieldFormat Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code FieldFormat :: [[*]] Source # Methods from :: FieldFormat -> Rep FieldFormat Source # to :: Rep FieldFormat -> FieldFormat Source #
Generic FormatParse Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code FormatParse :: [[*]] Source # Methods from :: FormatParse -> Rep FormatParse Source # to :: Rep FormatParse -> FormatParse Source #
Generic Version Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Version :: [[*]] Source # Methods from :: Version -> Rep Version Source # to :: Rep Version -> Version Source #
Generic PatternMatchFail Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code PatternMatchFail :: [[*]] Source # Methods from :: PatternMatchFail -> Rep PatternMatchFail Source # to :: Rep PatternMatchFail -> PatternMatchFail Source #
Generic RecSelError Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code RecSelError :: [[*]] Source # Methods from :: RecSelError -> Rep RecSelError Source # to :: Rep RecSelError -> RecSelError Source #
Generic RecConError Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code RecConError :: [[*]] Source # Methods from :: RecConError -> Rep RecConError Source # to :: Rep RecConError -> RecConError Source #
Generic RecUpdError Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code RecUpdError :: [[*]] Source # Methods from :: RecUpdError -> Rep RecUpdError Source # to :: Rep RecUpdError -> RecUpdError Source #
Generic NoMethodError Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code NoMethodError :: [[*]] Source # Methods from :: NoMethodError -> Rep NoMethodError Source # to :: Rep NoMethodError -> NoMethodError Source #
Generic NonTermination Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code NonTermination :: [[*]] Source # Methods from :: NonTermination -> Rep NonTermination Source # to :: Rep NonTermination -> NonTermination Source #
Generic NestedAtomically Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code NestedAtomically :: [[*]] Source # Methods from :: NestedAtomically -> Rep NestedAtomically Source # to :: Rep NestedAtomically -> NestedAtomically Source #
Generic Errno Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Errno :: [[*]] Source # Methods from :: Errno -> Rep Errno Source # to :: Rep Errno -> Errno Source #
Generic BlockedIndefinitelyOnMVar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code BlockedIndefinitelyOnMVar :: [[*]] Source # Methods from :: BlockedIndefinitelyOnMVar -> Rep BlockedIndefinitelyOnMVar Source # to :: Rep BlockedIndefinitelyOnMVar -> BlockedIndefinitelyOnMVar Source #
Generic BlockedIndefinitelyOnSTM Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code BlockedIndefinitelyOnSTM :: [[*]] Source # Methods from :: BlockedIndefinitelyOnSTM -> Rep BlockedIndefinitelyOnSTM Source # to :: Rep BlockedIndefinitelyOnSTM -> BlockedIndefinitelyOnSTM Source #
Generic Deadlock Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Deadlock :: [[*]] Source # Methods from :: Deadlock -> Rep Deadlock Source # to :: Rep Deadlock -> Deadlock Source #
Generic AssertionFailed Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code AssertionFailed :: [[*]] Source # Methods from :: AssertionFailed -> Rep AssertionFailed Source # to :: Rep AssertionFailed -> AssertionFailed Source #
Generic AsyncException Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code AsyncException :: [[*]] Source # Methods from :: AsyncException -> Rep AsyncException Source # to :: Rep AsyncException -> AsyncException Source #
Generic ArrayException Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code ArrayException :: [[*]] Source # Methods from :: ArrayException -> Rep ArrayException Source # to :: Rep ArrayException -> ArrayException Source #
Generic ExitCode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code ExitCode :: [[*]] Source # Methods from :: ExitCode -> Rep ExitCode Source # to :: Rep ExitCode -> ExitCode Source #
Generic BufferMode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code BufferMode :: [[*]] Source # Methods from :: BufferMode -> Rep BufferMode Source # to :: Rep BufferMode -> BufferMode Source #
Generic Newline Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Newline :: [[*]] Source # Methods from :: Newline -> Rep Newline Source # to :: Rep Newline -> Newline Source #
Generic NewlineMode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code NewlineMode :: [[*]] Source # Methods from :: NewlineMode -> Rep NewlineMode Source # to :: Rep NewlineMode -> NewlineMode Source #
Generic SeekMode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code SeekMode :: [[*]] Source # Methods from :: SeekMode -> Rep SeekMode Source # to :: Rep SeekMode -> SeekMode Source #
Generic MaskingState Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code MaskingState :: [[*]] Source # Methods from :: MaskingState -> Rep MaskingState Source # to :: Rep MaskingState -> MaskingState Source #
Generic IOException Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code IOException :: [[*]] Source # Methods from :: IOException -> Rep IOException Source # to :: Rep IOException -> IOException Source #
Generic ErrorCall Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code ErrorCall :: [[*]] Source # Methods from :: ErrorCall -> Rep ErrorCall Source # to :: Rep ErrorCall -> ErrorCall Source #
Generic ArithException Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code ArithException :: [[*]] Source # Methods from :: ArithException -> Rep ArithException Source # to :: Rep ArithException -> ArithException Source #
Generic All Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code All :: [[*]] Source # Methods from :: All -> Rep All Source # to :: Rep All -> All Source #
Generic Any Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Any :: [[*]] Source # Methods from :: Any -> Rep Any Source # to :: Rep Any -> Any Source #
Generic CChar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CChar :: [[*]] Source # Methods from :: CChar -> Rep CChar Source # to :: Rep CChar -> CChar Source #
Generic CSChar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CSChar :: [[*]] Source # Methods from :: CSChar -> Rep CSChar Source # to :: Rep CSChar -> CSChar Source #
Generic CUChar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CUChar :: [[*]] Source # Methods from :: CUChar -> Rep CUChar Source # to :: Rep CUChar -> CUChar Source #
Generic CShort Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CShort :: [[*]] Source # Methods from :: CShort -> Rep CShort Source # to :: Rep CShort -> CShort Source #
Generic CUShort Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CUShort :: [[*]] Source # Methods from :: CUShort -> Rep CUShort Source # to :: Rep CUShort -> CUShort Source #
Generic CInt Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CInt :: [[*]] Source # Methods from :: CInt -> Rep CInt Source # to :: Rep CInt -> CInt Source #
Generic CUInt Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CUInt :: [[*]] Source # Methods from :: CUInt -> Rep CUInt Source # to :: Rep CUInt -> CUInt Source #
Generic CLong Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CLong :: [[*]] Source # Methods from :: CLong -> Rep CLong Source # to :: Rep CLong -> CLong Source #
Generic CULong Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CULong :: [[*]] Source # Methods from :: CULong -> Rep CULong Source # to :: Rep CULong -> CULong Source #
Generic CLLong Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CLLong :: [[*]] Source # Methods from :: CLLong -> Rep CLLong Source # to :: Rep CLLong -> CLLong Source #
Generic CULLong Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CULLong :: [[*]] Source # Methods from :: CULLong -> Rep CULLong Source # to :: Rep CULLong -> CULLong Source #
Generic CFloat Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CFloat :: [[*]] Source # Methods from :: CFloat -> Rep CFloat Source # to :: Rep CFloat -> CFloat Source #
Generic CDouble Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CDouble :: [[*]] Source # Methods from :: CDouble -> Rep CDouble Source # to :: Rep CDouble -> CDouble Source #
Generic CPtrdiff Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CPtrdiff :: [[*]] Source # Methods from :: CPtrdiff -> Rep CPtrdiff Source # to :: Rep CPtrdiff -> CPtrdiff Source #
Generic CSize Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CSize :: [[*]] Source # Methods from :: CSize -> Rep CSize Source # to :: Rep CSize -> CSize Source #
Generic CWchar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CWchar :: [[*]] Source # Methods from :: CWchar -> Rep CWchar Source # to :: Rep CWchar -> CWchar Source #
Generic CSigAtomic Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CSigAtomic :: [[*]] Source # Methods from :: CSigAtomic -> Rep CSigAtomic Source # to :: Rep CSigAtomic -> CSigAtomic Source #
Generic CClock Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CClock :: [[*]] Source # Methods from :: CClock -> Rep CClock Source # to :: Rep CClock -> CClock Source #
Generic CTime Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CTime :: [[*]] Source # Methods from :: CTime -> Rep CTime Source # to :: Rep CTime -> CTime Source #
Generic CUSeconds Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CUSeconds :: [[*]] Source # Methods from :: CUSeconds -> Rep CUSeconds Source # to :: Rep CUSeconds -> CUSeconds Source #
Generic CSUSeconds Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CSUSeconds :: [[*]] Source # Methods from :: CSUSeconds -> Rep CSUSeconds Source # to :: Rep CSUSeconds -> CSUSeconds Source #
Generic CIntPtr Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CIntPtr :: [[*]] Source # Methods from :: CIntPtr -> Rep CIntPtr Source # to :: Rep CIntPtr -> CIntPtr Source #
Generic CUIntPtr Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CUIntPtr :: [[*]] Source # Methods from :: CUIntPtr -> Rep CUIntPtr Source # to :: Rep CUIntPtr -> CUIntPtr Source #
Generic CIntMax Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CIntMax :: [[*]] Source # Methods from :: CIntMax -> Rep CIntMax Source # to :: Rep CIntMax -> CIntMax Source #
Generic CUIntMax Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code CUIntMax :: [[*]] Source # Methods from :: CUIntMax -> Rep CUIntMax Source # to :: Rep CUIntMax -> CUIntMax Source #
Generic IOMode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code IOMode :: [[*]] Source # Methods from :: IOMode -> Rep IOMode Source # to :: Rep IOMode -> IOMode Source #
Generic Lexeme Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Lexeme :: [[*]] Source # Methods from :: Lexeme -> Rep Lexeme Source # to :: Rep Lexeme -> Lexeme Source #
Generic Number Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code Number :: [[*]] Source # Methods from :: Number -> Rep Number Source # to :: Rep Number -> Number Source #
Generic GeneralCategory Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code GeneralCategory :: [[*]] Source # Methods from :: GeneralCategory -> Rep GeneralCategory Source # to :: Rep GeneralCategory -> GeneralCategory Source #
Generic [a] Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code [a] :: [[*]] Source # Methods from :: [a] -> Rep [a] Source # to :: Rep [a] -> [a] Source #
Generic (Maybe a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Maybe a) :: [[*]] Source # Methods from :: Maybe a -> Rep (Maybe a) Source # to :: Rep (Maybe a) -> Maybe a Source #
Generic (Complex a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Complex a) :: [[*]] Source # Methods from :: Complex a -> Rep (Complex a) Source # to :: Rep (Complex a) -> Complex a Source #
Generic (Fixed a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Fixed a) :: [[*]] Source # Methods from :: Fixed a -> Rep (Fixed a) Source # to :: Rep (Fixed a) -> Fixed a Source #
Generic (ArgOrder a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (ArgOrder a) :: [[*]] Source # Methods from :: ArgOrder a -> Rep (ArgOrder a) Source # to :: Rep (ArgOrder a) -> ArgOrder a Source #
Generic (OptDescr a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (OptDescr a) :: [[*]] Source # Methods from :: OptDescr a -> Rep (OptDescr a) Source # to :: Rep (OptDescr a) -> OptDescr a Source #
Generic (ArgDescr a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (ArgDescr a) :: [[*]] Source # Methods from :: ArgDescr a -> Rep (ArgDescr a) Source # to :: Rep (ArgDescr a) -> ArgDescr a Source #
Generic (First a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (First a) :: [[*]] Source # Methods from :: First a -> Rep (First a) Source # to :: Rep (First a) -> First a Source #
Generic (Last a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Last a) :: [[*]] Source # Methods from :: Last a -> Rep (Last a) Source # to :: Rep (Last a) -> Last a Source #
Generic (Dual a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Dual a) :: [[*]] Source # Methods from :: Dual a -> Rep (Dual a) Source # to :: Rep (Dual a) -> Dual a Source #
Generic (Endo a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Endo a) :: [[*]] Source # Methods from :: Endo a -> Rep (Endo a) Source # to :: Rep (Endo a) -> Endo a Source #
Generic (Sum a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Sum a) :: [[*]] Source # Methods from :: Sum a -> Rep (Sum a) Source # to :: Rep (Sum a) -> Sum a Source #
Generic (Product a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Product a) :: [[*]] Source # Methods from :: Product a -> Rep (Product a) Source # to :: Rep (Product a) -> Product a Source #
Generic (Down a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Down a) :: [[*]] Source # Methods from :: Down a -> Rep (Down a) Source # to :: Rep (Down a) -> Down a Source #
Generic (I a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (I a) :: [[*]] Source # Methods from :: I a -> Rep (I a) Source # to :: Rep (I a) -> I a Source #
Generic (Either a b) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Either a b) :: [[*]] Source # Methods from :: Either a b -> Rep (Either a b) Source # to :: Rep (Either a b) -> Either a b Source #
Generic (a, b) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b) :: [[*]] Source # Methods from :: (a, b) -> Rep (a, b) Source # to :: Rep (a, b) -> (a, b) Source #
Generic (Proxy t) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Proxy t) :: [[*]] Source # Methods from :: Proxy t -> Rep (Proxy t) Source # to :: Rep (Proxy t) -> Proxy t Source #
Generic (a, b, c) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c) :: [[*]] Source # Methods from :: (a, b, c) -> Rep (a, b, c) Source # to :: Rep (a, b, c) -> (a, b, c) Source #
Generic (K a b) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (K a b) :: [[*]] Source # Methods from :: K a b -> Rep (K a b) Source # to :: Rep (K a b) -> K a b Source #
Generic (a, b, c, d) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d) :: [[*]] Source # Methods from :: (a, b, c, d) -> Rep (a, b, c, d) Source # to :: Rep (a, b, c, d) -> (a, b, c, d) Source #
Generic (a, b, c, d, e) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e) :: [[*]] Source # Methods from :: (a, b, c, d, e) -> Rep (a, b, c, d, e) Source # to :: Rep (a, b, c, d, e) -> (a, b, c, d, e) Source #
Generic ((f :.: g) p) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code ((f :.: g) p) :: [[*]] Source # Methods from :: (f :.: g) p -> Rep ((f :.: g) p) Source # to :: Rep ((f :.: g) p) -> (f :.: g) p Source #
Generic (a, b, c, d, e, f) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f) :: [[*]] Source # Methods from :: (a, b, c, d, e, f) -> Rep (a, b, c, d, e, f) Source # to :: Rep (a, b, c, d, e, f) -> (a, b, c, d, e, f) Source #
Generic (a, b, c, d, e, f, g) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g) -> Rep (a, b, c, d, e, f, g) Source # to :: Rep (a, b, c, d, e, f, g) -> (a, b, c, d, e, f, g) Source #
Generic (a, b, c, d, e, f, g, h) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h) -> Rep (a, b, c, d, e, f, g, h) Source # to :: Rep (a, b, c, d, e, f, g, h) -> (a, b, c, d, e, f, g, h) Source #
Generic (a, b, c, d, e, f, g, h, i) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i) -> Rep (a, b, c, d, e, f, g, h, i) Source # to :: Rep (a, b, c, d, e, f, g, h, i) -> (a, b, c, d, e, f, g, h, i) Source #
Generic (a, b, c, d, e, f, g, h, i, j) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j) -> Rep (a, b, c, d, e, f, g, h, i, j) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j) -> (a, b, c, d, e, f, g, h, i, j) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k) -> Rep (a, b, c, d, e, f, g, h, i, j, k) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k) -> (a, b, c, d, e, f, g, h, i, j, k) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l) -> (a, b, c, d, e, f, g, h, i, j, k, l) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m) -> (a, b, c, d, e, f, g, h, i, j, k, l, m) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) Source #
Instance details 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) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) Source #
Instance details 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) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) Source #
Instance details 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) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) Source #
Instance details 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) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) Source #
Instance details 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) :: [[*]] Source # Methods from :: (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) -> Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) Source # to :: Rep (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) -> (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t) Source #
Generic (a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u) Source #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 #
Instance details 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) :: [[*]] 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 Rep a = SOP I (Code a) Source #

The (generic) representation of a datatype.

A datatype is isomorphic to the sum-of-products of its code. The isomorphism is witnessed by from and to from the Generic class.

type IsProductType (a :: *) (xs :: [*]) = (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 IsEnumType (a :: *) = (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

type IsWrappedType (a :: *) (x :: *) = (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 IsNewtype (a :: *) (x :: *) = (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

n-ary datatypes

data NP :: (k -> *) -> [k] -> * 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 K a, 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.

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 :: NP f '[]
(:*) :: f x -> NP f xs -> NP f (x ': xs) infixr 5

Instances

HTrans (NP :: (k1 -> ) -> [k1] -> ) (NP :: (k2 -> ) -> [k2] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods htrans :: AllZipN (Prod NP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> NP f xs -> NP g ys Source # hcoerce :: (AllZipN (Prod NP) (LiftedCoercible f g) xs ys, HTrans NP NP) => NP f xs -> NP g ys Source #
HSequence (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.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 #
HTraverse_ (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hctraverse_ :: (AllN NP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NP f xs -> g () Source # htraverse_ :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NP f xs -> g () Source #
HCollapse (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hcollapse :: SListIN NP xs => NP (K a) xs -> CollapseTo NP a Source #
HAp (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hap :: Prod NP (f -.-> g) xs -> NP f xs -> NP g xs Source #
HPure (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hpure :: SListIN NP xs => (forall (a :: k0). f a) -> NP f xs Source # hcpure :: AllN NP c xs => proxy c -> (forall (a :: k0). c a => f a) -> NP f xs Source #
All (Compose Eq f) xs => Eq (NP f xs) Source #
Instance details Defined in Generics.SOP.NP Methods (==) :: NP f xs -> NP f xs -> Bool # (/=) :: NP f xs -> NP f xs -> Bool #
(All (Compose Eq f) xs, All (Compose Ord f) xs) => Ord (NP f xs) Source #
Instance details Defined in Generics.SOP.NP Methods compare :: NP f xs -> NP f xs -> Ordering # (<) :: NP f xs -> NP f xs -> Bool # (<=) :: NP f xs -> NP f xs -> Bool # (>) :: NP f xs -> NP f xs -> Bool # (>=) :: NP f xs -> NP f xs -> Bool # max :: NP f xs -> NP f xs -> NP f xs # min :: NP f xs -> NP f xs -> NP f xs #
All (Compose Show f) xs => Show (NP f xs) Source #
Instance details Defined in Generics.SOP.NP Methods showsPrec :: Int -> NP f xs -> ShowS # show :: NP f xs -> String # showList :: [NP f xs] -> ShowS #
All (Compose NFData f) xs => NFData (NP f xs) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.NP Methods rnf :: NP f xs -> () #
type AllZipN (NP :: (k -> ) -> [k] -> ) (c :: a -> b -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllZipN (NP :: (k -> ) -> [k] -> ) (c :: a -> b -> Constraint) = AllZip c
type Same (NP :: (k1 -> ) -> [k1] -> ) Source #
Instance details Defined in Generics.SOP.NP type Same (NP :: (k1 -> ) -> [k1] -> ) = (NP :: (k2 -> ) -> [k2] -> )
type SListIN (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP type SListIN (NP :: (k -> ) -> [k] -> ) = (SListI :: [k] -> Constraint)
type UnProd (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type UnProd (NP :: (k -> ) -> [k] -> ) = (NS :: (k -> ) -> [k] -> )
type Prod (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP type Prod (NP :: (k -> ) -> [k] -> ) = (NP :: (k -> ) -> [k] -> )
type AllN (NP :: (k -> ) -> [k] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllN (NP :: (k -> ) -> [k] -> ) (c :: k -> Constraint) = All c
type CollapseTo (NP :: (k -> ) -> [k] -> ) a Source #
Instance details Defined in Generics.SOP.NP type CollapseTo (NP :: (k -> ) -> [k] -> ) a = [a]

data NS :: (k -> *) -> [k] -> * 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 K a, 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.

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 :: f x -> NS f (x ': xs)
S :: NS f xs -> NS f (x ': xs)

Instances

HTrans (NS :: (k1 -> ) -> [k1] -> ) (NS :: (k2 -> ) -> [k2] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods htrans :: AllZipN (Prod NS) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> NS f xs -> NS g ys Source # hcoerce :: (AllZipN (Prod NS) (LiftedCoercible f g) xs ys, HTrans NS NS) => NS f xs -> NS g ys Source #
HExpand (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hexpand :: SListIN (Prod NS) xs => (forall (x :: k0). f x) -> NS f xs -> Prod NS f xs Source # hcexpand :: AllN (Prod NS) c xs => proxy c -> (forall (x :: k0). c x => f x) -> NS f xs -> Prod NS f xs Source #
HApInjs (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hapInjs :: SListIN NS xs => Prod NS f xs -> [NS f xs] Source #
HIndex (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hindex :: NS f xs -> Int Source #
HSequence (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.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 #
HTraverse_ (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hctraverse_ :: (AllN NS c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NS f xs -> g () Source # htraverse_ :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NS f xs -> g () Source #
HCollapse (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hcollapse :: SListIN NS xs => NS (K a) xs -> CollapseTo NS a Source #
HAp (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hap :: Prod NS (f -.-> g) xs -> NS f xs -> NS g xs Source #
All (Compose Eq f) xs => Eq (NS f xs) Source #
Instance details Defined in Generics.SOP.NS Methods (==) :: NS f xs -> NS f xs -> Bool # (/=) :: NS f xs -> NS f xs -> Bool #
(All (Compose Eq f) xs, All (Compose Ord f) xs) => Ord (NS f xs) Source #
Instance details Defined in Generics.SOP.NS Methods compare :: NS f xs -> NS f xs -> Ordering # (<) :: NS f xs -> NS f xs -> Bool # (<=) :: NS f xs -> NS f xs -> Bool # (>) :: NS f xs -> NS f xs -> Bool # (>=) :: NS f xs -> NS f xs -> Bool # max :: NS f xs -> NS f xs -> NS f xs # min :: NS f xs -> NS f xs -> NS f xs #
All (Compose Show f) xs => Show (NS f xs) Source #
Instance details Defined in Generics.SOP.NS Methods showsPrec :: Int -> NS f xs -> ShowS # show :: NS f xs -> String # showList :: [NS f xs] -> ShowS #
All (Compose NFData f) xs => NFData (NS f xs) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.NS Methods rnf :: NS f xs -> () #
type Same (NS :: (k1 -> ) -> [k1] -> ) Source #
Instance details Defined in Generics.SOP.NS type Same (NS :: (k1 -> ) -> [k1] -> ) = (NS :: (k2 -> ) -> [k2] -> )
type SListIN (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type SListIN (NS :: (k -> ) -> [k] -> ) = (SListI :: [k] -> Constraint)
type Prod (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type Prod (NS :: (k -> ) -> [k] -> ) = (NP :: (k -> ) -> [k] -> )
type AllN (NS :: (k -> ) -> [k] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NS type AllN (NS :: (k -> ) -> [k] -> ) (c :: k -> Constraint) = All c
type CollapseTo (NS :: (k -> ) -> [k] -> ) a Source #
Instance details Defined in Generics.SOP.NS type CollapseTo (NS :: (k -> ) -> [k] -> ) a = a

newtype SOP (f :: k -> *) (xss :: [[k]]) 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.

An SOP I 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.

Constructors

SOP (NS (NP f) xss)

Instances

HTrans (SOP :: (k1 -> ) -> [[k1]] -> ) (SOP :: (k2 -> ) -> [[k2]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods htrans :: AllZipN (Prod SOP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> SOP f xs -> SOP g ys Source # hcoerce :: (AllZipN (Prod SOP) (LiftedCoercible f g) xs ys, HTrans SOP SOP) => SOP f xs -> SOP g ys Source #
HExpand (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hexpand :: SListIN (Prod SOP) xs => (forall (x :: k0). f x) -> SOP f xs -> Prod SOP f xs Source # hcexpand :: AllN (Prod SOP) c xs => proxy c -> (forall (x :: k0). c x => f x) -> SOP f xs -> Prod SOP f xs Source #
HApInjs (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hapInjs :: SListIN SOP xs => Prod SOP f xs -> [SOP f xs] Source #
HIndex (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hindex :: SOP f xs -> Int Source #
HSequence (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.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 #
HTraverse_ (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hctraverse_ :: (AllN SOP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> SOP f xs -> g () Source # htraverse_ :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> SOP f xs -> g () Source #
HCollapse (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hcollapse :: SListIN SOP xs => SOP (K a) xs -> CollapseTo SOP a Source #
HAp (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hap :: Prod SOP (f -.-> g) xs -> SOP f xs -> SOP g xs Source #
Eq (NS (NP f) xss) => Eq (SOP f xss) Source #
Instance details Defined in Generics.SOP.NS Methods (==) :: SOP f xss -> SOP f xss -> Bool # (/=) :: SOP f xss -> SOP f xss -> Bool #
Ord (NS (NP f) xss) => Ord (SOP f xss) Source #
Instance details Defined in Generics.SOP.NS Methods compare :: SOP f xss -> SOP f xss -> Ordering # (<) :: SOP f xss -> SOP f xss -> Bool # (<=) :: SOP f xss -> SOP f xss -> Bool # (>) :: SOP f xss -> SOP f xss -> Bool # (>=) :: SOP f xss -> SOP f xss -> Bool # max :: SOP f xss -> SOP f xss -> SOP f xss # min :: SOP f xss -> SOP f xss -> SOP f xss #
Show (NS (NP f) xss) => Show (SOP f xss) Source #
Instance details Defined in Generics.SOP.NS Methods showsPrec :: Int -> SOP f xss -> ShowS # show :: SOP f xss -> String # showList :: [SOP f xss] -> ShowS #
NFData (NS (NP f) xss) => NFData (SOP f xss) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.NS Methods rnf :: SOP f xss -> () #
type Same (SOP :: (k1 -> ) -> [[k1]] -> ) Source #
Instance details Defined in Generics.SOP.NS type Same (SOP :: (k1 -> ) -> [[k1]] -> ) = (SOP :: (k2 -> ) -> [[k2]] -> )
type SListIN (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type SListIN (SOP :: (k -> ) -> [[k]] -> ) = (SListI2 :: [[k]] -> Constraint)
type Prod (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type Prod (SOP :: (k -> ) -> [[k]] -> ) = (POP :: (k -> ) -> [[k]] -> )
type AllN (SOP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NS type AllN (SOP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) = All2 c
type CollapseTo (SOP :: (k -> ) -> [[k]] -> ) a Source #
Instance details Defined in Generics.SOP.NS type CollapseTo (SOP :: (k -> ) -> [[k]] -> ) a = [a]

unSOP :: SOP f xss -> NS (NP f) xss Source #

Unwrap a sum of products.

newtype POP (f :: k -> *) (xss :: [[k]]) 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.

Constructors

POP (NP (NP f) xss)

Instances

HTrans (POP :: (k1 -> ) -> [[k1]] -> ) (POP :: (k2 -> ) -> [[k2]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods htrans :: AllZipN (Prod POP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> POP f xs -> POP g ys Source # hcoerce :: (AllZipN (Prod POP) (LiftedCoercible f g) xs ys, HTrans POP POP) => POP f xs -> POP g ys Source #
HSequence (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.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 #
HTraverse_ (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hctraverse_ :: (AllN POP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> POP f xs -> g () Source # htraverse_ :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> POP f xs -> g () Source #
HCollapse (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hcollapse :: SListIN POP xs => POP (K a) xs -> CollapseTo POP a Source #
HAp (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hap :: Prod POP (f -.-> g) xs -> POP f xs -> POP g xs Source #
HPure (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hpure :: SListIN POP xs => (forall (a :: k0). f a) -> POP f xs Source # hcpure :: AllN POP c xs => proxy c -> (forall (a :: k0). c a => f a) -> POP f xs Source #
Eq (NP (NP f) xss) => Eq (POP f xss) Source #
Instance details Defined in Generics.SOP.NP Methods (==) :: POP f xss -> POP f xss -> Bool # (/=) :: POP f xss -> POP f xss -> Bool #
Ord (NP (NP f) xss) => Ord (POP f xss) Source #
Instance details Defined in Generics.SOP.NP Methods compare :: POP f xss -> POP f xss -> Ordering # (<) :: POP f xss -> POP f xss -> Bool # (<=) :: POP f xss -> POP f xss -> Bool # (>) :: POP f xss -> POP f xss -> Bool # (>=) :: POP f xss -> POP f xss -> Bool # max :: POP f xss -> POP f xss -> POP f xss # min :: POP f xss -> POP f xss -> POP f xss #
Show (NP (NP f) xss) => Show (POP f xss) Source #
Instance details Defined in Generics.SOP.NP Methods showsPrec :: Int -> POP f xss -> ShowS # show :: POP f xss -> String # showList :: [POP f xss] -> ShowS #
NFData (NP (NP f) xss) => NFData (POP f xss) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.NP Methods rnf :: POP f xss -> () #
type AllZipN (POP :: (k -> ) -> [[k]] -> ) (c :: a -> b -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllZipN (POP :: (k -> ) -> [[k]] -> ) (c :: a -> b -> Constraint) = AllZip2 c
type Same (POP :: (k1 -> ) -> [[k1]] -> ) Source #
Instance details Defined in Generics.SOP.NP type Same (POP :: (k1 -> ) -> [[k1]] -> ) = (POP :: (k2 -> ) -> [[k2]] -> )
type SListIN (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP type SListIN (POP :: (k -> ) -> [[k]] -> ) = (SListI2 :: [[k]] -> Constraint)
type UnProd (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type UnProd (POP :: (k -> ) -> [[k]] -> ) = (SOP :: (k -> ) -> [[k]] -> )
type Prod (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP type Prod (POP :: (k -> ) -> [[k]] -> ) = (POP :: (k -> ) -> [[k]] -> )
type AllN (POP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllN (POP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) = All2 c
type CollapseTo (POP :: (k -> ) -> [[k]] -> ) a Source #
Instance details Defined in Generics.SOP.NP type CollapseTo (POP :: (k -> ) -> [[k]] -> ) a = [[a]]

unPOP :: POP f xss -> NP (NP f) xss Source #

Unwrap a product of products.

Metadata

data DatatypeInfo :: [[*]] -> * where Source #

Metadata for a datatype.

A value of type DatatypeInfo c contains the information about a datatype that is not contained in Code c. This information consists primarily of the names of the datatype, its constructors, and possibly its record selectors.

The constructor indicates whether the datatype has been declared using newtype or not.

Constructors

ADT :: ModuleName -> DatatypeName -> NP ConstructorInfo xss -> DatatypeInfo xss
Newtype :: ModuleName -> DatatypeName -> ConstructorInfo '[x] -> DatatypeInfo '['[x]]

Instances

All (Compose Eq ConstructorInfo) xs => Eq (DatatypeInfo xs) Source #
Instance details Defined in Generics.SOP.Metadata Methods (==) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # (/=) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool #
(All (Compose Eq ConstructorInfo) xs, All (Compose Ord ConstructorInfo) xs) => Ord (DatatypeInfo xs) Source #
Instance details Defined in Generics.SOP.Metadata Methods compare :: DatatypeInfo xs -> DatatypeInfo xs -> Ordering # (<) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # (<=) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # (>) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # (>=) :: DatatypeInfo xs -> DatatypeInfo xs -> Bool # max :: DatatypeInfo xs -> DatatypeInfo xs -> DatatypeInfo xs # min :: DatatypeInfo xs -> DatatypeInfo xs -> DatatypeInfo xs #
All (Compose Show ConstructorInfo) xs => Show (DatatypeInfo xs) Source #
Instance details Defined in Generics.SOP.Metadata Methods showsPrec :: Int -> DatatypeInfo xs -> ShowS # show :: DatatypeInfo xs -> String # showList :: [DatatypeInfo xs] -> ShowS #

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 :: [*] -> * where Source #

Metadata for a single constructors.

This is indexed by the product structure of the constructor components.

Constructors

Constructor :: SListI xs => ConstructorName -> ConstructorInfo xs
Infix :: ConstructorName -> Associativity -> Fixity -> ConstructorInfo '[x, y]
Record :: SListI xs => ConstructorName -> NP FieldInfo xs -> ConstructorInfo xs

Instances

All (Compose Eq FieldInfo) xs => Eq (ConstructorInfo xs) Source #
Instance details Defined in Generics.SOP.Metadata Methods (==) :: ConstructorInfo xs -> ConstructorInfo xs -> Bool # (/=) :: ConstructorInfo xs -> ConstructorInfo xs -> Bool #
(All (Compose Eq FieldInfo) xs, All (Compose Ord FieldInfo) xs) => Ord (ConstructorInfo xs) Source #
Instance details Defined in Generics.SOP.Metadata Methods compare :: ConstructorInfo xs -> ConstructorInfo xs -> Ordering # (<) :: ConstructorInfo xs -> ConstructorInfo xs -> Bool # (<=) :: ConstructorInfo xs -> ConstructorInfo xs -> Bool # (>) :: ConstructorInfo xs -> ConstructorInfo xs -> Bool # (>=) :: ConstructorInfo xs -> ConstructorInfo xs -> Bool # max :: ConstructorInfo xs -> ConstructorInfo xs -> ConstructorInfo xs # min :: ConstructorInfo xs -> ConstructorInfo xs -> ConstructorInfo xs #
All (Compose Show FieldInfo) xs => Show (ConstructorInfo xs) Source #
Instance details Defined in Generics.SOP.Metadata Methods showsPrec :: Int -> ConstructorInfo xs -> ShowS # show :: ConstructorInfo xs -> String # showList :: [ConstructorInfo xs] -> ShowS #

constructorName :: ConstructorInfo xs -> ConstructorName Source #

The name of a constructor.

Since: 0.2.3.0

data FieldInfo :: * -> * where Source #

For records, this functor maps the component to its selector name.

Constructors

FieldInfo :: FieldName -> FieldInfo a

Instances

Functor FieldInfo Source #
Instance details Defined in Generics.SOP.Metadata Methods fmap :: (a -> b) -> FieldInfo a -> FieldInfo b # (<$) :: a -> FieldInfo b -> FieldInfo a #
Eq (FieldInfo a) Source #
Instance details Defined in Generics.SOP.Metadata Methods (==) :: FieldInfo a -> FieldInfo a -> Bool # (/=) :: FieldInfo a -> FieldInfo a -> Bool #
Ord (FieldInfo a) Source #
Instance details Defined in Generics.SOP.Metadata Methods compare :: FieldInfo a -> FieldInfo a -> Ordering # (<) :: FieldInfo a -> FieldInfo a -> Bool # (<=) :: FieldInfo a -> FieldInfo a -> Bool # (>) :: FieldInfo a -> FieldInfo a -> Bool # (>=) :: FieldInfo a -> FieldInfo a -> Bool # max :: FieldInfo a -> FieldInfo a -> FieldInfo a # min :: FieldInfo a -> FieldInfo a -> FieldInfo a #
Show (FieldInfo a) Source #
Instance details Defined in Generics.SOP.Metadata Methods showsPrec :: Int -> FieldInfo a -> ShowS # show :: FieldInfo a -> String # showList :: [FieldInfo a] -> ShowS #

fieldName :: FieldInfo a -> FieldName Source #

The name of a field.

Since: 0.2.3.0

class 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.

Associated Types

type DatatypeInfoOf a :: DatatypeInfo Source #

Type-level datatype info

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 #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Bool :: DatatypeInfo Source # Methods datatypeInfo :: proxy Bool -> DatatypeInfo (Code Bool) Source #
HasDatatypeInfo Ordering Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Ordering :: DatatypeInfo Source # Methods datatypeInfo :: proxy Ordering -> DatatypeInfo (Code Ordering) Source #
HasDatatypeInfo () Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf () :: DatatypeInfo Source # Methods datatypeInfo :: proxy () -> DatatypeInfo (Code ()) Source #
HasDatatypeInfo DataRep Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf DataRep :: DatatypeInfo Source # Methods datatypeInfo :: proxy DataRep -> DatatypeInfo (Code DataRep) Source #
HasDatatypeInfo ConstrRep Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ConstrRep :: DatatypeInfo Source # Methods datatypeInfo :: proxy ConstrRep -> DatatypeInfo (Code ConstrRep) Source #
HasDatatypeInfo Fixity Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Fixity :: DatatypeInfo Source # Methods datatypeInfo :: proxy Fixity -> DatatypeInfo (Code Fixity) Source #
HasDatatypeInfo FormatAdjustment Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FormatAdjustment :: DatatypeInfo Source # Methods datatypeInfo :: proxy FormatAdjustment -> DatatypeInfo (Code FormatAdjustment) Source #
HasDatatypeInfo FormatSign Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FormatSign :: DatatypeInfo Source # Methods datatypeInfo :: proxy FormatSign -> DatatypeInfo (Code FormatSign) Source #
HasDatatypeInfo FieldFormat Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FieldFormat :: DatatypeInfo Source # Methods datatypeInfo :: proxy FieldFormat -> DatatypeInfo (Code FieldFormat) Source #
HasDatatypeInfo FormatParse Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf FormatParse :: DatatypeInfo Source # Methods datatypeInfo :: proxy FormatParse -> DatatypeInfo (Code FormatParse) Source #
HasDatatypeInfo Version Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Version :: DatatypeInfo Source # Methods datatypeInfo :: proxy Version -> DatatypeInfo (Code Version) Source #
HasDatatypeInfo PatternMatchFail Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf PatternMatchFail :: DatatypeInfo Source # Methods datatypeInfo :: proxy PatternMatchFail -> DatatypeInfo (Code PatternMatchFail) Source #
HasDatatypeInfo RecSelError Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RecSelError :: DatatypeInfo Source # Methods datatypeInfo :: proxy RecSelError -> DatatypeInfo (Code RecSelError) Source #
HasDatatypeInfo RecConError Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RecConError :: DatatypeInfo Source # Methods datatypeInfo :: proxy RecConError -> DatatypeInfo (Code RecConError) Source #
HasDatatypeInfo RecUpdError Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf RecUpdError :: DatatypeInfo Source # Methods datatypeInfo :: proxy RecUpdError -> DatatypeInfo (Code RecUpdError) Source #
HasDatatypeInfo NoMethodError Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf NoMethodError :: DatatypeInfo Source # Methods datatypeInfo :: proxy NoMethodError -> DatatypeInfo (Code NoMethodError) Source #
HasDatatypeInfo NonTermination Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf NonTermination :: DatatypeInfo Source # Methods datatypeInfo :: proxy NonTermination -> DatatypeInfo (Code NonTermination) Source #
HasDatatypeInfo NestedAtomically Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf NestedAtomically :: DatatypeInfo Source # Methods datatypeInfo :: proxy NestedAtomically -> DatatypeInfo (Code NestedAtomically) Source #
HasDatatypeInfo Errno Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Errno :: DatatypeInfo Source # Methods datatypeInfo :: proxy Errno -> DatatypeInfo (Code Errno) Source #
HasDatatypeInfo BlockedIndefinitelyOnMVar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf BlockedIndefinitelyOnMVar :: DatatypeInfo Source # Methods datatypeInfo :: proxy BlockedIndefinitelyOnMVar -> DatatypeInfo (Code BlockedIndefinitelyOnMVar) Source #
HasDatatypeInfo BlockedIndefinitelyOnSTM Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf BlockedIndefinitelyOnSTM :: DatatypeInfo Source # Methods datatypeInfo :: proxy BlockedIndefinitelyOnSTM -> DatatypeInfo (Code BlockedIndefinitelyOnSTM) Source #
HasDatatypeInfo Deadlock Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Deadlock :: DatatypeInfo Source # Methods datatypeInfo :: proxy Deadlock -> DatatypeInfo (Code Deadlock) Source #
HasDatatypeInfo AssertionFailed Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf AssertionFailed :: DatatypeInfo Source # Methods datatypeInfo :: proxy AssertionFailed -> DatatypeInfo (Code AssertionFailed) Source #
HasDatatypeInfo AsyncException Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf AsyncException :: DatatypeInfo Source # Methods datatypeInfo :: proxy AsyncException -> DatatypeInfo (Code AsyncException) Source #
HasDatatypeInfo ArrayException Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ArrayException :: DatatypeInfo Source # Methods datatypeInfo :: proxy ArrayException -> DatatypeInfo (Code ArrayException) Source #
HasDatatypeInfo ExitCode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ExitCode :: DatatypeInfo Source # Methods datatypeInfo :: proxy ExitCode -> DatatypeInfo (Code ExitCode) Source #
HasDatatypeInfo BufferMode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf BufferMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy BufferMode -> DatatypeInfo (Code BufferMode) Source #
HasDatatypeInfo Newline Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Newline :: DatatypeInfo Source # Methods datatypeInfo :: proxy Newline -> DatatypeInfo (Code Newline) Source #
HasDatatypeInfo NewlineMode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf NewlineMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy NewlineMode -> DatatypeInfo (Code NewlineMode) Source #
HasDatatypeInfo SeekMode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf SeekMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy SeekMode -> DatatypeInfo (Code SeekMode) Source #
HasDatatypeInfo MaskingState Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf MaskingState :: DatatypeInfo Source # Methods datatypeInfo :: proxy MaskingState -> DatatypeInfo (Code MaskingState) Source #
HasDatatypeInfo IOException Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf IOException :: DatatypeInfo Source # Methods datatypeInfo :: proxy IOException -> DatatypeInfo (Code IOException) Source #
HasDatatypeInfo ErrorCall Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ErrorCall :: DatatypeInfo Source # Methods datatypeInfo :: proxy ErrorCall -> DatatypeInfo (Code ErrorCall) Source #
HasDatatypeInfo ArithException Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf ArithException :: DatatypeInfo Source # Methods datatypeInfo :: proxy ArithException -> DatatypeInfo (Code ArithException) Source #
HasDatatypeInfo All Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf All :: DatatypeInfo Source # Methods datatypeInfo :: proxy All -> DatatypeInfo (Code All) Source #
HasDatatypeInfo Any Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Any :: DatatypeInfo Source # Methods datatypeInfo :: proxy Any -> DatatypeInfo (Code Any) Source #
HasDatatypeInfo CChar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CChar :: DatatypeInfo Source # Methods datatypeInfo :: proxy CChar -> DatatypeInfo (Code CChar) Source #
HasDatatypeInfo CSChar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CSChar :: DatatypeInfo Source # Methods datatypeInfo :: proxy CSChar -> DatatypeInfo (Code CSChar) Source #
HasDatatypeInfo CUChar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUChar :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUChar -> DatatypeInfo (Code CUChar) Source #
HasDatatypeInfo CShort Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CShort :: DatatypeInfo Source # Methods datatypeInfo :: proxy CShort -> DatatypeInfo (Code CShort) Source #
HasDatatypeInfo CUShort Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUShort :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUShort -> DatatypeInfo (Code CUShort) Source #
HasDatatypeInfo CInt Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CInt :: DatatypeInfo Source # Methods datatypeInfo :: proxy CInt -> DatatypeInfo (Code CInt) Source #
HasDatatypeInfo CUInt Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUInt :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUInt -> DatatypeInfo (Code CUInt) Source #
HasDatatypeInfo CLong Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CLong :: DatatypeInfo Source # Methods datatypeInfo :: proxy CLong -> DatatypeInfo (Code CLong) Source #
HasDatatypeInfo CULong Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CULong :: DatatypeInfo Source # Methods datatypeInfo :: proxy CULong -> DatatypeInfo (Code CULong) Source #
HasDatatypeInfo CLLong Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CLLong :: DatatypeInfo Source # Methods datatypeInfo :: proxy CLLong -> DatatypeInfo (Code CLLong) Source #
HasDatatypeInfo CULLong Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CULLong :: DatatypeInfo Source # Methods datatypeInfo :: proxy CULLong -> DatatypeInfo (Code CULLong) Source #
HasDatatypeInfo CFloat Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CFloat :: DatatypeInfo Source # Methods datatypeInfo :: proxy CFloat -> DatatypeInfo (Code CFloat) Source #
HasDatatypeInfo CDouble Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CDouble :: DatatypeInfo Source # Methods datatypeInfo :: proxy CDouble -> DatatypeInfo (Code CDouble) Source #
HasDatatypeInfo CPtrdiff Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CPtrdiff :: DatatypeInfo Source # Methods datatypeInfo :: proxy CPtrdiff -> DatatypeInfo (Code CPtrdiff) Source #
HasDatatypeInfo CSize Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CSize :: DatatypeInfo Source # Methods datatypeInfo :: proxy CSize -> DatatypeInfo (Code CSize) Source #
HasDatatypeInfo CWchar Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CWchar :: DatatypeInfo Source # Methods datatypeInfo :: proxy CWchar -> DatatypeInfo (Code CWchar) Source #
HasDatatypeInfo CSigAtomic Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CSigAtomic :: DatatypeInfo Source # Methods datatypeInfo :: proxy CSigAtomic -> DatatypeInfo (Code CSigAtomic) Source #
HasDatatypeInfo CClock Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CClock :: DatatypeInfo Source # Methods datatypeInfo :: proxy CClock -> DatatypeInfo (Code CClock) Source #
HasDatatypeInfo CTime Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CTime :: DatatypeInfo Source # Methods datatypeInfo :: proxy CTime -> DatatypeInfo (Code CTime) Source #
HasDatatypeInfo CUSeconds Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUSeconds :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUSeconds -> DatatypeInfo (Code CUSeconds) Source #
HasDatatypeInfo CSUSeconds Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CSUSeconds :: DatatypeInfo Source # Methods datatypeInfo :: proxy CSUSeconds -> DatatypeInfo (Code CSUSeconds) Source #
HasDatatypeInfo CIntPtr Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CIntPtr :: DatatypeInfo Source # Methods datatypeInfo :: proxy CIntPtr -> DatatypeInfo (Code CIntPtr) Source #
HasDatatypeInfo CUIntPtr Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUIntPtr :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUIntPtr -> DatatypeInfo (Code CUIntPtr) Source #
HasDatatypeInfo CIntMax Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CIntMax :: DatatypeInfo Source # Methods datatypeInfo :: proxy CIntMax -> DatatypeInfo (Code CIntMax) Source #
HasDatatypeInfo CUIntMax Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf CUIntMax :: DatatypeInfo Source # Methods datatypeInfo :: proxy CUIntMax -> DatatypeInfo (Code CUIntMax) Source #
HasDatatypeInfo IOMode Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf IOMode :: DatatypeInfo Source # Methods datatypeInfo :: proxy IOMode -> DatatypeInfo (Code IOMode) Source #
HasDatatypeInfo Lexeme Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Lexeme :: DatatypeInfo Source # Methods datatypeInfo :: proxy Lexeme -> DatatypeInfo (Code Lexeme) Source #
HasDatatypeInfo Number Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf Number :: DatatypeInfo Source # Methods datatypeInfo :: proxy Number -> DatatypeInfo (Code Number) Source #
HasDatatypeInfo GeneralCategory Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf GeneralCategory :: DatatypeInfo Source # Methods datatypeInfo :: proxy GeneralCategory -> DatatypeInfo (Code GeneralCategory) Source #
HasDatatypeInfo [a] Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf [a] :: DatatypeInfo Source # Methods datatypeInfo :: proxy [a] -> DatatypeInfo (Code [a]) Source #
HasDatatypeInfo (Maybe a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Maybe a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Maybe a) -> DatatypeInfo (Code (Maybe a)) Source #
HasDatatypeInfo (Complex a) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Fixed a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Fixed a) -> DatatypeInfo (Code (Fixed a)) Source #
HasDatatypeInfo (ArgOrder a) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (OptDescr a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (OptDescr a) -> DatatypeInfo (Code (OptDescr a)) Source #
HasDatatypeInfo (ArgDescr a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (ArgDescr a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (ArgDescr a) -> DatatypeInfo (Code (ArgDescr a)) Source #
HasDatatypeInfo (First a) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Last a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Last a) -> DatatypeInfo (Code (Last a)) Source #
HasDatatypeInfo (Dual a) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Endo a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Endo a) -> DatatypeInfo (Code (Endo a)) Source #
HasDatatypeInfo (Sum a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Sum a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Sum a) -> DatatypeInfo (Code (Sum a)) Source #
HasDatatypeInfo (Product a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Product a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Product a) -> DatatypeInfo (Code (Product a)) Source #
HasDatatypeInfo (Down a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Down a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Down a) -> DatatypeInfo (Code (Down a)) Source #
HasDatatypeInfo (I a) Source #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (I a) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (I a) -> DatatypeInfo (Code (I a)) Source #
HasDatatypeInfo (Either a b) Source #
Instance details 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 (a, b) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type DatatypeInfoOf (Proxy t) :: DatatypeInfo Source # Methods datatypeInfo :: proxy (Proxy t) -> DatatypeInfo (Code (Proxy t)) Source #
HasDatatypeInfo (a, b, c) Source #
Instance details 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 #
Instance details 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 (a, b, c, d) Source #
Instance details 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 (a, b, c, d, e) Source #
Instance details 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 #
Instance details 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, f) Source #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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 #
Instance details 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.

type FieldName = String Source #

The name of a field / record selector.

data Associativity #

Datatype to represent the associativity of a constructor

Constructors

LeftAssociative
RightAssociative
NotAssociative

Instances

Bounded Associativity
Instance details Defined in GHC.Generics Methods minBound :: Associativity # maxBound :: Associativity #
Enum Associativity
Instance details 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
Instance details Defined in GHC.Generics Methods (==) :: Associativity -> Associativity -> Bool # (/=) :: Associativity -> Associativity -> Bool #
Data Associativity	Since: base-4.9.0.0
Instance details 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
Instance details 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
Instance details Defined in GHC.Generics Methods readsPrec :: Int -> ReadS Associativity # readList :: ReadS [Associativity] # readPrec :: ReadPrec Associativity # readListPrec :: ReadPrec [Associativity] #
Show Associativity
Instance details Defined in GHC.Generics Methods showsPrec :: Int -> Associativity -> ShowS # show :: Associativity -> String # showList :: [Associativity] -> ShowS #
Ix Associativity
Instance details 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
Instance details Defined in GHC.Generics Associated Types type Rep Associativity :: * -> * # Methods from :: Associativity -> Rep Associativity x # to :: Rep Associativity x -> Associativity #
SingKind Associativity	Since: base-4.0.0.0
Instance details Defined in GHC.Generics Associated Types type DemoteRep Associativity :: * Methods fromSing :: Sing a -> DemoteRep Associativity
SingI LeftAssociative	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing LeftAssociative
SingI RightAssociative	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing RightAssociative
SingI NotAssociative	Since: base-4.9.0.0
Instance details Defined in GHC.Generics Methods sing :: Sing NotAssociative
type Rep Associativity
Instance details Defined in GHC.Generics type Rep Associativity = D1 (MetaData "Associativity" "GHC.Generics" "base" False) (C1 (MetaCons "LeftAssociative" PrefixI False) (U1 :: * -> ) :+: (C1 (MetaCons "RightAssociative" PrefixI False) (U1 :: -> ) :+: C1 (MetaCons "NotAssociative" PrefixI False) (U1 :: -> *)))
data Sing (a :: Associativity)
Instance details Defined in GHC.Generics data Sing (a :: Associativity) where SLeftAssociative :: Sing LeftAssociative SRightAssociative :: Sing RightAssociative SNotAssociative :: Sing NotAssociative
type DemoteRep Associativity
Instance details Defined in GHC.Generics type DemoteRep Associativity = Associativity

type Fixity = Int Source #

The fixity of an infix constructor.

Combinators

Constructing products

class HPure (h :: (k -> *) -> l -> *) where Source #

A generalization of pure or return to higher kinds.

Minimal complete definition

hpure, hcpure

Methods

hpure :: SListIN h xs => (forall a. f a) -> h f xs Source #

Corresponds to pure directly.

Instances:

hpure, pure_NP  :: SListI  xs  => (forall a. f a) -> NP  f xs
hpure, pure_POP :: SListI2 xss => (forall a. f a) -> POP f xss

hcpure :: AllN h c xs => proxy c -> (forall a. c a => f a) -> h f xs Source #

A variant of hpure that allows passing in a constrained argument.

Calling hcpure f s where s :: 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 AllMap h c xs states.

Morally, hpure is a special case of hcpure where the constraint is empty. However, it is in the nature of how AllMap is defined as well as current GHC limitations that it is tricky to prove to GHC in general that AllMap h c NoConstraint xs is always satisfied. Therefore, we typically define hpure separately and directly, and make it a member of the class.

Instances:

hcpure, cpure_NP  :: (All  c xs ) => proxy c -> (forall a. c a => f a) -> NP  f xs
hcpure, cpure_POP :: (All2 c xss) => proxy c -> (forall a. c a => f a) -> POP f xss

Instances

HPure (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hpure :: SListIN NP xs => (forall (a :: k0). f a) -> NP f xs Source # hcpure :: AllN NP c xs => proxy c -> (forall (a :: k0). c a => f a) -> NP f xs Source #
HPure (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hpure :: SListIN POP xs => (forall (a :: k0). f a) -> POP f xs Source # hcpure :: AllN POP c xs => proxy c -> (forall (a :: k0). c a => f a) -> POP f xs Source #

Destructing products

hd :: NP f (x ': xs) -> f x Source #

Obtain the head of an n-ary product.

Since: 0.2.1.0

tl :: NP f (x ': xs) -> NP f xs Source #

Obtain the tail of an n-ary product.

Since: 0.2.1.0

type Projection (f :: k -> *) (xs :: [k]) = K (NP f xs) -.-> f Source #

The type of projections from an n-ary product.

projections :: forall xs f. 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 a -> Projection f (x ': xs) a Source #

Application

newtype (f -.-> g) a infixr 1 Source #

Lifted functions.

Constructors

Fn
Fields apFn :: f a -> g a

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 -> *) -> l -> *) :: (k -> *) -> l -> * Source #

Maps a structure containing sums to the corresponding product structure.

Instances

type Prod (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP type Prod (NP :: (k -> ) -> [k] -> ) = (NP :: (k -> ) -> [k] -> )
type Prod (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP type Prod (POP :: (k -> ) -> [[k]] -> ) = (POP :: (k -> ) -> [[k]] -> )
type Prod (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type Prod (NS :: (k -> ) -> [k] -> ) = (NP :: (k -> ) -> [k] -> )
type Prod (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type Prod (SOP :: (k -> ) -> [[k]] -> ) = (POP :: (k -> ) -> [[k]] -> )

class (Prod (Prod h) ~ Prod h, HPure (Prod h)) => HAp (h :: (k -> *) -> l -> *) where Source #

A generalization of <*>.

Minimal complete definition

hap

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 xs
hap, ap_NS  :: NP  (f -.-> g) xs  -> NS  f xs  -> NS  g xs
hap, ap_POP :: POP (f -.-> g) xss -> POP f xss -> POP g xss
hap, ap_SOP :: POP (f -.-> g) xss -> SOP f xss -> SOP g xss

Instances

HAp (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hap :: Prod NP (f -.-> g) xs -> NP f xs -> NP g xs Source #
HAp (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hap :: Prod POP (f -.-> g) xs -> POP f xs -> POP g xs Source #
HAp (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hap :: Prod NS (f -.-> g) xs -> NS f xs -> NS g xs Source #
HAp (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hap :: Prod SOP (f -.-> g) xs -> SOP f xs -> SOP g xs Source #

Lifting / mapping

hliftA :: (SListIN (Prod h) xs, HAp h) => (forall a. 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' xs
hliftA, liftA_NS  :: SListI  xs  => (forall a. f a -> f' a) -> NS  f xs  -> NS  f' xs
hliftA, liftA_POP :: SListI2 xss => (forall a. f a -> f' a) -> POP f xss -> POP f' xss
hliftA, 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. 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'' xs
hliftA2, liftA2_NS  :: SListI  xs  => (forall a. f a -> f' a -> f'' a) -> NP  f xs  -> NS  f' xs  -> NS  f'' xs
hliftA2, liftA2_POP :: SListI2 xss => (forall a. f a -> f' a -> f'' a) -> POP f xss -> POP f' xss -> POP f'' xss
hliftA2, 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. 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''' xs
hliftA3, 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''' xs
hliftA3, 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''' xs
hliftA3, 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. c a => f a -> f' a) -> h f xs -> h f' xs Source #

Variant of hliftA that takes a constrained function.

Specification:

hcliftA p f xs = hcpure p (fn f) ` hap ` xs

hcliftA2 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall a. c a => f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs Source #

Variant of hcliftA2 that takes a constrained function.

Specification:

hcliftA2 p f xs ys = hcpure p (fn_2 f) ` hap ` xs ` hap ` ys

hcliftA3 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall a. 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 #

Variant of hcliftA3 that takes a constrained function.

Specification:

hcliftA3 p f xs ys zs = hcpure p (fn_3 f) ` hap ` xs ` hap ` ys ` hap ` zs

hmap :: (SListIN (Prod h) xs, HAp h) => (forall a. f a -> f' a) -> h f xs -> h f' xs Source #

Another name for hliftA.

Since: 0.2

hzipWith :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall a. f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs Source #

Another name for hliftA2.

Since: 0.2

hzipWith3 :: (SListIN (Prod h) xs, HAp h, HAp (Prod h)) => (forall 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 hliftA3.

Since: 0.2

hcmap :: (AllN (Prod h) c xs, HAp h) => proxy c -> (forall a. c a => f a -> f' a) -> h f xs -> h f' xs Source #

Another name for hcliftA.

Since: 0.2

hczipWith :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall a. c a => f a -> f' a -> f'' a) -> Prod h f xs -> h f' xs -> h f'' xs Source #

Another name for hcliftA2.

Since: 0.2

hczipWith3 :: (AllN (Prod h) c xs, HAp h, HAp (Prod h)) => proxy c -> (forall a. 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: 0.2

Constructing sums

type Injection (f :: k -> *) (xs :: [k]) = f -.-> K (NS f xs) 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 :: forall xs f. 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 a -> Injection f (x ': xs) a Source #

Deprecated: Use shiftInjection instead.

Shift an injection.

Given an injection, return an injection into a sum that is one component larger.

shiftInjection :: Injection f xs a -> Injection f (x ': xs) a Source #

Shift an injection.

Given an injection, return an injection into a sum that is one component larger.

type family UnProd (h :: (k -> *) -> l -> *) :: (k -> *) -> l -> * Source #

Maps a structure containing products to the corresponding sum structure.

Since: 0.2.4.0

Instances

type UnProd (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type UnProd (NP :: (k -> ) -> [k] -> ) = (NS :: (k -> ) -> [k] -> )
type UnProd (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type UnProd (POP :: (k -> ) -> [[k]] -> ) = (SOP :: (k -> ) -> [[k]] -> )

class UnProd (Prod h) ~ h => HApInjs (h :: (k -> *) -> l -> *) where Source #

A class for applying all injections corresponding to a sum-like structure to a table containing suitable arguments.

Minimal complete definition

hapInjs

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: 0.2.4.0

Instances

HApInjs (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hapInjs :: SListIN NS xs => Prod NS f xs -> [NS f xs] Source #
HApInjs (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hapInjs :: SListIN SOP xs => Prod SOP f xs -> [SOP f xs] Source #

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] -> 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: 0.2.2.0

class HIndex (h :: (k -> *) -> l -> *) where Source #

A class for determining which choice in a sum-like structure a value represents.

Minimal complete definition

hindex

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 hindex x returns a number between 0 and n - 1 representing the index of the choice made by x.

Instances:

hindex, index_NS  :: NS  f xs -> Int
hindex, 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: 0.2.4.0

Instances

HIndex (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hindex :: NS f xs -> Int Source #
HIndex (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hindex :: SOP f xs -> Int Source #

Dealing with `All c`

hcliftA' :: (All2 c xss, Prod h ~ NP, HAp h) => proxy c -> (forall xs. All c xs => f xs -> f' xs) -> h f xss -> h f' xss Source #

Deprecated: Use hcliftA or hcmap instead.

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' xss
hcliftA' :: 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, HAp h) => proxy c -> (forall xs. All c xs => f xs -> f' xs -> f'' xs) -> Prod h f xss -> h f' xss -> h f'' xss Source #

Deprecated: Use hcliftA2 or hczipWith instead.

Like hcliftA', but for binary functions.

hcliftA3' :: (All2 c xss, Prod h ~ NP, HAp h) => proxy c -> (forall xs. 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 #

Deprecated: Use hcliftA3 or hczipWith3 instead.

Like hcliftA', but for ternay functions.

Comparison

compare_NS Source #

Arguments

:: r	what to do if first is smaller
-> (forall 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

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: 0.3.2.0

ccompare_NS Source #

Arguments

:: All c xs
=> proxy c
-> r	what to do if first is smaller
-> (forall x. 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: 0.3.2.0

compare_SOP Source #

Arguments

:: r	what to do if first is smaller
-> (forall 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

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: 0.3.2.0

ccompare_SOP Source #

Arguments

:: All2 c xss
=> proxy c
-> r	what to do if first is smaller
-> (forall xs. 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: 0.3.2.0

Collapsing

type family CollapseTo (h :: (k -> *) -> l -> *) (x :: *) :: * Source #

Maps products to lists, and sums to identities.

Instances

type CollapseTo (NP :: (k -> ) -> [k] -> ) a Source #
Instance details Defined in Generics.SOP.NP type CollapseTo (NP :: (k -> ) -> [k] -> ) a = [a]
type CollapseTo (POP :: (k -> ) -> [[k]] -> ) a Source #
Instance details Defined in Generics.SOP.NP type CollapseTo (POP :: (k -> ) -> [[k]] -> ) a = [[a]]
type CollapseTo (NS :: (k -> ) -> [k] -> ) a Source #
Instance details Defined in Generics.SOP.NS type CollapseTo (NS :: (k -> ) -> [k] -> ) a = a
type CollapseTo (SOP :: (k -> ) -> [[k]] -> ) a Source #
Instance details Defined in Generics.SOP.NS type CollapseTo (SOP :: (k -> ) -> [[k]] -> ) a = [a]

class HCollapse (h :: (k -> *) -> l -> *) where Source #

A class for collapsing a heterogeneous structure into a homogeneous one.

Minimal complete definition

hcollapse

Methods

hcollapse :: SListIN h xs => h (K a) 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 NS (K a) contains a single a, and an NP (K a) contains a list of as.

Instances:

hcollapse, collapse_NP  :: NP  (K a) xs  ->  [a]
hcollapse, collapse_NS  :: NS  (K a) xs  ->   a
hcollapse, collapse_POP :: POP (K a) xss -> [[a]]
hcollapse, collapse_SOP :: SOP (K a) xss ->  [a]

Instances

HCollapse (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hcollapse :: SListIN NP xs => NP (K a) xs -> CollapseTo NP a Source #
HCollapse (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hcollapse :: SListIN POP xs => POP (K a) xs -> CollapseTo POP a Source #
HCollapse (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hcollapse :: SListIN NS xs => NS (K a) xs -> CollapseTo NS a Source #
HCollapse (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hcollapse :: SListIN SOP xs => SOP (K a) xs -> CollapseTo SOP a Source #

Folding and sequencing

class HTraverse_ (h :: (k -> *) -> l -> *) where Source #

A generalization of traverse_ or foldMap.

Since: 0.3.2.0

Minimal complete definition

hctraverse_, htraverse_

Methods

hctraverse_ :: (AllN h c xs, Applicative g) => proxy c -> (forall a. 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: 0.3.2.0

htraverse_ :: (SListIN h xs, Applicative g) => (forall a. 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: 0.3.2.0

Instances

HTraverse_ (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hctraverse_ :: (AllN NP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NP f xs -> g () Source # htraverse_ :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NP f xs -> g () Source #
HTraverse_ (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hctraverse_ :: (AllN POP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> POP f xs -> g () Source # htraverse_ :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> POP f xs -> g () Source #
HTraverse_ (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hctraverse_ :: (AllN NS c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NS f xs -> g () Source # htraverse_ :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NS f xs -> g () Source #
HTraverse_ (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hctraverse_ :: (AllN SOP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> SOP f xs -> g () Source # htraverse_ :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> SOP f xs -> g () Source #

hcfoldMap :: (HTraverse_ h, AllN h c xs, Monoid m) => proxy c -> (forall a. c a => f a -> m) -> h f xs -> m Source #

Special case of hctraverse_.

Since: 0.3.2.0

hcfor_ :: (HTraverse_ h, AllN h c xs, Applicative g) => proxy c -> h f xs -> (forall a. c a => f a -> g ()) -> g () Source #

Flipped version of hctraverse_.

Since: 0.3.2.0

class HAp h => HSequence (h :: (k -> *) -> l -> *) where Source #

A generalization of sequenceA.

Minimal complete definition

hsequence', hctraverse', htraverse'

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. 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: 0.3.2.0

htraverse' :: (SListIN h xs, Applicative g) => (forall a. 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: 0.3.2.0

Instances

HSequence (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.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 (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.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 (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.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 (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.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 :: (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)) xs -> f (h (K a) 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: 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: 0.3.2.0

Expanding sums to products

class HExpand (h :: (k -> *) -> l -> *) 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: 0.2.5.0

Minimal complete definition

hexpand, hcexpand

Methods

hexpand :: SListIN (Prod h) xs => (forall x. 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 xs
hexpand, 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: 0.2.5.0

hcexpand :: AllN (Prod h) c xs => proxy c -> (forall x. 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 xs
hcexpand, 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: 0.2.5.0

Instances

HExpand (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hexpand :: SListIN (Prod NS) xs => (forall (x :: k0). f x) -> NS f xs -> Prod NS f xs Source # hcexpand :: AllN (Prod NS) c xs => proxy c -> (forall (x :: k0). c x => f x) -> NS f xs -> Prod NS f xs Source #
HExpand (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hexpand :: SListIN (Prod SOP) xs => (forall (x :: k0). f x) -> SOP f xs -> Prod SOP f xs Source # hcexpand :: AllN (Prod SOP) c xs => proxy c -> (forall (x :: k0). c x => f x) -> SOP f xs -> Prod SOP f xs Source #

Transformation of index lists and coercions

class (Same h1 ~ h2, Same h2 ~ h1) => HTrans (h1 :: (k1 -> *) -> l1 -> *) (h2 :: (k2 -> *) -> l2 -> *) 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: 0.3.1.0

Minimal complete definition

htrans, hcoerce

Methods

htrans :: AllZipN (Prod h1) c xs ys => proxy c -> (forall x y. 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: 0.3.1.0

hcoerce :: (AllZipN (Prod h1) (LiftedCoercible f g) xs ys, HTrans h1 h2) => h1 f xs -> h2 g ys Source #

Coerce a structure into a representationally equal structure.

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: 0.3.1.0

Instances

HTrans (NP :: (k1 -> ) -> [k1] -> ) (NP :: (k2 -> ) -> [k2] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods htrans :: AllZipN (Prod NP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> NP f xs -> NP g ys Source # hcoerce :: (AllZipN (Prod NP) (LiftedCoercible f g) xs ys, HTrans NP NP) => NP f xs -> NP g ys Source #
HTrans (POP :: (k1 -> ) -> [[k1]] -> ) (POP :: (k2 -> ) -> [[k2]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods htrans :: AllZipN (Prod POP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> POP f xs -> POP g ys Source # hcoerce :: (AllZipN (Prod POP) (LiftedCoercible f g) xs ys, HTrans POP POP) => POP f xs -> POP g ys Source #
HTrans (NS :: (k1 -> ) -> [k1] -> ) (NS :: (k2 -> ) -> [k2] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods htrans :: AllZipN (Prod NS) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> NS f xs -> NS g ys Source # hcoerce :: (AllZipN (Prod NS) (LiftedCoercible f g) xs ys, HTrans NS NS) => NS f xs -> NS g ys Source #
HTrans (SOP :: (k1 -> ) -> [[k1]] -> ) (SOP :: (k2 -> ) -> [[k2]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods htrans :: AllZipN (Prod SOP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> SOP f xs -> SOP g ys Source # hcoerce :: (AllZipN (Prod SOP) (LiftedCoercible f g) xs ys, HTrans SOP SOP) => SOP f xs -> SOP g ys Source #

hfromI :: (AllZipN (Prod h1) (LiftedCoercible I f) xs ys, HTrans h1 h2) => h1 I xs -> h2 f ys Source #

Specialization of hcoerce.

Since: 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: 0.3.1.0

Partial operations

fromList :: SListI xs => [a] -> Maybe (NP (K a) 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) 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 :: * -> * -> *) Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftEq2 :: (a -> b -> Bool) -> (c -> d -> Bool) -> K a c -> K b d -> Bool #
Ord2 (K :: * -> * -> *) Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftCompare2 :: (a -> b -> Ordering) -> (c -> d -> Ordering) -> K a c -> K b d -> Ordering #
Read2 (K :: * -> * -> *) Source #	Since: 0.2.4.0
Instance details Defined in Generics.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 :: * -> * -> *) Source #	Since: 0.2.4.0
Instance details Defined in Generics.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 #
NFData2 (K :: * -> * -> *) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftRnf2 :: (a -> ()) -> (b -> ()) -> K a b -> () #
Functor (K a :: * -> *) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods fmap :: (a0 -> b) -> K a a0 -> K a b # (<$) :: a0 -> K a b -> K a a0 #
Monoid a => Applicative (K a :: * -> *) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods pure :: a0 -> K a a0 # (<>) :: K a (a0 -> b) -> K a a0 -> K a b # liftA2 :: (a0 -> b -> c) -> K a a0 -> K a b -> K a c # (>) :: K a a0 -> K a b -> K a b # (<*) :: K a a0 -> K a b -> K a a0 #
Foldable (K a :: * -> *) Source #
Instance details Defined in Generics.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 # toList :: K a a0 -> [a0] # null :: K a a0 -> Bool # length :: K a a0 -> Int # elem :: Eq a0 => a0 -> K a a0 -> Bool # maximum :: Ord a0 => K a a0 -> a0 # minimum :: Ord a0 => K a a0 -> a0 # sum :: Num a0 => K a a0 -> a0 # product :: Num a0 => K a a0 -> a0 #
Traversable (K a :: * -> *) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods traverse :: Applicative f => (a0 -> f b) -> K a a0 -> f (K a b) # sequenceA :: Applicative f => K a (f a0) -> f (K a a0) # mapM :: Monad m => (a0 -> m b) -> K a a0 -> m (K a b) # sequence :: Monad m => K a (m a0) -> m (K a a0) #
Eq a => Eq1 (K a :: * -> *) Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftEq :: (a0 -> b -> Bool) -> K a a0 -> K a b -> Bool #
Ord a => Ord1 (K a :: * -> *) Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftCompare :: (a0 -> b -> Ordering) -> K a a0 -> K a b -> Ordering #
Read a => Read1 (K a :: * -> *) Source #	Since: 0.2.4.0
Instance details Defined in Generics.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 :: * -> *) Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftShowsPrec :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> Int -> K a a0 -> ShowS # liftShowList :: (Int -> a0 -> ShowS) -> ([a0] -> ShowS) -> [K a a0] -> ShowS #
NFData a => NFData1 (K a :: * -> *) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftRnf :: (a0 -> ()) -> K a a0 -> () #
Eq a => Eq (K a b) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods (==) :: K a b -> K a b -> Bool # (/=) :: K a b -> K a b -> Bool #
Ord a => Ord (K a b) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods compare :: K a b -> K a b -> Ordering # (<) :: K a b -> K a b -> Bool # (<=) :: K a b -> K a b -> Bool # (>) :: K a b -> K a b -> Bool # (>=) :: K a b -> K a b -> Bool # max :: K a b -> K a b -> K a b # min :: K a b -> K a b -> K a b #
Read a => Read (K a b) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods readsPrec :: Int -> ReadS (K a b) # readList :: ReadS [K a b] # readPrec :: ReadPrec (K a b) # readListPrec :: ReadPrec [K a b] #
Show a => Show (K a b) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods showsPrec :: Int -> K a b -> ShowS # show :: K a b -> String # showList :: [K a b] -> ShowS #
Generic (K a b) Source #
Instance details Defined in Generics.SOP.BasicFunctors Associated Types type Rep (K a b) :: * -> * # Methods from :: K a b -> Rep (K a b) x # to :: Rep (K a b) x -> K a b #
NFData a => NFData (K a b) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods rnf :: K a b -> () #
HasDatatypeInfo (K a b) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (K a b) :: [[*]] Source # Methods from :: K a b -> Rep (K a b) Source # to :: Rep (K a b) -> K a b Source #
type Rep (K a b) Source #
Instance details Defined in Generics.SOP.BasicFunctors type Rep (K a b) = D1 (MetaData "K" "Generics.SOP.BasicFunctors" "generics-sop-0.3.2.0-5JX38dNigUk7e65oSELmom" True) (C1 (MetaCons "K" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type DatatypeInfoOf (K a b) Source #
Instance details Defined in Generics.SOP.Instances type DatatypeInfoOf (K a b) = Newtype "Generics.SOP.BasicFunctors" "K" (Constructor "K")
type Code (K a b) Source #
Instance details Defined in Generics.SOP.Instances type Code (K a b) = (a ': ([] :: [])) ': ([] :: [[]])

unK :: K a b -> a Source #

Extract the contents of a K value.

newtype I (a :: *) Source #

The identity type functor.

Like Identity, but with a shorter name.

Constructors

I a

Instances

Monad I Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods (>>=) :: I a -> (a -> I b) -> I b # (>>) :: I a -> I b -> I b # return :: a -> I a # fail :: String -> I a #
Functor I Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods fmap :: (a -> b) -> I a -> I b # (<$) :: a -> I b -> I a #
Applicative I Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods pure :: a -> I a # (<>) :: I (a -> b) -> I a -> I b # liftA2 :: (a -> b -> c) -> I a -> I b -> I c # (>) :: I a -> I b -> I b # (<*) :: I a -> I b -> I a #
Foldable I Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods fold :: Monoid m => I m -> m # foldMap :: Monoid m => (a -> m) -> I a -> m # foldr :: (a -> b -> b) -> b -> I a -> b # foldr' :: (a -> b -> b) -> b -> I a -> b # foldl :: (b -> a -> b) -> b -> I a -> b # foldl' :: (b -> a -> b) -> b -> I a -> b # foldr1 :: (a -> a -> a) -> I a -> a # foldl1 :: (a -> a -> a) -> I a -> a # toList :: I a -> [a] # null :: I a -> Bool # length :: I a -> Int # elem :: Eq a => a -> I a -> Bool # maximum :: Ord a => I a -> a # minimum :: Ord a => I a -> a # sum :: Num a => I a -> a # product :: Num a => I a -> a #
Traversable I Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods traverse :: Applicative f => (a -> f b) -> I a -> f (I b) # sequenceA :: Applicative f => I (f a) -> f (I a) # mapM :: Monad m => (a -> m b) -> I a -> m (I b) # sequence :: Monad m => I (m a) -> m (I a) #
Eq1 I Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftEq :: (a -> b -> Bool) -> I a -> I b -> Bool #
Ord1 I Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftCompare :: (a -> b -> Ordering) -> I a -> I b -> Ordering #
Read1 I Source #	Since: 0.2.4.0
Instance details Defined in Generics.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 Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> I a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [I a] -> ShowS #
NFData1 I Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftRnf :: (a -> ()) -> I a -> () #
Eq a => Eq (I a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods (==) :: I a -> I a -> Bool # (/=) :: I a -> I a -> Bool #
Ord a => Ord (I a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods compare :: I a -> I a -> Ordering # (<) :: I a -> I a -> Bool # (<=) :: I a -> I a -> Bool # (>) :: I a -> I a -> Bool # (>=) :: I a -> I a -> Bool # max :: I a -> I a -> I a # min :: I a -> I a -> I a #
Read a => Read (I a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods readsPrec :: Int -> ReadS (I a) # readList :: ReadS [I a] # readPrec :: ReadPrec (I a) # readListPrec :: ReadPrec [I a] #
Show a => Show (I a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods showsPrec :: Int -> I a -> ShowS # show :: I a -> String # showList :: [I a] -> ShowS #
Generic (I a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Associated Types type Rep (I a) :: * -> * # Methods from :: I a -> Rep (I a) x # to :: Rep (I a) x -> I a #
NFData a => NFData (I a) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods rnf :: I a -> () #
HasDatatypeInfo (I a) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (I a) :: [[*]] Source # Methods from :: I a -> Rep (I a) Source # to :: Rep (I a) -> I a Source #
type Rep (I a) Source #
Instance details Defined in Generics.SOP.BasicFunctors type Rep (I a) = D1 (MetaData "I" "Generics.SOP.BasicFunctors" "generics-sop-0.3.2.0-5JX38dNigUk7e65oSELmom" True) (C1 (MetaCons "I" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 a)))
type DatatypeInfoOf (I a) Source #
Instance details Defined in Generics.SOP.Instances type DatatypeInfoOf (I a) = Newtype "Generics.SOP.BasicFunctors" "I" (Constructor "I")
type Code (I a) Source #
Instance details Defined in Generics.SOP.Instances type Code (I a) = (a ': ([] :: [])) ': ([] :: [[]])

unI :: I a -> a Source #

Extract the contents of an I value.

newtype ((f :: l -> *) :.: (g :: k -> l)) (p :: k) 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) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods fmap :: (a -> b) -> (f :.: g) a -> (f :.: g) b # (<$) :: a -> (f :.: g) b -> (f :.: g) a #
(Applicative f, Applicative g) => Applicative (f :.: g) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods pure :: a -> (f :.: g) a # (<>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b # liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c # (>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b # (<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a #
(Foldable f, Foldable g) => Foldable (f :.: g) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods fold :: Monoid m => (f :.: g) m -> m # foldMap :: Monoid m => (a -> m) -> (f :.: g) a -> m # foldr :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldr' :: (a -> b -> b) -> b -> (f :.: g) a -> b # foldl :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldl' :: (b -> a -> b) -> b -> (f :.: g) a -> b # foldr1 :: (a -> a -> a) -> (f :.: g) a -> a # foldl1 :: (a -> a -> a) -> (f :.: g) a -> a # toList :: (f :.: g) a -> [a] # null :: (f :.: g) a -> Bool # length :: (f :.: g) a -> Int # elem :: Eq a => a -> (f :.: g) a -> Bool # maximum :: Ord a => (f :.: g) a -> a # minimum :: Ord a => (f :.: g) a -> a # sum :: Num a => (f :.: g) a -> a # product :: Num a => (f :.: g) a -> a #
(Traversable f, Traversable g) => Traversable (f :.: g) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods traverse :: Applicative f0 => (a -> f0 b) -> (f :.: g) a -> f0 ((f :.: g) b) # sequenceA :: Applicative f0 => (f :.: g) (f0 a) -> f0 ((f :.: g) a) # mapM :: Monad m => (a -> m b) -> (f :.: g) a -> m ((f :.: g) b) # sequence :: Monad m => (f :.: g) (m a) -> m ((f :.: g) a) #
(Eq1 f, Eq1 g) => Eq1 (f :.: g) Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftEq :: (a -> b -> Bool) -> (f :.: g) a -> (f :.: g) b -> Bool #
(Ord1 f, Ord1 g) => Ord1 (f :.: g) Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftCompare :: (a -> b -> Ordering) -> (f :.: g) a -> (f :.: g) b -> Ordering #
(Read1 f, Read1 g) => Read1 (f :.: g) Source #	Since: 0.2.4.0
Instance details Defined in Generics.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) Source #	Since: 0.2.4.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> (f :.: g) a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [(f :.: g) a] -> ShowS #
(NFData1 f, NFData1 g) => NFData1 (f :.: g) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods liftRnf :: (a -> ()) -> (f :.: g) a -> () #
(Eq1 f, Eq1 g, Eq a) => Eq ((f :.: g) a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods (==) :: (f :.: g) a -> (f :.: g) a -> Bool # (/=) :: (f :.: g) a -> (f :.: g) a -> Bool #
(Ord1 f, Ord1 g, Ord a) => Ord ((f :.: g) a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods compare :: (f :.: g) a -> (f :.: g) a -> Ordering # (<) :: (f :.: g) a -> (f :.: g) a -> Bool # (<=) :: (f :.: g) a -> (f :.: g) a -> Bool # (>) :: (f :.: g) a -> (f :.: g) a -> Bool # (>=) :: (f :.: g) a -> (f :.: g) a -> Bool # max :: (f :.: g) a -> (f :.: g) a -> (f :.: g) a # min :: (f :.: g) a -> (f :.: g) a -> (f :.: g) a #
(Read1 f, Read1 g, Read a) => Read ((f :.: g) a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods readsPrec :: Int -> ReadS ((f :.: g) a) # readList :: ReadS [(f :.: g) a] # readPrec :: ReadPrec ((f :.: g) a) # readListPrec :: ReadPrec [(f :.: g) a] #
(Show1 f, Show1 g, Show a) => Show ((f :.: g) a) Source #
Instance details Defined in Generics.SOP.BasicFunctors Methods showsPrec :: Int -> (f :.: g) a -> ShowS # show :: (f :.: g) a -> String # showList :: [(f :.: g) a] -> ShowS #
Generic ((f :.: g) p) Source #
Instance details Defined in Generics.SOP.BasicFunctors Associated Types type Rep ((f :.: g) p) :: * -> * # Methods from :: (f :.: g) p -> Rep ((f :.: g) p) x # to :: Rep ((f :.: g) p) x -> (f :.: g) p #
NFData (f (g a)) => NFData ((f :.: g) a) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.BasicFunctors Methods rnf :: (f :.: g) a -> () #
HasDatatypeInfo ((f :.: g) p) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type Code ((f :.: g) p) :: [[*]] Source # Methods from :: (f :.: g) p -> Rep ((f :.: g) p) Source # to :: Rep ((f :.: g) p) -> (f :.: g) p Source #
type Rep ((f :.: g) p) Source #
Instance details Defined in Generics.SOP.BasicFunctors type Rep ((f :.: g) p) = D1 (MetaData ":.:" "Generics.SOP.BasicFunctors" "generics-sop-0.3.2.0-5JX38dNigUk7e65oSELmom" True) (C1 (MetaCons "Comp" PrefixI False) (S1 (MetaSel (Nothing :: Maybe Symbol) NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (f (g p)))))
type DatatypeInfoOf ((f :.: g) p) Source #
Instance details Defined in Generics.SOP.Instances type DatatypeInfoOf ((f :.: g) p) = Newtype "Generics.SOP.BasicFunctors" ":.:" (Constructor "Comp")
type Code ((f :.: g) p) Source #
Instance details Defined in Generics.SOP.Instances type Code ((f :.: g) p) = (f (g p) ': ([] :: [])) ': ([] :: [[]])

unComp :: (f :.: g) p -> f (g p) Source #

Extract the contents of a Comp value.

Mapping functions

mapII :: (a -> b) -> I a -> I b Source #

Lift the given function.

Since: 0.2.5.0

mapIK :: (a -> b) -> I a -> K b c Source #

Lift the given function.

Since: 0.2.5.0

mapKI :: (a -> b) -> K a c -> I b Source #

Lift the given function.

Since: 0.2.5.0

mapKK :: (a -> b) -> K a c -> K b d Source #

Lift the given function.

Since: 0.2.5.0

mapIII :: (a -> b -> c) -> I a -> I b -> I c Source #

Lift the given function.

Since: 0.2.5.0

mapIIK :: (a -> b -> c) -> I a -> I b -> K c d Source #

Lift the given function.

Since: 0.2.5.0

mapIKI :: (a -> b -> c) -> I a -> K b d -> I c Source #

Lift the given function.

Since: 0.2.5.0

mapIKK :: (a -> b -> c) -> I a -> K b d -> K c e Source #

Lift the given function.

Since: 0.2.5.0

mapKII :: (a -> b -> c) -> K a d -> I b -> I c Source #

Lift the given function.

Since: 0.2.5.0

mapKIK :: (a -> b -> c) -> K a d -> I b -> K c e Source #

Lift the given function.

Since: 0.2.5.0

mapKKI :: (a -> b -> c) -> K a d -> K b e -> I c Source #

Lift the given function.

Since: 0.2.5.0

mapKKK :: (a -> b -> c) -> K a d -> K b e -> K c f Source #

Lift the given function.

Since: 0.2.5.0

Mapping constraints

class (AllF f xs, SListI xs) => All (f :: 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.

Instances

(AllF f xs, SListI xs) => All (f :: k -> Constraint) (xs :: [k]) Source #
Instance details Defined in Generics.SOP.Constraint

class (AllF (All f) xss, SListI xss) => All2 f xss 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 innert 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.

Instances

(AllF (All f) xss, SListI xss) => All2 (f :: k -> Constraint) (xss :: [[k]]) Source #
Instance details Defined in Generics.SOP.Constraint

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 for pointwise for every pair of elements from two lists.

Example: The constraint

All (~) '[ Int, Bool, Char ] '[ a, b, c ]

is equivalent to the constraint

(Int ~ a, Bool ~ b, Char ~ c)

Since: 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]) Source #
Instance details Defined in Generics.SOP.Constraint

class (AllZipF (AllZip f) xss yss, SListI xss, SListI yss, SameShapeAs xss yss, SameShapeAs yss xss) => AllZip2 f xss yss Source #

Require a constraint for pointwise for every pair of elements from two lists of lists.

Instances

(AllZipF (AllZip f) xss yss, SListI xss, SListI yss, SameShapeAs xss yss, SameShapeAs yss xss) => AllZip2 (f :: a -> b -> Constraint) (xss :: [[a]]) (yss :: [[b]]) Source #
Instance details Defined in Generics.SOP.Constraint

type family AllN (h :: (k -> *) -> l -> *) (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 (NP :: (k -> ) -> [k] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllN (NP :: (k -> ) -> [k] -> ) (c :: k -> Constraint) = All c
type AllN (POP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllN (POP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) = All2 c
type AllN (NS :: (k -> ) -> [k] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NS type AllN (NS :: (k -> ) -> [k] -> ) (c :: k -> Constraint) = All c
type AllN (SOP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NS type AllN (SOP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) = All2 c

type family AllZipN (h :: (k -> *) -> l -> *) (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 (NP :: (k -> ) -> [k] -> ) (c :: a -> b -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllZipN (NP :: (k -> ) -> [k] -> ) (c :: a -> b -> Constraint) = AllZip c
type AllZipN (POP :: (k -> ) -> [[k]] -> ) (c :: a -> b -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllZipN (POP :: (k -> ) -> [[k]] -> ) (c :: a -> b -> Constraint) = AllZip2 c

Other constraints

class f (g x) => Compose f g x infixr 9 Source #

Composition of constraints.

Note that the result of the composition must be a constraint, and therefore, in f :. g, the kind of f is k -> Constraint. The kind of g, however, is l -> k and can thus be an normal type constructor.

A typical use case is in connection with All on an NP or an NS. For example, in order to denote that all elements on an NP f xs satisfy Show, we can say All (Show :. f) xs.

Since: 0.2

Instances

f (g x) => Compose (f :: k2 -> Constraint) (g :: k1 -> k2) (x :: k1) Source #
Instance details Defined in Generics.SOP.Constraint

class (f x, g x) => And f g x infixl 7 Source #

Pairing of constraints.

Since: 0.2

Instances

(f x, g x) => And (f :: k -> Constraint) (g :: k -> Constraint) (x :: k) Source #
Instance details Defined in Generics.SOP.Constraint

class Top x Source #

A constraint that can always be satisfied.

Since: 0.2

Instances

Top (x :: k) Source #
Instance details Defined in Generics.SOP.Constraint

class Coercible (f x) (g y) => LiftedCoercible f g x y Source #

The constraint LiftedCoercible f g x y is equivalent to Coercible (f x) (g y).

Since: 0.3.1.0

Instances

Coercible (f x) (g y) => LiftedCoercible (f :: k2 -> k0) (g :: k1 -> k0) (x :: k2) (y :: k1) Source #
Instance details Defined in Generics.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.

The main use of this constraint is to help type inference to learn something about otherwise unknown type-level lists.

Since: 0.3.1.0

Equations

SameShapeAs '[] ys = ys ~ '[]
SameShapeAs (x ': xs) ys = (ys ~ (Head ys ': Tail ys), SameShapeAs xs (Tail ys))

Singletons

data SList :: [k] -> * 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: 0.2

Constructors

SNil :: SList '[]
SCons :: SListI xs => SList (x ': xs)

Instances

Eq (SList xs) Source #
Instance details Defined in Generics.SOP.Sing Methods (==) :: SList xs -> SList xs -> Bool # (/=) :: SList xs -> SList xs -> Bool #
Ord (SList xs) Source #
Instance details Defined in Generics.SOP.Sing Methods compare :: SList xs -> SList xs -> Ordering # (<) :: SList xs -> SList xs -> Bool # (<=) :: SList xs -> SList xs -> Bool # (>) :: SList xs -> SList xs -> Bool # (>=) :: SList xs -> SList xs -> Bool # max :: SList xs -> SList xs -> SList xs # min :: SList xs -> SList xs -> SList xs #
Show (SList xs) Source #
Instance details Defined in Generics.SOP.Sing Methods showsPrec :: Int -> SList xs -> ShowS # show :: SList xs -> String # showList :: [SList xs] -> ShowS #

class SListI (xs :: [k]) where 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.

The class SListI should have instances that match the constructors of SList.

Since: 0.2

Minimal complete definition

sList

Methods

sList :: SList xs Source #

Get hold of the explicit singleton (that one can then pattern match on).

Instances

SListI ([] :: [k]) Source #
Instance details Defined in Generics.SOP.Sing Methods sList :: SList [] Source #
SListI xs => SListI (x ': xs :: [k]) Source #
Instance details Defined in Generics.SOP.Sing Methods sList :: SList (x ': xs) Source #

type SListI2 = All SListI Source #

Require a singleton for every inner list in a list of lists.

type Sing = SList Source #

Deprecated: Use SList instead.

Explicit singleton type.

Just provided for limited backward compatibility.

class SListI xs => SingI (xs :: [k]) where Source #

Deprecated: Use SListI instead.

General class for implicit singletons.

Just provided for limited backward compatibility.

Minimal complete definition

sing

Methods

sing :: Sing xs Source #

Deprecated: Use sList instead.

Instances

SListI xs => SingI (xs :: [k]) Source #
Instance details Defined in Generics.SOP.Constraint Methods sing :: Sing xs Source #
(All (SListI :: [k] -> Constraint) xss, SListI xss) => SingI (xss :: [[k]]) Source #
Instance details Defined in Generics.SOP.Constraint Methods sing :: Sing xss Source #

Shape of type-level lists

data Shape :: [k] -> * where Source #

Occassionally it is useful to have an explicit, term-level, representation of type-level lists (esp because of https://ghc.haskell.org/trac/ghc/ticket/9108)

Constructors

ShapeNil :: Shape '[]
ShapeCons :: SListI xs => Shape xs -> Shape (x ': xs)

Instances

Eq (Shape xs) Source #
Instance details Defined in Generics.SOP.Sing Methods (==) :: Shape xs -> Shape xs -> Bool # (/=) :: Shape xs -> Shape xs -> Bool #
Ord (Shape xs) Source #
Instance details Defined in Generics.SOP.Sing Methods compare :: Shape xs -> Shape xs -> Ordering # (<) :: Shape xs -> Shape xs -> Bool # (<=) :: Shape xs -> Shape xs -> Bool # (>) :: Shape xs -> Shape xs -> Bool # (>=) :: Shape xs -> Shape xs -> Bool # max :: Shape xs -> Shape xs -> Shape xs # min :: Shape xs -> Shape xs -> Shape xs #
Show (Shape xs) Source #
Instance details Defined in Generics.SOP.Sing Methods showsPrec :: Int -> Shape xs -> ShowS # show :: Shape xs -> String # showList :: [Shape xs] -> ShowS #

shape :: forall (xs :: [k]). SListI xs => Shape xs Source #

The shape of a type-level list.

lengthSList :: forall (xs :: [k]) proxy. SListI xs => proxy xs -> Int Source #

The length of a type-level list.

Since: 0.2

lengthSing :: SListI xs => proxy xs -> Int Source #

Deprecated: Use lengthSList instead.

Old name for lengthSList.

Re-exports

data Proxy (t :: k) :: forall k. k -> * #

Proxy is a type that holds no data, but has a phantom parameter of arbitrary type (or even kind). Its use is to provide type information, even though there is no value available of that type (or it may be too costly to create one).

Historically, Proxy :: Proxy a is a safer alternative to the 'undefined :: a' idiom.

>>> Proxy :: Proxy (Void, Int -> Int)
Proxy

Proxy can even hold types of higher kinds,

>>> Proxy :: Proxy Either
Proxy

>>> Proxy :: Proxy Functor
Proxy

>>> Proxy :: Proxy complicatedStructure
Proxy

Constructors

Proxy

Instances

Generic1 (Proxy :: k -> *)
Instance details Defined in GHC.Generics Associated Types type Rep1 Proxy :: k -> * # Methods from1 :: Proxy a -> Rep1 Proxy a # to1 :: Rep1 Proxy a -> Proxy a #
Monad (Proxy :: * -> *)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (>>=) :: Proxy a -> (a -> Proxy b) -> Proxy b # (>>) :: Proxy a -> Proxy b -> Proxy b # return :: a -> Proxy a # fail :: String -> Proxy a #
Functor (Proxy :: * -> *)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods fmap :: (a -> b) -> Proxy a -> Proxy b # (<$) :: a -> Proxy b -> Proxy a #
Applicative (Proxy :: * -> *)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a # (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b # liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c # (>) :: Proxy a -> Proxy b -> Proxy b # (<*) :: Proxy a -> Proxy b -> Proxy a #
Foldable (Proxy :: * -> *)	Since: base-4.7.0.0
Instance details 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 # toList :: Proxy a -> [a] # null :: Proxy a -> Bool # length :: Proxy a -> Int # elem :: Eq a => a -> Proxy a -> Bool # maximum :: Ord a => Proxy a -> a # minimum :: Ord a => Proxy a -> a # sum :: Num a => Proxy a -> a # product :: Num a => Proxy a -> a #
Traversable (Proxy :: * -> *)	Since: base-4.7.0.0
Instance details Defined in Data.Traversable Methods traverse :: Applicative f => (a -> f b) -> Proxy a -> f (Proxy b) # sequenceA :: Applicative f => Proxy (f a) -> f (Proxy a) # mapM :: Monad m => (a -> m b) -> Proxy a -> m (Proxy b) # sequence :: Monad m => Proxy (m a) -> m (Proxy a) #
Eq1 (Proxy :: * -> *)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftEq :: (a -> b -> Bool) -> Proxy a -> Proxy b -> Bool #
Ord1 (Proxy :: * -> *)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftCompare :: (a -> b -> Ordering) -> Proxy a -> Proxy b -> Ordering #
Read1 (Proxy :: * -> *)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftReadsPrec :: (Int -> ReadS a) -> ReadS [a] -> Int -> ReadS (Proxy a) # liftReadList :: (Int -> ReadS a) -> ReadS [a] -> ReadS [Proxy a] # liftReadPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec (Proxy a) # liftReadListPrec :: ReadPrec a -> ReadPrec [a] -> ReadPrec [Proxy a] #
Show1 (Proxy :: * -> *)	Since: base-4.9.0.0
Instance details Defined in Data.Functor.Classes Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> Proxy a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [Proxy a] -> ShowS #
Alternative (Proxy :: * -> *)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods empty :: Proxy a # (<\|>) :: Proxy a -> Proxy a -> Proxy a # some :: Proxy a -> Proxy [a] # many :: Proxy a -> Proxy [a] #
MonadPlus (Proxy :: * -> *)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods mzero :: Proxy a # mplus :: Proxy a -> Proxy a -> Proxy a #
NFData1 (Proxy :: * -> *)	Since: deepseq-1.4.3.0
Instance details Defined in Control.DeepSeq Methods liftRnf :: (a -> ()) -> Proxy a -> () #
Bounded (Proxy t)
Instance details Defined in Data.Proxy Methods minBound :: Proxy t # maxBound :: Proxy t #
Enum (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods succ :: Proxy s -> Proxy s # pred :: Proxy s -> Proxy s # toEnum :: Int -> Proxy s # fromEnum :: Proxy s -> Int # enumFrom :: Proxy s -> [Proxy s] # enumFromThen :: Proxy s -> Proxy s -> [Proxy s] # enumFromTo :: Proxy s -> Proxy s -> [Proxy s] # enumFromThenTo :: Proxy s -> Proxy s -> Proxy s -> [Proxy s] #
Eq (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods (==) :: Proxy s -> Proxy s -> Bool # (/=) :: Proxy s -> Proxy s -> Bool #
Data t => Data (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Data Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Proxy t -> c (Proxy t) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Proxy t) # toConstr :: Proxy t -> Constr # dataTypeOf :: Proxy t -> DataType # dataCast1 :: Typeable t0 => (forall d. Data d => c (t0 d)) -> Maybe (c (Proxy t)) # dataCast2 :: Typeable t0 => (forall d e. (Data d, Data e) => c (t0 d e)) -> Maybe (c (Proxy t)) # gmapT :: (forall b. Data b => b -> b) -> Proxy t -> Proxy t # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Proxy t -> r # gmapQ :: (forall d. Data d => d -> u) -> Proxy t -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Proxy t -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Proxy t -> m (Proxy t) #
Ord (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods compare :: Proxy s -> Proxy s -> Ordering # (<) :: Proxy s -> Proxy s -> Bool # (<=) :: Proxy s -> Proxy s -> Bool # (>) :: Proxy s -> Proxy s -> Bool # (>=) :: Proxy s -> Proxy s -> Bool # max :: Proxy s -> Proxy s -> Proxy s # min :: Proxy s -> Proxy s -> Proxy s #
Read (Proxy t)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods readsPrec :: Int -> ReadS (Proxy t) # readList :: ReadS [Proxy t] # readPrec :: ReadPrec (Proxy t) # readListPrec :: ReadPrec [Proxy t] #
Show (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods showsPrec :: Int -> Proxy s -> ShowS # show :: Proxy s -> String # showList :: [Proxy s] -> ShowS #
Ix (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods range :: (Proxy s, Proxy s) -> [Proxy s] # index :: (Proxy s, Proxy s) -> Proxy s -> Int # unsafeIndex :: (Proxy s, Proxy s) -> Proxy s -> Int inRange :: (Proxy s, Proxy s) -> Proxy s -> Bool # rangeSize :: (Proxy s, Proxy s) -> Int # unsafeRangeSize :: (Proxy s, Proxy s) -> Int
Generic (Proxy t)
Instance details Defined in GHC.Generics Associated Types type Rep (Proxy t) :: * -> * # Methods from :: Proxy t -> Rep (Proxy t) x # to :: Rep (Proxy t) x -> Proxy t #
Semigroup (Proxy s)	Since: base-4.9.0.0
Instance details Defined in Data.Proxy Methods (<>) :: Proxy s -> Proxy s -> Proxy s # sconcat :: NonEmpty (Proxy s) -> Proxy s # stimes :: Integral b => b -> Proxy s -> Proxy s #
Monoid (Proxy s)	Since: base-4.7.0.0
Instance details Defined in Data.Proxy Methods mempty :: Proxy s # mappend :: Proxy s -> Proxy s -> Proxy s # mconcat :: [Proxy s] -> Proxy s #
NFData (Proxy a)	Since: deepseq-1.4.0.0
Instance details Defined in Control.DeepSeq Methods rnf :: Proxy a -> () #
HasDatatypeInfo (Proxy t) Source #
Instance details 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 #
Instance details Defined in Generics.SOP.Instances Associated Types type Code (Proxy t) :: [[*]] Source # Methods from :: Proxy t -> Rep (Proxy t) Source # to :: Rep (Proxy t) -> Proxy t Source #
type Rep1 (Proxy :: k -> *)
Instance details Defined in GHC.Generics type Rep1 (Proxy :: k -> ) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: k -> ))
type Rep (Proxy t)
Instance details Defined in GHC.Generics type Rep (Proxy t) = D1 (MetaData "Proxy" "Data.Proxy" "base" False) (C1 (MetaCons "Proxy" PrefixI False) (U1 :: * -> *))
type DatatypeInfoOf (Proxy t) Source #
Instance details Defined in Generics.SOP.Instances type DatatypeInfoOf (Proxy t) = ADT "Data.Proxy" "Proxy" (Constructor "Proxy" ': ([] :: [ConstructorInfo]))
type Code (Proxy t) Source #
Instance details Defined in Generics.SOP.Instances type Code (Proxy t) = ([] :: []) ': ([] :: [[]])

HTrans (NP :: (k1 -> ) -> [k1] -> ) (NP :: (k2 -> ) -> [k2] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods htrans :: AllZipN (Prod NP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> NP f xs -> NP g ys Source # hcoerce :: (AllZipN (Prod NP) (LiftedCoercible f g) xs ys, HTrans NP NP) => NP f xs -> NP g ys Source #
HSequence (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.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 #
HTraverse_ (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hctraverse_ :: (AllN NP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NP f xs -> g () Source # htraverse_ :: (SListIN NP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NP f xs -> g () Source #
HCollapse (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hcollapse :: SListIN NP xs => NP (K a) xs -> CollapseTo NP a Source #
HAp (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hap :: Prod NP (f -.-> g) xs -> NP f xs -> NP g xs Source #
HPure (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hpure :: SListIN NP xs => (forall (a :: k0). f a) -> NP f xs Source # hcpure :: AllN NP c xs => proxy c -> (forall (a :: k0). c a => f a) -> NP f xs Source #
All (Compose Eq f) xs => Eq (NP f xs) Source #
Instance details Defined in Generics.SOP.NP Methods (==) :: NP f xs -> NP f xs -> Bool # (/=) :: NP f xs -> NP f xs -> Bool #
(All (Compose Eq f) xs, All (Compose Ord f) xs) => Ord (NP f xs) Source #
Instance details Defined in Generics.SOP.NP Methods compare :: NP f xs -> NP f xs -> Ordering # (<) :: NP f xs -> NP f xs -> Bool # (<=) :: NP f xs -> NP f xs -> Bool # (>) :: NP f xs -> NP f xs -> Bool # (>=) :: NP f xs -> NP f xs -> Bool # max :: NP f xs -> NP f xs -> NP f xs # min :: NP f xs -> NP f xs -> NP f xs #
All (Compose Show f) xs => Show (NP f xs) Source #
Instance details Defined in Generics.SOP.NP Methods showsPrec :: Int -> NP f xs -> ShowS # show :: NP f xs -> String # showList :: [NP f xs] -> ShowS #
All (Compose NFData f) xs => NFData (NP f xs) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.NP Methods rnf :: NP f xs -> () #
type AllZipN (NP :: (k -> ) -> [k] -> ) (c :: a -> b -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllZipN (NP :: (k -> ) -> [k] -> ) (c :: a -> b -> Constraint) = AllZip c
type Same (NP :: (k1 -> ) -> [k1] -> ) Source #
Instance details Defined in Generics.SOP.NP type Same (NP :: (k1 -> ) -> [k1] -> ) = (NP :: (k2 -> ) -> [k2] -> )
type SListIN (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP type SListIN (NP :: (k -> ) -> [k] -> ) = (SListI :: [k] -> Constraint)
type UnProd (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type UnProd (NP :: (k -> ) -> [k] -> ) = (NS :: (k -> ) -> [k] -> )
type Prod (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP type Prod (NP :: (k -> ) -> [k] -> ) = (NP :: (k -> ) -> [k] -> )
type AllN (NP :: (k -> ) -> [k] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllN (NP :: (k -> ) -> [k] -> ) (c :: k -> Constraint) = All c
type CollapseTo (NP :: (k -> ) -> [k] -> ) a Source #
Instance details Defined in Generics.SOP.NP type CollapseTo (NP :: (k -> ) -> [k] -> ) a = [a]

HTrans (NS :: (k1 -> ) -> [k1] -> ) (NS :: (k2 -> ) -> [k2] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods htrans :: AllZipN (Prod NS) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> NS f xs -> NS g ys Source # hcoerce :: (AllZipN (Prod NS) (LiftedCoercible f g) xs ys, HTrans NS NS) => NS f xs -> NS g ys Source #
HExpand (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hexpand :: SListIN (Prod NS) xs => (forall (x :: k0). f x) -> NS f xs -> Prod NS f xs Source # hcexpand :: AllN (Prod NS) c xs => proxy c -> (forall (x :: k0). c x => f x) -> NS f xs -> Prod NS f xs Source #
HApInjs (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hapInjs :: SListIN NS xs => Prod NS f xs -> [NS f xs] Source #
HIndex (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hindex :: NS f xs -> Int Source #
HSequence (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.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 #
HTraverse_ (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hctraverse_ :: (AllN NS c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> NS f xs -> g () Source # htraverse_ :: (SListIN NS xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> NS f xs -> g () Source #
HCollapse (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hcollapse :: SListIN NS xs => NS (K a) xs -> CollapseTo NS a Source #
HAp (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hap :: Prod NS (f -.-> g) xs -> NS f xs -> NS g xs Source #
All (Compose Eq f) xs => Eq (NS f xs) Source #
Instance details Defined in Generics.SOP.NS Methods (==) :: NS f xs -> NS f xs -> Bool # (/=) :: NS f xs -> NS f xs -> Bool #
(All (Compose Eq f) xs, All (Compose Ord f) xs) => Ord (NS f xs) Source #
Instance details Defined in Generics.SOP.NS Methods compare :: NS f xs -> NS f xs -> Ordering # (<) :: NS f xs -> NS f xs -> Bool # (<=) :: NS f xs -> NS f xs -> Bool # (>) :: NS f xs -> NS f xs -> Bool # (>=) :: NS f xs -> NS f xs -> Bool # max :: NS f xs -> NS f xs -> NS f xs # min :: NS f xs -> NS f xs -> NS f xs #
All (Compose Show f) xs => Show (NS f xs) Source #
Instance details Defined in Generics.SOP.NS Methods showsPrec :: Int -> NS f xs -> ShowS # show :: NS f xs -> String # showList :: [NS f xs] -> ShowS #
All (Compose NFData f) xs => NFData (NS f xs) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.NS Methods rnf :: NS f xs -> () #
type Same (NS :: (k1 -> ) -> [k1] -> ) Source #
Instance details Defined in Generics.SOP.NS type Same (NS :: (k1 -> ) -> [k1] -> ) = (NS :: (k2 -> ) -> [k2] -> )
type SListIN (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type SListIN (NS :: (k -> ) -> [k] -> ) = (SListI :: [k] -> Constraint)
type Prod (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type Prod (NS :: (k -> ) -> [k] -> ) = (NP :: (k -> ) -> [k] -> )
type AllN (NS :: (k -> ) -> [k] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NS type AllN (NS :: (k -> ) -> [k] -> ) (c :: k -> Constraint) = All c
type CollapseTo (NS :: (k -> ) -> [k] -> ) a Source #
Instance details Defined in Generics.SOP.NS type CollapseTo (NS :: (k -> ) -> [k] -> ) a = a

HTrans (SOP :: (k1 -> ) -> [[k1]] -> ) (SOP :: (k2 -> ) -> [[k2]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods htrans :: AllZipN (Prod SOP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> SOP f xs -> SOP g ys Source # hcoerce :: (AllZipN (Prod SOP) (LiftedCoercible f g) xs ys, HTrans SOP SOP) => SOP f xs -> SOP g ys Source #
HExpand (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hexpand :: SListIN (Prod SOP) xs => (forall (x :: k0). f x) -> SOP f xs -> Prod SOP f xs Source # hcexpand :: AllN (Prod SOP) c xs => proxy c -> (forall (x :: k0). c x => f x) -> SOP f xs -> Prod SOP f xs Source #
HApInjs (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hapInjs :: SListIN SOP xs => Prod SOP f xs -> [SOP f xs] Source #
HIndex (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hindex :: SOP f xs -> Int Source #
HSequence (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.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 #
HTraverse_ (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hctraverse_ :: (AllN SOP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> SOP f xs -> g () Source # htraverse_ :: (SListIN SOP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> SOP f xs -> g () Source #
HCollapse (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hcollapse :: SListIN SOP xs => SOP (K a) xs -> CollapseTo SOP a Source #
HAp (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS Methods hap :: Prod SOP (f -.-> g) xs -> SOP f xs -> SOP g xs Source #
Eq (NS (NP f) xss) => Eq (SOP f xss) Source #
Instance details Defined in Generics.SOP.NS Methods (==) :: SOP f xss -> SOP f xss -> Bool # (/=) :: SOP f xss -> SOP f xss -> Bool #
Ord (NS (NP f) xss) => Ord (SOP f xss) Source #
Instance details Defined in Generics.SOP.NS Methods compare :: SOP f xss -> SOP f xss -> Ordering # (<) :: SOP f xss -> SOP f xss -> Bool # (<=) :: SOP f xss -> SOP f xss -> Bool # (>) :: SOP f xss -> SOP f xss -> Bool # (>=) :: SOP f xss -> SOP f xss -> Bool # max :: SOP f xss -> SOP f xss -> SOP f xss # min :: SOP f xss -> SOP f xss -> SOP f xss #
Show (NS (NP f) xss) => Show (SOP f xss) Source #
Instance details Defined in Generics.SOP.NS Methods showsPrec :: Int -> SOP f xss -> ShowS # show :: SOP f xss -> String # showList :: [SOP f xss] -> ShowS #
NFData (NS (NP f) xss) => NFData (SOP f xss) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.NS Methods rnf :: SOP f xss -> () #
type Same (SOP :: (k1 -> ) -> [[k1]] -> ) Source #
Instance details Defined in Generics.SOP.NS type Same (SOP :: (k1 -> ) -> [[k1]] -> ) = (SOP :: (k2 -> ) -> [[k2]] -> )
type SListIN (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type SListIN (SOP :: (k -> ) -> [[k]] -> ) = (SListI2 :: [[k]] -> Constraint)
type Prod (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type Prod (SOP :: (k -> ) -> [[k]] -> ) = (POP :: (k -> ) -> [[k]] -> )
type AllN (SOP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NS type AllN (SOP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) = All2 c
type CollapseTo (SOP :: (k -> ) -> [[k]] -> ) a Source #
Instance details Defined in Generics.SOP.NS type CollapseTo (SOP :: (k -> ) -> [[k]] -> ) a = [a]

HTrans (POP :: (k1 -> ) -> [[k1]] -> ) (POP :: (k2 -> ) -> [[k2]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods htrans :: AllZipN (Prod POP) c xs ys => proxy c -> (forall (x :: k10) (y :: k20). c x y => f x -> g y) -> POP f xs -> POP g ys Source # hcoerce :: (AllZipN (Prod POP) (LiftedCoercible f g) xs ys, HTrans POP POP) => POP f xs -> POP g ys Source #
HSequence (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.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 #
HTraverse_ (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hctraverse_ :: (AllN POP c xs, Applicative g) => proxy c -> (forall (a :: k0). c a => f a -> g ()) -> POP f xs -> g () Source # htraverse_ :: (SListIN POP xs, Applicative g) => (forall (a :: k0). f a -> g ()) -> POP f xs -> g () Source #
HCollapse (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hcollapse :: SListIN POP xs => POP (K a) xs -> CollapseTo POP a Source #
HAp (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hap :: Prod POP (f -.-> g) xs -> POP f xs -> POP g xs Source #
HPure (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP Methods hpure :: SListIN POP xs => (forall (a :: k0). f a) -> POP f xs Source # hcpure :: AllN POP c xs => proxy c -> (forall (a :: k0). c a => f a) -> POP f xs Source #
Eq (NP (NP f) xss) => Eq (POP f xss) Source #
Instance details Defined in Generics.SOP.NP Methods (==) :: POP f xss -> POP f xss -> Bool # (/=) :: POP f xss -> POP f xss -> Bool #
Ord (NP (NP f) xss) => Ord (POP f xss) Source #
Instance details Defined in Generics.SOP.NP Methods compare :: POP f xss -> POP f xss -> Ordering # (<) :: POP f xss -> POP f xss -> Bool # (<=) :: POP f xss -> POP f xss -> Bool # (>) :: POP f xss -> POP f xss -> Bool # (>=) :: POP f xss -> POP f xss -> Bool # max :: POP f xss -> POP f xss -> POP f xss # min :: POP f xss -> POP f xss -> POP f xss #
Show (NP (NP f) xss) => Show (POP f xss) Source #
Instance details Defined in Generics.SOP.NP Methods showsPrec :: Int -> POP f xss -> ShowS # show :: POP f xss -> String # showList :: [POP f xss] -> ShowS #
NFData (NP (NP f) xss) => NFData (POP f xss) Source #	Since: 0.2.5.0
Instance details Defined in Generics.SOP.NP Methods rnf :: POP f xss -> () #
type AllZipN (POP :: (k -> ) -> [[k]] -> ) (c :: a -> b -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllZipN (POP :: (k -> ) -> [[k]] -> ) (c :: a -> b -> Constraint) = AllZip2 c
type Same (POP :: (k1 -> ) -> [[k1]] -> ) Source #
Instance details Defined in Generics.SOP.NP type Same (POP :: (k1 -> ) -> [[k1]] -> ) = (POP :: (k2 -> ) -> [[k2]] -> )
type SListIN (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP type SListIN (POP :: (k -> ) -> [[k]] -> ) = (SListI2 :: [[k]] -> Constraint)
type UnProd (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type UnProd (POP :: (k -> ) -> [[k]] -> ) = (SOP :: (k -> ) -> [[k]] -> )
type Prod (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP type Prod (POP :: (k -> ) -> [[k]] -> ) = (POP :: (k -> ) -> [[k]] -> )
type AllN (POP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) Source #
Instance details Defined in Generics.SOP.NP type AllN (POP :: (k -> ) -> [[k]] -> ) (c :: k -> Constraint) = All2 c
type CollapseTo (POP :: (k -> ) -> [[k]] -> ) a Source #
Instance details Defined in Generics.SOP.NP type CollapseTo (POP :: (k -> ) -> [[k]] -> ) a = [[a]]

type Prod (NP :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NP type Prod (NP :: (k -> ) -> [k] -> ) = (NP :: (k -> ) -> [k] -> )
type Prod (POP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NP type Prod (POP :: (k -> ) -> [[k]] -> ) = (POP :: (k -> ) -> [[k]] -> )
type Prod (NS :: (k -> ) -> [k] -> ) Source #
Instance details Defined in Generics.SOP.NS type Prod (NS :: (k -> ) -> [k] -> ) = (NP :: (k -> ) -> [k] -> )
type Prod (SOP :: (k -> ) -> [[k]] -> ) Source #
Instance details Defined in Generics.SOP.NS type Prod (SOP :: (k -> ) -> [[k]] -> ) = (POP :: (k -> ) -> [[k]] -> )

Generic programming with sums of products

Example

Instantiating a datatype for use with SOP generics

Defining a generic function

Defining a generic function using combinators

Using a generic function

More examples

Paper

Codes and interpretations

n-ary datatypes

Metadata

Combinators

Constructing products

Destructing products

Application

Lifting / mapping

Constructing sums

Destructing sums

Dealing with All c

Comparison

Collapsing

Folding and sequencing

Expanding sums to products

Transformation of index lists and coercions

Partial operations

Utilities

Basic functors

Mapping functions

Mapping constraints

Other constraints

Singletons

Shape of type-level lists

Re-exports

Dealing with `All c`