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

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

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

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

5. unwrapNormalForm :: Array N ix e -> Array B ix e

   massiv	Data.Massiv.Array.Manifest

   O(1) - Converts array from N to B representation.

6. unwrapNormalFormArray :: Array N ix e -> Array e

   massiv	Data.Massiv.Array.Manifest

   O(1) - Unwrap a fully evaluated boxed array. This will discard any possible slicing that has been applied to the array.

7. unwrapNormalFormMutableArray :: MArray s N ix e -> MutableArray s e

   massiv	Data.Massiv.Array.Manifest

   O(1) - Unwrap a fully evaluated mutable boxed array. This will discard any possible slicing that has been applied to the array.

8. 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.Mutable

   Same as for2PrimM_, but with index aware action.

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

   massiv	Data.Massiv.Array.Mutable

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

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

    massiv	Data.Massiv.Array.Mutable

    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.

Page 634 of many | Previous | Next