Hoogle Search

Within LTS Haskell 24.67 (ghc-9.10.3)

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

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

    openapi3 Data.OpenApi.Lens

    No documentation available.

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

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

    primitive-unlifted Data.Primitive.Unlifted.Array

    Map over the elements of an UnliftedArray.

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

    primitive-unlifted Data.Primitive.Unlifted.Array.ST

    Map over the elements of an UnliftedArray.

  5. mapSmallUnliftedArray :: (PrimUnlifted a, PrimUnlifted b) => (a -> b) -> SmallUnliftedArray a -> SmallUnliftedArray b

    primitive-unlifted Data.Primitive.Unlifted.SmallArray

    Map over the elements of an SmallUnliftedArray.

  6. mapSmallUnliftedArray :: (PrimUnlifted a, PrimUnlifted b) => (a -> b) -> SmallUnliftedArray a -> SmallUnliftedArray b

    primitive-unlifted Data.Primitive.Unlifted.SmallArray.ST

    Map over the elements of an SmallUnliftedArray.

  7. mapExcept :: (Either e a -> Either e' b) -> Except e a -> Except e' b

    protolude Protolude

    Map the unwrapped computation using the given function.

  8. mapExceptT :: (m (Either e a) -> n (Either e' b)) -> ExceptT e m a -> ExceptT e' n b

    protolude Protolude

    Map the unwrapped computation using the given function.

  9. mapException :: (Exception e1, Exception e2) => (e1 -> e2) -> a -> a

    protolude Protolude

    This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions".

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

    protolude Protolude

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

Page 201 of many | Previous | Next