Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. pooledMapConcurrently :: forall (es :: [Effect]) t a b . (HasCallStack, Concurrent :> es, Traversable t) => (a -> Eff es b) -> t a -> Eff es (t b)

   effectful	Effectful.Concurrent.Async

   Lifted pooledMapConcurrently.

2. pooledMapConcurrentlyN :: forall (es :: [Effect]) t a b . (HasCallStack, Concurrent :> es, Traversable t) => Int -> (a -> Eff es b) -> t a -> Eff es (t b)

   effectful	Effectful.Concurrent.Async

   Lifted pooledMapConcurrentlyN.

3. pooledMapConcurrentlyN_ :: forall (es :: [Effect]) f a b . (HasCallStack, Concurrent :> es, Foldable f) => Int -> (a -> Eff es b) -> f a -> Eff es ()

   effectful	Effectful.Concurrent.Async

   Lifted pooledMapConcurrentlyN.

4. pooledMapConcurrently_ :: forall (es :: [Effect]) f a b . (HasCallStack, Concurrent :> es, Foldable f) => (a -> Eff es b) -> f a -> Eff es ()

   effectful	Effectful.Concurrent.Async

   Lifted pooledMapConcurrently_.

5. foldMapGlobals :: Monoid m => (Qualified -> m) -> Definition -> m

   elm-syntax	Language.Elm.Definition

   No documentation available.

6. foldMapGlobals :: Monoid m => (Qualified -> m) -> Expression v -> m

   elm-syntax	Language.Elm.Expression

   No documentation available.

7. foldMapGlobals :: Monoid m => (Qualified -> m) -> Pattern v -> m

   elm-syntax	Language.Elm.Pattern

   No documentation available.

8. foldMapGlobals :: Monoid m => (Qualified -> m) -> Type v -> m

   elm-syntax	Language.Elm.Type

   No documentation available.

9. parBranchFoldMap :: NFData f => Int -> (e -> f) -> (f -> f -> f) -> Tree e a -> f

   elynx-tree	ELynx.Tree.Parallel

   Map and fold over branches. Evaluate the sub trees up to given layer in parallel.

10. parLabelFoldMap :: NFData b => Int -> (a -> b) -> (b -> b -> b) -> Tree e a -> b

    elynx-tree	ELynx.Tree.Parallel

    Map and fold over labels. Evaluate the sub trees up to given layer in parallel.

Page 981 of many | Previous | Next