Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. mapRequestHeaders :: (RequestHeaders -> RequestHeaders) -> Request -> Request

   wai	Network.Wai

   Apply the provided function to the request header list of the Request.

2. mapResponseHeaders :: (ResponseHeaders -> ResponseHeaders) -> Response -> Response

   wai	Network.Wai

   Apply the provided function to the response header list of the Response.

3. mapResponseStatus :: (Status -> Status) -> Response -> Response

   wai	Network.Wai

   Apply the provided function to the response status of the Response.

4. mapping :: forall (f :: Type -> Type) (g :: Type -> Type) s t a b . (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)

   gogol-core	Gogol.Prelude

   This can be used to lift any Iso into an arbitrary Functor.

5. mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)

   unliftio	UnliftIO.Async

   Executes a Traversable container of items concurrently, it uses the Flat type internally.

6. mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()

   unliftio	UnliftIO.Async

   Executes a Traversable container of items concurrently, it uses the Flat type internally. This function ignores the results.

7. mapExceptionM :: (Exception e1, Exception e2, MonadUnliftIO m) => (e1 -> e2) -> m a -> m a

   unliftio	UnliftIO.Exception

   Same as mapException, except works in a monadic context.

8. mapConcurrently :: (MonadUnliftIO m, Traversable t) => (a -> m b) -> t a -> m (t b)

   unliftio	UnliftIO.Internals.Async

   Executes a Traversable container of items concurrently, it uses the Flat type internally.

9. mapConcurrently_ :: (MonadUnliftIO m, Foldable f) => (a -> m b) -> f a -> m ()

   unliftio	UnliftIO.Internals.Async

   Executes a Traversable container of items concurrently, it uses the Flat type internally. This function ignores the results.

10. mapMaybe :: (MonadGen m, GenBase m ~ Identity) => (a -> Maybe b) -> m a -> m b

    hedgehog	Hedgehog.Gen

    Generates a value which is the result of the given function returning a Just. The original generator's shrink tree will be retained, with values returning Nothing removed. Subsequent shrinks of those values will be retained. Compared to mapMaybeT, shrinking may be slower but will be optimal. It's possible that the function will never return Just, or will only do so a larger size than we're currently running at. To avoid looping forever, we limit the number of retries, and grow the size with each retry. If we retry too many times then the whole generator is discarded.

Page 116 of many | Previous | Next