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.

Exact lookup

1. mapM_ :: Monad m => (a -> m ()) -> Consumer' a m r

   pipes	Pipes.Prelude

   Consume all values using a monadic function

2. mapMaybe :: forall (m :: Type -> Type) a b r . Functor m => (a -> Maybe b) -> Pipe a b m r

   pipes	Pipes.Prelude

   (mapMaybe f) yields Just results of f. Basic laws:

   mapMaybe (f >=> g) = mapMaybe f >-> mapMaybe g
   
   mapMaybe (pure @Maybe . f) = mapMaybe (Just . f) = map f
   
   mapMaybe (const Nothing) = drain
   

   As a result of the second law,

   mapMaybe return = mapMaybe Just = cat
   

3. mapCArrayWithLength :: (Storable a, Integral b) => b -> (a -> IO c) -> Ptr a -> IO ()

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

4. mapGArray :: Storable a => (a -> IO b) -> Ptr (GArray a) -> IO ()

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

5. mapGList :: (Ptr a -> IO b) -> Ptr (GList (Ptr a)) -> IO ()

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

6. mapGSList :: (Ptr a -> IO b) -> Ptr (GSList (Ptr a)) -> IO ()

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

7. mapPtrArray :: (Ptr a -> IO b) -> Ptr (GPtrArray (Ptr a)) -> IO ()

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

8. mapZeroTerminatedCArray :: (Ptr a -> IO b) -> Ptr (Ptr a) -> IO ()

   haskell-gi-base	Data.GI.Base.BasicConversions

   No documentation available.

9. mapGValueArrayWithLength :: Integral a => a -> (Ptr GValue -> IO c) -> Ptr GValue -> IO ()

   haskell-gi-base	Data.GI.Base.GValue

   Map over the GValues inside a C array.

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

    haskell-gi-base	Data.GI.Base.ShortPrelude

    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.

Page 112 of many | Previous | Next