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.

Exact lookup

1. mapFileNameF :: Functor f => (String -> f String) -> FilePath os ar -> f (FilePath os ar)

   pathtype	System.Path.Generic

   No documentation available.

2. mapInc :: [Int] -> [Int]

   perf	Perf.Algos

   Increment a list.

3. mapSqlQueryT :: (m a -> n b) -> SqlQueryT m a -> SqlQueryT n b

   persistent-mtl	Database.Persist.Monad

   No documentation available.

4. mapToJSON :: [(Text, PersistValue)] -> Text

   persistent-mtl	Database.Persist.Sql.Shim

   Convert map (list of tuples) into textual representation of JSON object. This is a type-constrained synonym for toJsonText.

5. mapToJSON :: [(Text, PersistValue)] -> Text

   persistent-redis	Database.Persist.Redis

   Convert map (list of tuples) into textual representation of JSON object. This is a type-constrained synonym for toJsonText.

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

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

   pinch	Pinch.Server

   Map the message contained in the request.

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

   probability-polynomial	Numeric.Function.Piecewise

   Map the objects of pieces.

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

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

Page 312 of many | Previous | Next