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.

  1. mapM :: forall m a b (n :: Nat) . (Monad m, Unbox a, Unbox b) => (a -> m b) -> Vector n a -> m (Vector n b)

    vector-sized Data.Vector.Unboxed.Sized

    O(n) Apply the monadic action to all elements of the vector, yielding a vector of results.

  2. mapM_ :: forall m a b (n :: Nat) . (Monad m, Unbox a) => (a -> m b) -> Vector n a -> m ()

    vector-sized Data.Vector.Unboxed.Sized

    O(n) Apply the monadic action to all elements of a vector and ignore the results.

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

    yi-core Yi.Buffer.Region

    Map the given function over the characters in the region.

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

    yi-core Yi.Config.Simple

    Map the given function over the characters in the region.

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

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

    yi-core Yi.Tab

    A specialised version of "fmap".

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

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

    yi-language Yi.Utils

    Generalisation of fromList to arbitrary foldables.

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

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

Page 151 of many | Previous | Next