Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

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

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

7. iforLinearPrimM :: (Manifest r e, Index ix, PrimMonad m) => MArray (PrimState m) r ix e -> (Int -> e -> m e) -> m ()

   massiv	Data.Massiv.Array.Manifest

   Sequentially loop over a mutable array while modifying each element with an index aware action.

8. iforLinearPrimM_ :: (Manifest r e, Index ix, PrimMonad m) => MArray (PrimState m) r ix e -> (Int -> e -> m ()) -> m ()

   massiv	Data.Massiv.Array.Manifest

   Sequentially loop over a mutable array while reading each element and applying a linear index aware action to it. There is no mutation to the array, unless the action itself modifies it.

9. iforPrimM :: (Manifest r e, Index ix, PrimMonad m) => MArray (PrimState m) r ix e -> (ix -> e -> m e) -> m ()

   massiv	Data.Massiv.Array.Manifest

   Sequentially loop over a mutable array while modifying each element with an index aware action.

10. iforPrimM_ :: (Manifest r e, Index ix, PrimMonad m) => MArray (PrimState m) r ix e -> (ix -> e -> m ()) -> m ()

    massiv	Data.Massiv.Array.Manifest

    Sequentially loop over a mutable array while reading each element and applying an index aware action to it. There is no mutation to the array, unless the action itself modifies it.

Page 631 of many | Previous | Next