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.
mapToSquare :: Point -> PointSquareLambdaHack Game.LambdaHack.Client.UI.PointUI No documentation available.
mapActorItems_ :: Monad m => (CStore -> ItemId -> ItemQuant -> m ()) -> Actor -> State -> m ()LambdaHack Game.LambdaHack.Common.ActorState No documentation available.
mapA :: (UnboxRepClass c, UnboxRepClass d) => (c -> d) -> Array c -> Array dLambdaHack Game.LambdaHack.Common.PointArray Map over an array.
mapAccumL :: Traversable t => (s -> a -> (s, b)) -> s -> t a -> (s, t b)LambdaHack Game.LambdaHack.Core.Prelude 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)LambdaHack Game.LambdaHack.Core.Prelude 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"])mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])LambdaHack Game.LambdaHack.Core.Prelude 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.
mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)LambdaHack Game.LambdaHack.Core.Prelude 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 :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b)LambdaHack Game.LambdaHack.Core.Prelude 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 ()) -> t a -> m ()LambdaHack Game.LambdaHack.Core.Prelude This has a more specific type (unit result) than normally, to catch errors.
mappend :: Monoid a => a -> a -> aLambdaHack Game.LambdaHack.Core.Prelude An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.