map -package:containers -package:Cabal-syntax -package:bytestring -package:base-prelude -package:conduit -package:charset -package:case-insensitive -package:foldl package:ghc

map :: Monad m => (a -> b) -> Stream m a x -> Stream m b x
ghc GHC.Data.Stream
Apply a function to each element of a Stream, lazily
map :: (a -> b) -> [a] -> [b]
ghc GHC.Prelude.Basic
map f xs is the list obtained by applying f to each element of xs, i.e., 
map f [x1, x2, ..., xn] == [f x1, f x2, ..., f xn]
map f [x1, x2, ...] == [f x1, f x2, ...]

>>> map (+1) [1, 2, 3]
[2,3,4]
module GHC.Types.Unique.Map
ghc
mapMG :: (ModSummary -> ModSummary) -> ModuleGraph -> ModuleGraph
ghc GHC
Map a function f over all the ModSummaries. To preserve invariants f can't change the isBoot status.
mapIdKey :: Unique
ghc GHC.Builtin.Names
mapName :: Name
ghc GHC.Builtin.Names
map_RDR :: RdrName
ghc GHC.Builtin.Names
mappendClassOpKey :: Unique
ghc GHC.Builtin.Names
mappendName :: Name
ghc GHC.Builtin.Names
mappend_RDR :: RdrName
ghc GHC.Builtin.Names
mapBlock :: (forall e x . n e x -> n' e x) -> Block n e x -> Block n' e x
ghc GHC.Cmm.Dataflow.Block
map a function over the nodes of a Block
mapBlock' :: (forall e x . n e x -> n' e x) -> Block n e x -> Block n' e x
ghc GHC.Cmm.Dataflow.Block
A strict mapBlock
mapBlock3' :: forall n n' e x . (n C O -> n' C O, n O O -> n' O O, n O C -> n' O C) -> Block n e x -> Block n' e x
ghc GHC.Cmm.Dataflow.Block
map over a block, with different functions to apply to first nodes, middle nodes and last nodes respectively. The map is strict.
mapAdjust :: IsMap map => (a -> a) -> KeyOf map -> map a -> map a
ghc GHC.Cmm.Dataflow.Collections
mapAlter :: IsMap map => (Maybe a -> Maybe a) -> KeyOf map -> map a -> map a
ghc GHC.Cmm.Dataflow.Collections
mapDelete :: IsMap map => KeyOf map -> map a -> map a
ghc GHC.Cmm.Dataflow.Collections
mapDeleteList :: IsMap map => [KeyOf map] -> map a -> map a
ghc GHC.Cmm.Dataflow.Collections
mapDifference :: IsMap map => map a -> map a -> map a
ghc GHC.Cmm.Dataflow.Collections
mapElems :: IsMap map => map a -> [a]
ghc GHC.Cmm.Dataflow.Collections
mapEmpty :: IsMap map => map a
ghc GHC.Cmm.Dataflow.Collections
mapFilter :: IsMap map => (a -> Bool) -> map a -> map a
ghc GHC.Cmm.Dataflow.Collections
mapFilterWithKey :: IsMap map => (KeyOf map -> a -> Bool) -> map a -> map a
ghc GHC.Cmm.Dataflow.Collections
mapFindWithDefault :: IsMap map => a -> KeyOf map -> map a -> a
ghc GHC.Cmm.Dataflow.Collections
mapFoldMapWithKey :: (IsMap map, Monoid m) => (KeyOf map -> a -> m) -> map a -> m
ghc GHC.Cmm.Dataflow.Collections
mapFoldl :: IsMap map => (b -> a -> b) -> b -> map a -> b
ghc GHC.Cmm.Dataflow.Collections