Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. mapScope :: forall (f :: Type -> Type) b d a c . Functor f => (b -> d) -> (a -> c) -> Scope b f a -> Scope d f c

   bound	Bound.Scope.Simple

   Perform a change of variables, reassigning both bound and free variables.

2. map2 :: Text -> Builder -> Text -> Builder -> Builder

   bytebuild	Data.Bytes.Builder.Avro

   Encode a map with exactly two key-value pairs. The keys are text. This is commonly used to encode the header in an avro file, which has a map with two keys: avro.schema and avro.codec.

3. mapErrorEffectfully :: (e1 -> ST s e2) -> Parser e1 s a -> Parser e2 s a

   bytesmith	Data.Bytes.Parser

   Effectfully adjusts the error message if an error occurs.

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

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

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

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

8. 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_

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

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

Page 229 of many | Previous | Next