map -package:containers -package:charset -package:invertible -package:monoidal-containers -package:case-insensitive -package:pipes -package:ghc -package:dlist -package:incipit-base -package:os-string

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) -> 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 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 :: Html -> Html
blaze-html Text.Blaze.Html4.FrameSet Text.Blaze.Html4.Strict Text.Blaze.Html4.Transitional Text.Blaze.Html5 Text.Blaze.XHtml1.FrameSet Text.Blaze.XHtml1.Strict Text.Blaze.XHtml1.Transitional Text.Blaze.XHtml5
Combinator for the <map> element. Example: 
map $ span $ toHtml "foo"
Result: 
<map><span>foo</span></map>
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
O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.
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 :: (Double -> Double) -> Matrix -> Matrix
dense-linear-algebra Statistics.Matrix
Apply function to every element of matrix
map :: (Word16 -> Word16) -> ShortByteString -> ShortByteString
filepath System.OsPath.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 :: (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 :: (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.