Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. suchThatMap :: Gen a -> (a -> Maybe b) -> Gen b

    tasty-quickcheck Test.Tasty.QuickCheck

    Generates a value for which the given function returns a Just, and then applies the function.

  2. ixmap :: (Ix i, Ix j) => (i, i) -> (i -> j) -> Array j e -> Array i e

    array Data.Array

    No documentation available.

  3. amap :: (IArray a e', IArray a e, Ix i) => (e' -> e) -> a i e' -> a i e

    array Data.Array.Base

    Returns a new array derived from the original array by applying a function to each of the elements.

  4. ixmap :: (IArray a e, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> a i e

    array Data.Array.Base

    Returns a new array derived from the original array by applying a function to each of the indices.

  5. amap :: (IArray a e', IArray a e, Ix i) => (e' -> e) -> a i e' -> a i e

    array Data.Array.IArray

    Returns a new array derived from the original array by applying a function to each of the elements.

  6. ixmap :: (IArray a e, Ix i, Ix j) => (i, i) -> (i -> j) -> a j e -> a i e

    array Data.Array.IArray

    Returns a new array derived from the original array by applying a function to each of the indices.

  7. gmappend :: (Generic a, GSemigroup (Rep a)) => a -> a -> a

    semigroups Data.Semigroup.Generic

    Generically generate a Semigroup (<>) operation for any type implementing Generic. This operation will append two values by point-wise appending their component fields. It is only defined for product types.

    gmappend a (gmappend b c) = gmappend (gmappend a b) c
    

  8. imapPrimArray :: (Prim a, Prim b) => (Int -> a -> b) -> PrimArray a -> PrimArray b

    primitive Data.Primitive.PrimArray

    Indexed map over the elements of a primitive array.

  9. bimap :: Bifunctor p => (a -> b) -> (c -> d) -> p a c -> p b d

    lens Control.Lens.Combinators

    Map over both arguments at the same time.

    bimap f g ≡ first f . second g
    

    Examples

    >>> bimap toUpper (+1) ('j', 3)
    ('J',4)
    
    >>> bimap toUpper (+1) (Left 'j')
    Left 'J'
    
    >>> bimap toUpper (+1) (Right 3)
    Right 4
    

  10. bimapping :: forall (f :: Type -> Type -> Type) (g :: Type -> Type -> Type) s t a b s' t' a' b' . (Bifunctor f, Bifunctor g) => AnIso s t a b -> AnIso s' t' a' b' -> Iso (f s s') (g t t') (f a a') (g b b')

    lens Control.Lens.Combinators

    Lift two Isos into both arguments of a Bifunctor.

    bimapping :: Bifunctor p => Iso s t a b -> Iso s' t' a' b' -> Iso (p s s') (p t t') (p a a') (p b b')
    bimapping :: Bifunctor p => Iso' s a -> Iso' s' a' -> Iso' (p s s') (p a a')
    

Page 416 of many | Previous | Next