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.
mapSubStmts :: (CStat -> Bool) -> (CStat -> CStat) -> CStat -> CStatlanguage-c Language.C.Syntax.Utils No documentation available.
mapHom :: (a -> b) -> Path a -> Path blca Data.LCA.Online.Monoidal O(n) Re-annotate a Path full of monoidal values/ Unlike map, mapHom f assumes that f is a Monoid homomorphism, that is to say you must ensure
f a `mappend' f b = f (a `mappend' b) f mempty = mempty
mapWithKey :: Monoid b => (Int -> a -> b) -> Path a -> Path blca Data.LCA.Online.Monoidal O(n) Re-annotate a Path full of monoidal values with access to the key.
mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)listsafe Data.List.Safe 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"])mapAccumR :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)listsafe Data.List.Safe The mapAccumR function behaves like a combination of fmap and foldr; it applies a function to each element of a structure, passing an accumulating parameter from right to left, and returning a final value of this accumulator together with the new structure.
Examples
Basic usage:>>> mapAccumR (\a b -> (a + b, a)) 0 [1..10] (55,[54,52,49,45,40,34,27,19,10,0])
>>> mapAccumR (\a b -> (a <> show b, a)) "0" [1..5] ("054321",["05432","0543","054","05","0"])mapFortunes :: (IndexEntry -> b) -> FortuneFile -> IO [b]misfortune Data.Fortune No documentation available.
mapFortunesM :: (IndexEntry -> IO b) -> FortuneFile -> IO [b]misfortune Data.Fortune No documentation available.
mapFortunesWithIndex :: (Num a, Enum a) => (a -> IO b) -> FortuneFile -> IO [b]misfortune Data.Fortune No documentation available.
mapFortunesWithIndexM :: (Num a, Enum a) => (a -> IndexEntry -> IO b) -> FortuneFile -> IO [b]misfortune Data.Fortune No documentation available.
mapMaybeM :: (Monad m, Functor m) => (a -> m (Maybe b)) -> [a] -> m [b]monad-extras Control.Monad.Extra A monadic version of mapMaybe :: (a -> Maybe b) -> [a] -> [b].