Hoogle Search

Within LTS Haskell 24.65 (ghc-9.10.3)

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

Exact lookup

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

   massiv	Data.Massiv.Array

   Just like imapM_, except with flipped arguments.

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

   massiv	Data.Massiv.Array

   Same as imapM_, but will use the supplied scheduler.

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

   massiv	Data.Massiv.Array

   Same as imapWS, but with source array and mapping action arguments flipped.

4. transform' :: forall ix e r' ix' e' a . (HasCallStack, Source r' e', Index ix', Index ix) => (Sz ix' -> (Sz ix, a)) -> (a -> (ix' -> e') -> ix -> e) -> Array r' ix' e' -> Array D ix e

   massiv	Data.Massiv.Array

   General array transformation

5. transform2' :: (HasCallStack, Source r1 e1, Source r2 e2, Index ix, Index ix1, Index ix2) => (Sz ix1 -> Sz ix2 -> (Sz ix, a)) -> (a -> (ix1 -> e1) -> (ix2 -> e2) -> ix -> e) -> Array r1 ix1 e1 -> Array r2 ix2 e2 -> Array D ix e

   massiv	Data.Massiv.Array

   Same as transform', but operates on two arrays

6. transform2M :: (Manifest r e, Index ix, Source r1 e1, Source r2 e2, Index ix1, Index ix2, MonadUnliftIO m, PrimMonad m, MonadThrow m) => (Sz ix1 -> Sz ix2 -> m (Sz ix, a)) -> (a -> (ix1 -> m e1) -> (ix2 -> m e2) -> ix -> m e) -> Array r1 ix1 e1 -> Array r2 ix2 e2 -> m (Array r ix e)

   massiv	Data.Massiv.Array

   Same as transformM, but operates on two arrays

7. transformM :: forall r ix e r' ix' e' a m . (Manifest r e, Index ix, Source r' e', Index ix', MonadUnliftIO m, PrimMonad m, MonadThrow m) => (Sz ix' -> m (Sz ix, a)) -> (a -> (ix' -> m e') -> ix -> m e) -> Array r' ix' e' -> m (Array r ix e)

   massiv	Data.Massiv.Array

   General array transformation, that forces computation and produces a manifest array.

8. uniformArray :: forall ix e g . (Index ix, RandomGen g, Uniform e) => g -> Comp -> Sz ix -> Array DL ix e

   massiv	Data.Massiv.Array

   Generate a random array where all elements are sampled from a uniform distribution.

9. uniformRangeArray :: forall ix e g . (Index ix, RandomGen g, UniformRange e) => g -> (e, e) -> Comp -> Sz ix -> Array DL ix e

   massiv	Data.Massiv.Array

   Same as uniformArray, but will generate values in a supplied range.

10. evalNormalForm :: (Index ix, NFData e) => Array B ix e -> Array N ix e

    massiv	Data.Massiv.Array.Manifest

    O(n) - Compute all elements of a boxed array to NF (normal form)

Page 632 of many | Previous | Next