Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. imapSchedulerM_ :: (Index ix, Source r e, MonadPrimBase s m) => Scheduler s () -> (ix -> e -> m a) -> Array r ix e -> m ()

   massiv	Data.Massiv.Array

   Same as imapM_, but will use the supplied scheduler.

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

   massiv	Data.Massiv.Array

   Same as imapIO, but ignores the inner computation strategy and uses stateful workers during computation instead. Use initWorkerStates for the WorkerStates initialization.

3. dimapStencil :: (c -> d) -> (a -> b) -> Stencil ix d a -> Stencil ix c b

   massiv	Data.Massiv.Array.Stencil

   A Profunctor dimap. Same caviat applies as in lmapStencil

4. lmapStencil :: (c -> d) -> Stencil ix d a -> Stencil ix c a

   massiv	Data.Massiv.Array.Stencil

   A contravariant map of a second type parameter. In other words map a function over each element of the array, that the stencil will be applied to. Note: This map can be very inefficient, since for stencils larger than 1 element in size, the supllied function will be repeatedly applied to the same element. It is better to simply map that function over the source array instead.

5. rmapStencil :: (a -> b) -> Stencil ix e a -> Stencil ix e b

   massiv	Data.Massiv.Array.Stencil

   A covariant map over the right most type argument. In other words the usual fmap from Functor:

   fmap == rmapStencil
   

6. simap :: Stream r ix a => (ix -> a -> b) -> Array r ix a -> Vector DS b

   massiv	Data.Massiv.Vector

   Map an index aware function over a stream vector

   Examples

7. simapM :: forall r ix a b m . (Stream r ix a, Monad m) => (ix -> a -> m b) -> Array r ix a -> m (Vector DS b)

   massiv	Data.Massiv.Vector

   Traverse a stream vector with a monadic index aware function. Corresponds to: mapM (uncurry f) . imap (,) v

   Examples

8. simapM_ :: forall r ix a b m . (Stream r ix a, Monad m) => (ix -> a -> m b) -> Array r ix a -> m ()

   massiv	Data.Massiv.Vector

   Traverse a stream vector with a monadic index aware function, while discarding the result

   Examples

9. simapMaybe :: Stream r ix a => (ix -> a -> Maybe b) -> Array r ix a -> Vector DS b

   massiv	Data.Massiv.Vector

   Similar to smapMaybe, but map with an index aware function.

   Examples

10. simapMaybeM :: forall r ix a b f . (Stream r ix a, Applicative f) => (ix -> a -> f (Maybe b)) -> Array r ix a -> f (Vector DS b)

    massiv	Data.Massiv.Vector

    Similar to smapMaybeM, but map with an index aware function.

    Examples

Page 568 of many | Previous | Next