Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. scatterFoldMapM :: (Foldable t, Monoid b, MonadBaseControl IO m) => TaskGroup -> t (IO a) -> (Either SomeException a -> m b) -> m b

   async-pool	Control.Concurrent.Async.Pool

   Execute a group of tasks concurrently (using up to N active threads, depending on the task group), and feed results to a continuation as soon as they become available, in random order. The continuation function may return a monoid value which is accumulated to yield a final result. If no such value is needed, simply provide ().

2. concatMapMC :: (Monad m, MonoFoldable mono) => (a -> m mono) -> ConduitT a (Element mono) m ()

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply the monadic function to each value in the stream, resulting in a foldable value (e.g., a list). Then yield each of the individual values in that foldable value separately. Generalizes concatMapM, mapMaybeM, and mapFoldableM.

3. foldMapMC :: (Monad m, Monoid w) => (a -> m w) -> ConduitT a o m w

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply the provided monadic mapping function and monoidal combine all values.

4. foldMapMCE :: (Monad m, MonoFoldable mono, Monoid w) => (Element mono -> m w) -> ConduitT mono o m w

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply the provided monadic mapping function and monoidal combine all elements in the chunked stream.

5. omapM :: (MonoTraversable mono, Applicative m) => (Element mono -> m (Element mono)) -> mono -> m mono

   classy-prelude-yesod	ClassyPrelude.Yesod

   Map each element of a monomorphic container to a monadic action, evaluate these actions from left to right, and collect the results.

6. omapMCE :: (Monad m, MonoTraversable mono) => (Element mono -> m (Element mono)) -> ConduitT mono mono m ()

   classy-prelude-yesod	ClassyPrelude.Yesod

   Apply a monadic monomorphic transformation to all elements in a chunked stream. Unlike mapME, this will work on types like ByteString and Text which are MonoFunctor but not Functor.

7. omapM_ :: (MonoFoldable mono, Applicative m) => (Element mono -> m ()) -> mono -> m ()

   classy-prelude-yesod	ClassyPrelude.Yesod

   Map each element of a monomorphic container to a monadic action, evaluate these actions from left to right, and ignore the results.

8. graphMapModify :: (UniqFM k (Node k cls color) -> UniqFM k (Node k cls color)) -> Graph k cls color -> Graph k cls color

   ghc-lib	GHC.Data.Graph.Base

   Modify the finite map holding the nodes in the graph.

9. data GLTextureBuilderGetHasMipmapMethodInfo

   gi-gdk	GI.Gdk

   No documentation available.

10. data GLTextureBuilderSetHasMipmapMethodInfo

    gi-gdk	GI.Gdk

    No documentation available.

Page 98 of many | Previous | Next