Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. 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

2. 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

3. 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

4. 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.

5. 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.

6. 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.

7. 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)

8. evalNormalFormArray :: NFData e => Comp -> Array e -> Array N Ix1 e

   massiv	Data.Massiv.Array.Manifest

   O(n) - Wrap a boxed array and evaluate all elements to a Normal Form (NF).

9. evalNormalFormMutableArray :: (PrimMonad m, NFData e) => MutableArray (PrimState m) e -> m (MArray (PrimState m) N Ix1 e)

   massiv	Data.Massiv.Array.Manifest

   O(n) - Wrap mutable boxed array and evaluate all elements to NF.

10. ifor2PrimM_ :: forall r1 r2 e1 e2 ix m . (PrimMonad m, Index ix, Manifest r1 e1, Manifest r2 e2) => MArray (PrimState m) r1 ix e1 -> MArray (PrimState m) r2 ix e2 -> (ix -> e1 -> e2 -> m ()) -> m ()

    massiv	Data.Massiv.Array.Manifest

    Same as for2PrimM_, but with index aware action.

Page 633 of many | Previous | Next