map -package:base -is:exact -is:exact -package:unordered-containers -package:bytestring -package:aeson -package:hedgehog -package:vector -package:blaze-html -package:protolude -package:foldl package:ghc

map :: forall (m :: Type -> Type) a b x . 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) -> Word64Map a -> Word64Map b
ghc GHC.Data.Word64Map.Internal GHC.Data.Word64Map.Lazy GHC.Data.Word64Map.Strict GHC.Data.Word64Map.Strict.Internal
Map a function over all values in the map. 
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: (Key -> Key) -> Word64Set -> Word64Set
ghc GHC.Data.Word64Set GHC.Data.Word64Set.Internal
map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y
map :: (a -> b) -> [a] -> [b]
ghc GHC.Prelude.Basic
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 n n' (e :: Extensibility) (x :: Extensibility) . (forall (e1 :: Extensibility) (x1 :: Extensibility) . () => n e1 x1 -> n' e1 x1) -> Block n e x -> Block n' e x
ghc GHC.Cmm.Dataflow.Block
map a function over the nodes of a Block
mapBlock' :: forall n n' (e :: Extensibility) (x :: Extensibility) . (forall (e1 :: Extensibility) (x1 :: Extensibility) . () => n e1 x1 -> n' e1 x1) -> Block n e x -> Block n' e x
ghc GHC.Cmm.Dataflow.Block
A strict mapBlock
mapBlock3' :: forall n n' (e :: Extensibility) (x :: Extensibility) . (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.
mapGraph :: forall n n' (e :: Extensibility) (x :: Extensibility) . (forall (e1 :: Extensibility) (x1 :: Extensibility) . () => n e1 x1 -> n' e1 x1) -> Graph n e x -> Graph n' e x
ghc GHC.Cmm.Dataflow.Graph
Maps over all nodes in a graph.
mapGraphBlocks :: forall block (n :: Extensibility -> Extensibility -> Type) block' (n' :: Extensibility -> Extensibility -> Type) (e :: Extensibility) (x :: Extensibility) . (forall (e1 :: Extensibility) (x1 :: Extensibility) . () => block n e1 x1 -> block' n' e1 x1) -> Graph' block n e x -> Graph' block' n' e x
ghc GHC.Cmm.Dataflow.Graph
Function mapGraphBlocks enables a change of representation of blocks, nodes, or both. It lifts a polymorphic block transform into a polymorphic graph transform. When the block representation stabilizes, a similar function should be provided for blocks.
mapAdjust :: (v -> v) -> Label -> LabelMap v -> LabelMap v
ghc GHC.Cmm.Dataflow.Label
mapAlter :: (Maybe v -> Maybe v) -> Label -> LabelMap v -> LabelMap v
ghc GHC.Cmm.Dataflow.Label
mapDelete :: Label -> LabelMap v -> LabelMap v
ghc GHC.Cmm.Dataflow.Label
mapDifference :: LabelMap v -> LabelMap b -> LabelMap v
ghc GHC.Cmm.Dataflow.Label
mapElems :: LabelMap a -> [a]
ghc GHC.Cmm.Dataflow.Label
mapEmpty :: LabelMap v
ghc GHC.Cmm.Dataflow.Label
mapFilter :: (v -> Bool) -> LabelMap v -> LabelMap v
ghc GHC.Cmm.Dataflow.Label
mapFilterWithKey :: (Label -> v -> Bool) -> LabelMap v -> LabelMap v
ghc GHC.Cmm.Dataflow.Label