map is:exact -package:text -package:amazonka-core -package:basement -package:bytestring -package:dense-linear-algebra -package:base-prelude -package:incipit-base -package:containers -package:ghc -package:hedgehog -package:pipes -package:case-insensitive -package:imports -package:blaze-html -package:base-compat -package:base

map :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b
Cabal-syntax Distribution.Compat.NonEmptySet
map :: (a -> b) -> [a] -> [b]
Cabal-syntax Distribution.Compat.Prelude, 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) -> KeyMap a -> KeyMap b
aeson Data.Aeson.KeyMap
Map a function over all values in the map.
map :: (a -> b) -> NonEmpty a -> NonEmpty b
base-compat-batteries Data.List.NonEmpty.Compat
Map a function over a NonEmpty stream.
map :: (Char -> Char) -> CharSet -> CharSet
charset Data.CharSet
map :: Monad m => (a -> b) -> ConduitT a b m ()
conduit Data.Conduit.Combinators
Apply a transformation to all values in a stream. Subject to fusion
map :: Monad m => (a -> b) -> ConduitT a b m ()
conduit Data.Conduit.List
Apply a transformation to all values in a stream. Subject to fusion Since 0.3.0
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 :: (Word8 -> Word8) -> ShortByteString -> ShortByteString
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 :: (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 :: Ord a => Fold (a, b) (Map a b)
foldl Control.Foldl
Fold pairs into a map.
map :: (v1 -> v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2
insert-ordered-containers Data.HashMap.Strict.InsOrd
map :: (Hashable b, Eq b) => (a -> b) -> InsOrdHashSet a -> InsOrdHashSet b
insert-ordered-containers Data.HashSet.InsOrd
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 :: (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 :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2
unordered-containers Data.HashMap.Internal
Transform this map by applying a function to every value.