Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. pattern GL_DOT_PRODUCT_TEXTURE_CUBE_MAP_NV :: GLenum

   OpenGLRaw	Graphics.GL.Tokens

   No documentation available.

2. pattern GL_DOT_PRODUCT_TEXTURE_RECTANGLE_NV :: GLenum

   OpenGLRaw	Graphics.GL.Tokens

   No documentation available.

3. pattern GL_OP_CROSS_PRODUCT_EXT :: GLenum

   OpenGLRaw	Graphics.GL.Tokens

   No documentation available.

4. pattern GL_RGBA_UNSIGNED_DOT_PRODUCT_MAPPING_NV :: GLenum

   OpenGLRaw	Graphics.GL.Tokens

   No documentation available.

5. newtype GenericProduct a

   generic-data	Generic.Data

   Product type with generic instances of Semigroup and Monoid. This is similar to Generically in most cases, but GenericProduct also works for types T with deriving via GenericProduct U, where U is a generic product type coercible to, but distinct from T. In particular, U may not have an instance of Semigroup, which Generically requires.

   Example

   >>> import Data.Monoid (Sum(..))
   
   >>> data Point a = Point a a deriving Generic
   
   >>> :{
   newtype Vector a = Vector (Point a)
   deriving (Semigroup, Monoid)
   via GenericProduct (Point (Sum a))
   :}
   

   If it were via Generically (Point (Sum a)) instead, then Vector's mappend (the Monoid method) would be defined as Point's (<>) (the Semigroup method), which might not exist, or might not be equivalent to Vector's generic Semigroup instance, which would be unlawful.

6. GenericProduct :: a -> GenericProduct a

   generic-data	Generic.Data

   No documentation available.

7. newtype GenericProduct a

   generic-data	Generic.Data.Internal.Generically

   Product type with generic instances of Semigroup and Monoid. This is similar to Generically in most cases, but GenericProduct also works for types T with deriving via GenericProduct U, where U is a generic product type coercible to, but distinct from T. In particular, U may not have an instance of Semigroup, which Generically requires.

   Example

   >>> import Data.Monoid (Sum(..))
   
   >>> data Point a = Point a a deriving Generic
   
   >>> :{
   newtype Vector a = Vector (Point a)
   deriving (Semigroup, Monoid)
   via GenericProduct (Point (Sum a))
   :}
   

   If it were via Generically (Point (Sum a)) instead, then Vector's mappend (the Monoid method) would be defined as Point's (<>) (the Semigroup method), which might not exist, or might not be equivalent to Vector's generic Semigroup instance, which would be unlawful.

8. GenericProduct :: a -> GenericProduct a

   generic-data	Generic.Data.Internal.Generically

   No documentation available.

9. newtype GenericProduct a

   generic-data	Generic.Data.Microsurgery

   Product type with generic instances of Semigroup and Monoid. This is similar to Generically in most cases, but GenericProduct also works for types T with deriving via GenericProduct U, where U is a generic product type coercible to, but distinct from T. In particular, U may not have an instance of Semigroup, which Generically requires.

   Example

   >>> import Data.Monoid (Sum(..))
   
   >>> data Point a = Point a a deriving Generic
   
   >>> :{
   newtype Vector a = Vector (Point a)
   deriving (Semigroup, Monoid)
   via GenericProduct (Point (Sum a))
   :}
   

   If it were via Generically (Point (Sum a)) instead, then Vector's mappend (the Monoid method) would be defined as Point's (<>) (the Semigroup method), which might not exist, or might not be equivalent to Vector's generic Semigroup instance, which would be unlawful.

10. GenericProduct :: a -> GenericProduct a

    generic-data	Generic.Data.Microsurgery

    No documentation available.

Page 128 of many | Previous | Next