Hoogle Search
Within LTS Haskell 24.37 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapTrees :: (a -> b) -> [(c, a)] -> [(c, b)]board-games Game.Tree No documentation available.
mapAccumLM :: (Monad m, Traversable t) => (acc -> x -> m (acc, y)) -> acc -> t x -> m (acc, t y)breakpoint Debug.Breakpoint.GhcFacade Monadic version of mapAccumL
mapAndRecoverM :: (a -> TcRn b) -> [a] -> TcRn [b]breakpoint Debug.Breakpoint.GhcFacade Drop elements of the input that fail, so the result list can be shorter than the argument list
mapAndReportM :: (a -> TcRn b) -> [a] -> TcRn [b]breakpoint Debug.Breakpoint.GhcFacade Apply the function to all elements on the input list If all succeed, return the list of results Otherwise fail, propagating all errors
mapAndUnzip3M :: Monad m => (a -> m (b, c, d)) -> [a] -> m ([b], [c], [d])breakpoint Debug.Breakpoint.GhcFacade mapAndUnzipM for triples
mapAndUnzip4M :: Monad m => (a -> m (b, c, d, e)) -> [a] -> m ([b], [c], [d], [e])breakpoint Debug.Breakpoint.GhcFacade No documentation available.
mapAndUnzip5M :: Monad m => (a -> m (b, c, d, e, f)) -> [a] -> m ([b], [c], [d], [e], [f])breakpoint Debug.Breakpoint.GhcFacade No documentation available.
mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])breakpoint Debug.Breakpoint.GhcFacade 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.
mapMaybeM :: Applicative m => (a -> m (Maybe b)) -> [a] -> m [b]breakpoint Debug.Breakpoint.GhcFacade Applicative version of mapMaybe
mapPlugins :: Plugins -> (Plugin -> [CommandLineOption] -> a) -> [a]breakpoint Debug.Breakpoint.GhcFacade No documentation available.