Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

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

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

   openapi3	Data.OpenApi.Lens

   No documentation available.

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

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

   primitive-unlifted	Data.Primitive.Unlifted.Array

   Map over the elements of an UnliftedArray.

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

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

   primitive-unlifted	Data.Primitive.Unlifted.SmallArray

   Map over the elements of an SmallUnliftedArray.

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

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

   protolude	Protolude

   Map the unwrapped computation using the given function.

   • runExcept (mapExcept f m) = f (runExcept
     m)

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

   • runExceptT (mapExceptT f m) = f
     (runExceptT m)

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

Page 161 of many | Previous | Next