Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

  1. mapRegionB :: Region -> (Char -> Char) -> BufferM ()

    yi-core Yi.Buffer.Region

    Map the given function over the characters in the region.

  2. mapRegionB :: Region -> (Char -> Char) -> BufferM ()

    yi-core Yi.Config.Simple

    Map the given function over the characters in the region.

  3. mapLines :: (YiString -> YiString) -> YiString -> YiString

    yi-core Yi.String

    A helper function for creating functions suitable for modifySelectionB and modifyRegionB. To be used when the desired function should map across the lines of a region.

  4. mapWindows :: (Window -> Window) -> Tab -> Tab

    yi-core Yi.Tab

    A specialised version of "fmap".

  5. mapAdjust' :: Ord k => (a -> a) -> k -> Map k a -> Map k a

    yi-language Yi.Utils

    As Map.adjust, but the combining function is applied strictly.

  6. mapFromFoldable :: (Foldable t, Ord k) => t (k, a) -> Map k a

    yi-language Yi.Utils

    Generalisation of fromList to arbitrary foldables.

  7. mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])

    base-compat-batteries Control.Monad.Compat

    The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state monad.

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

    base-compat-batteries Control.Monad.Compat

    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.

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

    base-compat-batteries Control.Monad.Compat

    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.

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

    base-compat-batteries Data.Monoid.Compat

    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.

Page 150 of many | Previous | Next