Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

  1. newtype Product a

    base-compat-batteries Data.Semigroup.Compat

    Monoid under multiplication.

    Product x <> Product y == Product (x * y)
    

    Examples

    >>> Product 3 <> Product 4 <> mempty
    Product {getProduct = 12}
    
    >>> mconcat [ Product n | n <- [2 .. 10]]
    Product {getProduct = 3628800}
    

  2. Product :: a -> Product a

    base-compat-batteries Data.Semigroup.Compat

    No documentation available.

  3. type Prism s t a b = forall (p :: Type -> Type -> Type) (f :: Type -> Type) . (Choice p, Applicative f) => p a f b -> p s f t

    generic-lens Data.Generics.Internal.VL

    Type alias for prism

  4. type Prism' s a = Prism s s a a

    generic-lens Data.Generics.Internal.VL

    No documentation available.

  5. module Data.Generics.Product

    Magic product operations using Generics These classes need not be instantiated manually, as GHC can automatically prove valid instances via Generics. Only the Generic class needs to be derived (see examples).

  6. module Data.Generics.Product.Param

    Derive traversals over type parameters

  7. data family Param :: Nat -> j -> k

    generic-lens Data.Generics.Product.Param

    No documentation available.

  8. module Data.Generics.Product.Positions

    Derive positional product type getters and setters generically.

  9. type family Prec' w

    generic-random Generic.Random.Internal.Generic

    No documentation available.

  10. type PixbufDestroyNotify = Ptr Word8 -> IO ()

    gi-gdkpixbuf GI.GdkPixbuf.Callbacks

    A function of this type is responsible for freeing the pixel array of a pixbuf. The pixbufNewFromData function lets you pass in a pre-allocated pixel array so that a pixbuf can be created from it; in this case you will need to pass in a function of type GdkPixbufDestroyNotify so that the pixel data can be freed when the pixbuf is finalized.

Page 362 of many | Previous | Next