map -package:containers -package:base -package:aeson -package:basement -package:pipes -package:charset -package:os-string -package:dense-linear-algebra -package:base-compat-batteries -package:filepath -package:regex-tdfa -package:bytestring -package:psqueues -package:base-compat -package:blaze-html -package:text

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 BasePrelude, imports Imports, incipit-base Incipit.Base, 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 :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b
Cabal-syntax Distribution.Compat.NonEmptySet
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 :: 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 :: 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 :: (a <-> b) -> [a] <-> [b]
invertible Data.Invertible.List Data.Invertible.Prelude
Apply a bijection over a list using map.
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.
map :: (Prim a, Prim b) => (a -> b) -> Vector a -> Vector b
vector Data.Vector.Primitive
O(n) Map a function over a vector.
map :: (Storable a, Storable b) => (a -> b) -> Vector a -> Vector b
vector Data.Vector.Storable
O(n) Map a function over a vector.
map :: (Unbox a, Unbox b) => (a -> b) -> Vector a -> Vector b
vector Data.Vector.Unboxed
O(n) Map a function over a vector.
map :: Monad m => (a -> b) -> Stream m a -> Stream m b
vector-stream Data.Stream.Monadic
Map a function over a Stream
module GHC.Types.Unique.Map
ghc