Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. cmapM_ :: forall w (m :: Type -> Type) c . (Get w m c, Members w m c) => (c -> SystemT w m ()) -> SystemT w m ()

    apecs Apecs

    Monadically iterates over all entites with a cx

  2. cmapM_ :: forall w (m :: Type -> Type) c . (Get w m c, Members w m c) => (c -> SystemT w m ()) -> SystemT w m ()

    apecs Apecs.System

    Monadically iterates over all entites with a cx

  3. imapM_ :: (Vector v a, Applicative f) => (Int -> a -> f b) -> v a -> f ()

    fixed-vector Data.Vector.Fixed

    Apply monadic function to every element of the vector and its index and discard result.

  4. imapM_ :: forall (n :: PeanoNum) f a b . (ArityPeano n, Applicative f) => (Int -> a -> f b) -> ContVec n a -> f ()

    fixed-vector Data.Vector.Fixed.Cont

    Apply monadic action to each element of vector and its index and ignore result.

  5. imapM_ :: Monad m => (Int -> a -> m b) -> NonEmptyVector a -> m ()

    nonempty-vector Data.Vector.NonEmpty

    O(n) Apply the monadic action to every element of a non-emptpy vector and its index, ignoring the results 

    >>> imapM_ (\i a -> if i == 1 then P.print a else P.putStrLn "0") (unsafeFromList [1..3])
0
2
0

    >>> imapM_ (\_ _ -> Nothing) (unsafeFromList [1..3])
Nothing

  6. concurrentMapM_ :: (MonadUnliftIO m, MonadResource m) => Int -> Int -> (a -> m b) -> ConduitT a b m ()

    conduit-concurrent-map Data.Conduit.ConcurrentMap

    Deprecated: Use concurrentMapM (without _), as this function yields b; in the future, this function may be replaced by one that does not yield b

  7. concurrentMapM_numCaps :: (MonadUnliftIO m, MonadResource m) => Int -> (a -> m b) -> ConduitT a b m ()

    conduit-concurrent-map Data.Conduit.ConcurrentMap

    concurrentMapM_ with the number of threads set to getNumCapabilities. Useful when f is CPU-bound. If f is IO-bound, you probably want to use concurrentMapM_ with explicitly given amount of threads instead.

  8. mrgMapM_ :: (MonadTryMerge m, Foldable t) => (a -> m b) -> t a -> m ()

    grisette Grisette.Lib.Control.Monad

    mapM_ with MergingStrategy knowledge propagation.

  9. mrgMapM_ :: (MonadTryMerge m, Foldable t) => (a -> m b) -> t a -> m ()

    grisette Grisette.Lib.Data.Foldable

    mapM_ with MergingStrategy knowledge propagation.

  10. mrgMapM_ :: (MonadTryMerge m, Foldable t) => (a -> m b) -> t a -> m ()

    grisette Grisette.Unified.Lib.Control.Monad

    mapM_ with MergingStrategy knowledge propagation.

Page 17 of many | Previous | Next