Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

  1. mapIO_ :: forall r ix e a m . (Load r ix e, MonadUnliftIO m) => (e -> m a) -> Array r ix e -> m ()

    massiv Data.Massiv.Array

    Similar to mapIO, but ignores the result of mapping action and does not create a resulting array, therefore it is faster. Use this instead of mapIO when result is irrelevant. Most importantly it will follow the iteration logic outlined by the supplied array.

  2. mapM :: forall r ix b r' a m . (Source r' a, Manifest r b, Index ix, Monad m) => (a -> m b) -> Array r' ix a -> m (Array r ix b)

    massiv Data.Massiv.Array

    Map a monadic action over an array sequentially.

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

    massiv Data.Massiv.Array

    Map a monadic function over an array sequentially, while discarding the result.

    Examples

    >>> import Data.Massiv.Array as A

>>> rangeStepM Par (Ix1 10) 12 60 >>= A.mapM_ print
10
22
34
46
58

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

    massiv Data.Massiv.Array

    Same as imapWS, but without the index.

  5. mapStencil :: (Index ix, Manifest r e) => Border e -> Stencil ix e a -> Array r ix e -> Array DW ix a

    massiv Data.Massiv.Array.Stencil

    Map a constructed stencil over an array. Resulting array must be computed in order to be useful.

  6. mappendL :: m -> (m :+: n) -> m :+: n

    monoid-extras Data.Monoid.Coproduct

    Prepend a value from the left monoid.

  7. mappendR :: n -> (m :+: n) -> m :+: n

    monoid-extras Data.Monoid.Coproduct

    Prepend a value from the right monoid.

  8. mapping :: HasMapping s a => Lens' s a

    openapi3 Data.OpenApi.Lens

    No documentation available.

  9. mapInstr :: forall instr1 instr2 (m :: Type -> Type) a . Monad m => (forall x . () => instr1 x -> instr2 x) -> ProgramT instr1 m a -> ProgramT instr2 m a

    operational Control.Monad.Operational

    Extend a mapping of instructions to a mapping of ProgramT.

  10. mapUnliftedArray :: (PrimUnlifted a, PrimUnlifted b) => (a -> b) -> UnliftedArray a -> UnliftedArray b

    primitive-unlifted Data.Primitive.Unlifted.Array

    Map over the elements of an UnliftedArray.

Page 160 of many | Previous | Next