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.
mapMaybeWithKey :: (Key -> a -> Maybe b) -> Word64Map a -> Word64Map bghc-lib-parser GHC.Data.Word64Map.Strict.Internal Map keys/values and collect the Just results.
let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"mapWithKey :: (Key -> a -> b) -> Word64Map a -> Word64Map bghc-lib-parser GHC.Data.Word64Map.Strict.Internal Map a function over all values in the map.
let f key x = (show key) ++ ":" ++ x mapWithKey f (fromList [(5,"a"), (3,"b")]) == fromList [(3, "3:b"), (5, "5:a")]
mapMonotonic :: (Key -> Key) -> Word64Set -> Word64Setghc-lib-parser GHC.Data.Word64Set The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:
and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = toList s
mapMonotonic :: (Key -> Key) -> Word64Set -> Word64Setghc-lib-parser GHC.Data.Word64Set.Internal The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:
and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = toList s
mapPlugins :: Plugins -> (Plugin -> [CommandLineOption] -> a) -> [a]ghc-lib-parser GHC.Driver.Plugins No documentation available.
-
ghc-lib-parser GHC.Hs.Decls Map over the via type if dealing with ViaStrategy. Otherwise, return the DerivStrategy unchanged.
-
ghc-lib-parser GHC.Hs.Type No documentation available.
mapLocA :: NoAnn ann => (a -> b) -> GenLocated SrcSpan a -> GenLocated (EpAnn ann) bghc-lib-parser GHC.Parser.Annotation No documentation available.
mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)ghc-lib-parser GHC.Prelude.Basic 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.mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()ghc-lib-parser GHC.Prelude.Basic 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.