map -package:Cabal -package:base -package:text -package:pipes -package:unordered-containers -package:hedgehog -package:blaze-html -package:containers

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
O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.
map :: (a -> b) -> KeyMap a -> KeyMap b
aeson Data.Aeson.KeyMap
Map a function over all values in the map.
map :: (a -> b) -> Vector a -> Vector b
vector Data.Vector Data.Vector.Strict
O(n) Map a function over a vector.
map :: forall a b (v :: Type -> Type) . (a -> b) -> Bundle v a -> Bundle v b
vector Data.Vector.Fusion.Bundle
Map a function over a Bundle
map :: forall (m :: Type -> Type) a b (v :: Type -> Type) . 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 :: forall (m :: Type -> Type) a b . Monad m => (a -> b) -> Stream m a -> Stream m b
vector Data.Vector.Fusion.Stream.Monadic
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 :: 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 :: forall (m :: Type -> Type) a b x . 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) -> Word64Map a -> Word64Map b
ghc GHC.Data.Word64Map.Internal GHC.Data.Word64Map.Lazy GHC.Data.Word64Map.Strict GHC.Data.Word64Map.Strict.Internal
Map a function over all values in the map. 
map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
map :: (Key -> Key) -> Word64Set -> Word64Set
ghc GHC.Data.Word64Set GHC.Data.Word64Set.Internal
map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y
map :: (a -> b) -> [a] -> [b]
ghc GHC.Prelude.Basic
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 :: (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 :: (a -> b) -> NonEmpty a -> NonEmpty b
base-compat Data.List.NonEmpty.Compat
Map a function over a NonEmpty stream.