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. MapUpdate'ENABLE :: MapUpdate'FlagOp

   riak-protobuf	Data.Riak.Proto

   No documentation available.

2. data MapUpdate'FlagOp

   riak-protobuf	Data.Riak.Proto

   No documentation available.

3. MapNotifyEvent :: EventType -> CULong -> Bool -> Display -> Window -> Window -> Bool -> Event

   xmonad-contrib	XMonad.Config.Prime

   No documentation available.

4. MapRequestEvent :: EventType -> CULong -> Bool -> Display -> Window -> Window -> Event

   xmonad-contrib	XMonad.Config.Prime

   No documentation available.

5. MappingNotifyEvent :: EventType -> CULong -> Bool -> Display -> Window -> MappingRequest -> KeyCode -> CInt -> Event

   xmonad-contrib	XMonad.Config.Prime

   No documentation available.

6. type MappingRequest = CInt

   xmonad-contrib	XMonad.Config.Prime

   No documentation available.

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

   base	Prelude

   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.

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

   base	Prelude

   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.

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

   base	Prelude

   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.

10. mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)

    base	Data.List

    The mapAccumL function behaves like a combination of fmap and foldl; it applies a function to each element of a structure, passing an accumulating parameter from left to right, and returning a final value of this accumulator together with the new structure.

    Examples

    Basic usage:

    >>> mapAccumL (\a b -> (a + b, a)) 0 [1..10]
    (55,[0,1,3,6,10,15,21,28,36,45])
    

    >>> mapAccumL (\a b -> (a <> show b, a)) "0" [1..5]
    ("012345",["0","01","012","0123","01234"])
    

Page 84 of many | Previous | Next