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. mapMScope :: forall m (f :: Type -> Type) b d a c . (Monad m, Traversable f) => (b -> m d) -> (a -> m c) -> Scope b f a -> m (Scope d f c)

   bound	Bound.Scope.Simple

   A traverseScope that can be used when you only have a Monad instance

2. mapMScope_ :: forall m (f :: Type -> Type) b d a c . (Monad m, Foldable f) => (b -> m d) -> (a -> m c) -> Scope b f a -> m ()

   bound	Bound.Scope.Simple

   A traverseScope_ that can be used when you only have a Monad instance

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

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

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

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

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

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

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

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

Page 232 of many | Previous | Next