Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. mapped :: forall (f :: Type -> Type) a a' . Functor f => Setter (f a) (f a') a a'

    lens-family Lens.Family2.Stock

    An SEC referencing the parameter of a functor.

  2. mapConcurrently :: (Traversable t, MonadBaseControl IO m) => (a -> m b) -> t a -> m (t b)

    lifted-async Control.Concurrent.Async.Lifted

    Generalized version of mapConcurrently.

  3. mapConcurrently_ :: (Foldable t, MonadBaseControl IO m) => (a -> m b) -> t a -> m ()

    lifted-async Control.Concurrent.Async.Lifted

    Generalized version of mapConcurrently_.

  4. mapConcurrently :: (Traversable t, MonadBaseControl IO m, Forall (Pure m)) => (a -> m b) -> t a -> m (t b)

    lifted-async Control.Concurrent.Async.Lifted.Safe

    Generalized version of mapConcurrently.

  5. mapConcurrently_ :: (Foldable t, MonadBaseControl IO m, Forall (Pure m)) => (a -> m b) -> t a -> m ()

    lifted-async Control.Concurrent.Async.Lifted.Safe

    Generalized version of mapConcurrently_.

  6. mapIO :: forall r ix b r' a m . (Size r', Load r' ix a, Manifest r b, MonadUnliftIO m) => (a -> m b) -> Array r' ix a -> m (Array r ix b)

    massiv Data.Massiv.Array

    Map an IO action over an Array. Underlying computation strategy is respected and will be parallelized when requested. Unfortunately no fusion is possible and new array will be create upon each call.

  7. mapIO_ :: forall r ix e a m . (Load r ix e, MonadUnliftIO m) => (e -> m a) -> Array r ix e -> m ()

    massiv Data.Massiv.Array

    Similar to mapIO, but ignores the result of mapping action and does not create a resulting array, therefore it is faster. Use this instead of mapIO when result is irrelevant. Most importantly it will follow the iteration logic outlined by the supplied array.

  8. mapM :: forall r ix b r' a m . (Source r' a, Manifest r b, Index ix, Monad m) => (a -> m b) -> Array r' ix a -> m (Array r ix b)

    massiv Data.Massiv.Array

    Map a monadic action over an array sequentially.

  9. mapM_ :: (Source r a, Index ix, Monad m) => (a -> m b) -> Array r ix a -> m ()

    massiv Data.Massiv.Array

    Map a monadic function over an array sequentially, while discarding the result.

    Examples

    >>> import Data.Massiv.Array as A

>>> rangeStepM Par (Ix1 10) 12 60 >>= A.mapM_ print
10
22
34
46
58

  10. mapWS :: forall r ix b r' a s m . (Source r' a, Manifest r b, Index ix, MonadUnliftIO m, PrimMonad m) => WorkerStates s -> (a -> s -> m b) -> Array r' ix a -> m (Array r ix b)

    massiv Data.Massiv.Array

    Same as imapWS, but without the index.

Page 159 of many | Previous | Next