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. mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)

   pinch	Pinch.Internal.FoldList

   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.

2. mapRequestMessage :: (Message -> Message) -> Request o -> Request o

   pinch	Pinch.Server

   Map the message contained in the request.

3. mapPieces :: Domain o ~ Domain o' => (o -> o') -> Piecewise o -> Piecewise o'

   probability-polynomial	Numeric.Function.Piecewise

   Map the objects of pieces.

4. mapQ :: (a -> b, b -> a) -> Quantification a -> Quantification b

   quickcheck-dynamic	Test.QuickCheck.DynamicLogic.Quantify

   Quantification is not a Functor, since it also keeps track of the range of the generators. However, if you have two functions to :: a -> b from :: b -> a satisfying from . to = id you can go from a quantification over a to one over b. Note that the from function need only be defined on the image of to.

5. mapEither :: (a -> Either b c) -> Patricia a -> (Patricia b, Patricia c)

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree and create two trees, one out of Left results and one out of Right ones.

6. mapEitherWithKey :: (Word -> a -> Either b c) -> Patricia a -> (Patricia b, Patricia c)

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree and create two trees, one out of Left results and one out of Right ones.

7. mapMaybe :: (a -> Maybe b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree and create one out of Just values.

8. mapMaybeWithKey :: (Word -> a -> Maybe b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree and create a tree out of Just results.

9. mapWithKey :: (Word -> a -> b) -> Patricia a -> Patricia b

   radix-tree	Data.Patricia.Word.Lazy

   Apply a function to every value in the tree.

10. map' :: (a -> b) -> Patricia a -> Patricia b

    radix-tree	Data.Patricia.Word.Strict

    Apply a function to every value in the tree. New values are evaluated to WHNF.

Page 353 of many | Previous | Next