Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. map' :: (Contiguous arr1, Element arr1 b, Contiguous arr2, Element arr2 c) => (b -> c) -> arr1 b -> arr2 c

   contiguous	Data.Primitive.Contiguous

   Map strictly over the elements of an array. Note that because a new array must be created, the resulting array type can be different than the original.

2. mapAccum' :: forall arr1 arr2 a b c . (Contiguous arr1, Contiguous arr2, Element arr1 b, Element arr2 c, Monoid a) => (b -> (a, c)) -> arr1 b -> (a, arr2 c)

   contiguous	Data.Primitive.Contiguous

   No documentation available.

3. mapAccumLM' :: (Contiguous arr1, Contiguous arr2, Element arr1 b, Element arr2 c, Monad m) => (a -> b -> m (a, c)) -> a -> arr1 b -> m (a, arr2 c)

   contiguous	Data.Primitive.Contiguous

   Monadic accumulating strict left fold over the elements on an array.

4. mapM :: (Contiguous arr1, Contiguous arr2, Element arr1 a, Element arr2 b, Monad m) => (a -> m b) -> arr1 a -> m (arr2 b)

   contiguous	Data.Primitive.Contiguous

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. for a version that ignores the results see mapM_.

5. mapM_ :: (Contiguous arr, Element arr a, Element arr b, Applicative f) => (a -> f b) -> arr a -> f ()

   contiguous	Data.Primitive.Contiguous

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ = traverse_

6. mapMaybe :: forall arr1 arr2 a b . (Contiguous arr1, Element arr1 a, Contiguous arr2, Element arr2 b) => (a -> Maybe b) -> arr1 a -> arr2 b

   contiguous	Data.Primitive.Contiguous

   The mapMaybe function is a version of map which can throw out elements. In particular, the functional arguments returns something of type Maybe b. If this is Nothing, no element is added on to the result array. If it is Just b, then b is included in the result array.

7. mapMutable :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => (a -> a) -> Mutable arr (PrimState m) a -> m ()

   contiguous	Data.Primitive.Contiguous

   Map over a mutable array, modifying the elements in place.

8. mapMutable' :: forall m (arr :: Type -> Type) a . (PrimMonad m, Contiguous arr, Element arr a) => (a -> a) -> Mutable arr (PrimState m) a -> m ()

   contiguous	Data.Primitive.Contiguous

   Strictly map over a mutable array, modifying the elements in place.

9. mapOrHead :: (Num a, Eq a) => a -> (t -> b) -> [t] -> ([b] -> b) -> b

   dbus	DBus.Generation

   No documentation available.

10. mapMaybe :: Ord k => (a -> Maybe b) -> Map k a -> Map k b

    dhall	Dhall.Map

    Transform all values in a Map using the supplied function, deleting the key if the function returns Nothing

    >>> mapMaybe Data.Maybe.listToMaybe (fromList [("C",[1]),("B",[]),("A",[3])])
    fromList [("C",1),("A",3)]
    

Page 193 of many | Previous | Next