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.

Exact lookup

1. mapping :: forall (k :: Type -> Type -> Type) a b . Category k => (a -> b) -> Machine (k a) b

   machines	Data.Machine.Process

   Apply a function to all values coming from the input This can be constructed from a plan with

   mapping :: Category k => (a -> b) -> Machine (k a) b
   mapping f = repeatedly $ await >>= yield . f
   

   Examples:

   >>> runT $ mapping (*2) <~ source [1..3]
   [2,4,6]
   

2. map16 :: Word8

   messagepack	Data.MessagePack.Spec

   No documentation available.

3. map32 :: Word8

   messagepack	Data.MessagePack.Spec

   No documentation available.

4. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results. For a version that ignores the results see mapM_.

   Examples

   mapM is literally a traverse with a type signature restricted to Monad. Its implementation may be more efficient due to additional power of Monad.

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   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.

6. mappend :: Monoid a => a -> a -> a

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

7. mapLoggingT :: (m a -> n b) -> LoggingT m a -> LoggingT n b

   monad-logger-aeson	Control.Monad.Logger.Aeson

   Map the unwrapped computation using the given function.

8. mapNoLoggingT :: (m a -> n b) -> NoLoggingT m a -> NoLoggingT n b

   monad-logger-aeson	Control.Monad.Logger.Aeson

   Map the unwrapped computation using the given function.

9. mapCont :: (r -> r) -> Cont r a -> Cont r a

   monads-tf	Control.Monad.Cont

   Apply a function to transform the result of a continuation-passing computation.

   • runCont (mapCont f m) = f . runCont
     m

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

    monads-tf	Control.Monad.Except

    Map the unwrapped computation using the given function.

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

Page 263 of many | Previous | Next