map -package:containers -package:insert-ordered-containers -package:blaze-html -package:conduit -is:exact -package:pipes -package:basement -package:psqueues -package:aeson -package:ghc -package:text is:exact -package:case-insensitive -package:incipit-base -package:hedgehog -package:dense-linear-algebra

map :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b
Cabal-syntax Distribution.Compat.NonEmptySet
map :: (a -> b) -> [a] -> [b]
Cabal-syntax Distribution.Compat.Prelude, amazonka-core Amazonka.Prelude, base Prelude Data.List GHC.Base GHC.List GHC.OldList, base-prelude BasePrelude, imports Imports, 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, base-compat-batteries 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 :: (Char -> Char) -> CharSet -> CharSet
charset Data.CharSet
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 :: Ord a => Fold (a, b) (Map a b)
foldl Control.Foldl
Fold pairs into a map.
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 :: (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 Data.HashMap.Internal.Strict Data.HashMap.Lazy Data.HashMap.Strict
Transform this map by applying a function to every value.
map :: (a -> b) -> Array a -> Array b
unordered-containers Data.HashMap.Internal.Array
map :: (Hashable b, Eq b) => (a -> b) -> HashSet a -> HashSet b
unordered-containers Data.HashSet Data.HashSet.Internal
Transform this set by applying a function to every value. The resulting set may be smaller than the source. 
>>> HashSet.map show (HashSet.fromList [1,2,3])
HashSet.fromList ["1","2","3"]
map :: (a -> b) -> Vector a -> Vector b
vector Data.Vector
O(n) Map a function over a vector.
map :: (a -> b) -> Bundle v a -> Bundle v b
vector Data.Vector.Fusion.Bundle
Map a function over a Bundle
map :: Monad m => (a -> b) -> Bundle m v a -> Bundle m v b
vector Data.Vector.Fusion.Bundle.Monadic
Map a function over a Bundle
map :: (Vector v a, Vector v b) => (a -> b) -> v a -> v b
vector Data.Vector.Generic
O(n) Map a function over a vector.