map -package:containers -package:bytestring -package:foldl -package:invertible -package:imports -package:conduit -package:charset -package:aeson -package:integration -package:blaze-html is:exact

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, Cabal-syntax Distribution.Compat.Prelude, amazonka-core Amazonka.Prelude, base Prelude Data.List GHC.Base GHC.List GHC.OldList, base-prelude BasePrelude, incipit-base Incipit.Base
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 :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b
Cabal-syntax Distribution.Compat.NonEmptySet
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 :: (PrimType a, PrimType b) => (a -> b) -> Block a -> Block b
basement Basement.Block
Map all element a from a block to a new block of b
map :: (PrimType a, PrimType b) => (a -> b) -> BlockN n a -> BlockN n b
basement Basement.Sized.Block
map :: (a -> b) -> ListN n a -> ListN n b
basement Basement.Sized.List
Map all elements in a list
map :: (PrimType a, PrimType b) => (a -> b) -> UVect n a -> UVect n b
basement Basement.Sized.UVect
map :: (a -> b) -> Vect n a -> Vect n b
basement Basement.Sized.Vect
map :: (PrimType a, PrimType b) => (a -> b) -> UArray a -> UArray b
basement Basement.UArray
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 :: (Double -> Double) -> Matrix -> Matrix
dense-linear-algebra Statistics.Matrix
Apply function to every element of matrix
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 :: (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 :: (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 :: (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.