Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

  1. forWS :: 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 -> (a -> s -> m b) -> m (Array r ix b)

    massiv Data.Massiv.Array

    Same as iforWS, but without the index.

  2. for2PrimM_ :: 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 -> (e1 -> e2 -> m ()) -> m ()

    massiv Data.Massiv.Array.Manifest

    Sequentially loop over the intersection of two mutable arrays while reading elements from both and applying an action to it. There is no mutation to the actual arrays, unless the action itself modifies either one of them.

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

    massiv Data.Massiv.Array.Manifest

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

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

    massiv Data.Massiv.Array.Manifest

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

  5. forceLazyArray :: (NFData e, Index ix) => Array BL ix e -> Array N ix e

    massiv Data.Massiv.Array.Manifest

    O(n) - Evaluate all elements of a boxed lazy array to normal form

  6. for2PrimM_ :: 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 -> (e1 -> e2 -> m ()) -> m ()

    massiv Data.Massiv.Array.Mutable

    Sequentially loop over the intersection of two mutable arrays while reading elements from both and applying an action to it. There is no mutation to the actual arrays, unless the action itself modifies either one of them.

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

    massiv Data.Massiv.Array.Mutable

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

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

    massiv Data.Massiv.Array.Mutable

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

  9. format :: HasFormat s a => Lens' s a

    openapi3 Data.OpenApi.Lens

    No documentation available.

  10. forM_ :: (Foldable t, Monad m) => t a -> (a -> m b) -> m ()

    protolude Protolude

    forM_ is mapM_ with its arguments flipped. For a version that doesn't ignore the results see forM. forM_ is just like for_, but specialised to monadic actions.

Page 62 of many | Previous | Next