map -package:containers -package:insert-ordered-containers -package:blaze-html -package:conduit -package:Cabal-syntax -package:foldl -package:dense-linear-algebra -package:base-compat-batteries -package:basement -package:monoidal-containers -package:ghc -package:charset -is:exact -package:imports -package:incipit-base is:exact

map :: (a -> b) -> KeyMap a -> KeyMap b
aeson Data.Aeson.KeyMap
Map a function over all values in the map.
map :: (a -> b) -> [a] -> [b]
amazonka-core Amazonka.Prelude, base Prelude Data.List GHC.Base GHC.List GHC.OldList, base-prelude BasePrelude, integration Testlib.Prelude
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]
map :: (a -> b) -> NonEmpty a -> NonEmpty b
base Data.List.NonEmpty, base-compat Data.List.NonEmpty.Compat
Map a function over a NonEmpty stream.
map :: (Word8 -> Word8) -> ByteString -> ByteString
bytestring Data.ByteString Data.ByteString.Lazy
O(n) map f xs is the ByteString obtained by applying f to each element of xs.
map :: (Char -> Char) -> ByteString -> ByteString
bytestring Data.ByteString.Char8 Data.ByteString.Lazy.Char8
O(n) map f xs is the ByteString obtained by applying f to each element of xs
map :: (Word8 -> Word8) -> ShortByteString -> ShortByteString
bytestring Data.ByteString.Short Data.ByteString.Short.Internal, filepath System.OsPath.Data.ByteString.Short, os-string System.OsString.Data.ByteString.Short
O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.
map :: FoldCase s2 => (s1 -> s2) -> CI s1 -> CI s2
case-insensitive Data.CaseInsensitive
Transform the original string-like value but keep it case insensitive.
map :: (a -> b) -> DList a -> DList b
dlist Data.DList
map f xs is the DList obtained by applying f to each element of xs. <math>(length (toList xs)). map obeys the law: 
toList (map f xs) = map f (toList xs)
map :: (a -> b) -> DNonEmpty a -> DNonEmpty b
dlist Data.DList.DNonEmpty
map f xs is the DNonEmpty obtained by applying f to each element of xs. <math>(length (toNonEmpty xs)). map obeys the law: 
toNonEmpty (map f xs) = map f (toNonEmpty xs)
map :: (Word16 -> Word16) -> ShortByteString -> ShortByteString
filepath System.OsPath.Data.ByteString.Short.Word16, os-string System.OsString.Data.ByteString.Short.Word16
O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.
map :: (MonadGen m, Ord k) => Range Int -> m (k, v) -> m (Map k v)
hedgehog Hedgehog.Gen Hedgehog.Internal.Gen
Generates a map using a Range to determine the length. This may fail to generate anything if the keys produced by the generator do not account for a large enough number of unique items to satify the required map size.
map :: (a <-> b) -> [a] <-> [b]
invertible Data.Invertible.List Data.Invertible.Prelude
Apply a bijection over a list using map.
map :: (OsChar -> OsChar) -> OsString -> OsString
os-string System.OsString System.OsString.Internal
O(n) map f xs is the OsString obtained by applying f to each element of xs.
map :: (PosixChar -> PosixChar) -> PosixString -> PosixString
os-string System.OsString.Posix
O(n) map f xs is the OsString obtained by applying f to each element of xs.
map :: (WindowsChar -> WindowsChar) -> WindowsString -> WindowsString
os-string System.OsString.Windows
O(n) map f xs is the OsString obtained by applying f to each element of xs.
map :: Functor m => (a -> b) -> Pipe a b m r
pipes Pipes.Prelude
Apply a function to all values flowing downstream 
map id = cat

map (g . f) = map f >-> map g
map :: (k -> p -> v -> w) -> HashPSQ k p v -> HashPSQ k p w
psqueues Data.HashPSQ
O(n) Modify every value in the queue.
map :: (Int -> p -> v -> w) -> IntPSQ p v -> IntPSQ p w
psqueues Data.IntPSQ
O(n) Modify every value in the queue.
map :: forall k p v w . (k -> p -> v -> w) -> OrdPSQ k p v -> OrdPSQ k p w
psqueues Data.OrdPSQ
O(n) Modify every value in the queue.
map :: (a -> b) -> CharMap a -> CharMap b
regex-tdfa Data.IntMap.CharMap2
map :: Enum key => (a -> b) -> EnumMap key a -> EnumMap key b
regex-tdfa Data.IntMap.EnumMap2
map :: Enum e => (e -> e) -> EnumSet e -> EnumSet e
regex-tdfa Data.IntSet.EnumSet2
map :: (Char -> Char) -> Text -> Text
text Data.Text
O(n) map f t is the Text obtained by applying f to each element of t. Example: 
>>> let message = pack "I am not angry. Not at all."

>>> T.map (\c -> if c == '.' then '!' else c) message
"I am not angry! Not at all!"
Performs replacement on invalid scalar values.
map :: (Char -> Char) -> Stream Char -> Stream Char
text Data.Text.Internal.Fusion.Common
O(n) map f xs is the Stream Char obtained by applying f to each element of xs. Properties 
unstream . map f . stream = map f
map :: (Char -> Char) -> Text -> Text
text Data.Text.Lazy
O(n) map f t is the Text obtained by applying f to each element of t. Performs replacement on invalid scalar values.