map is:exact -package:bytestring -package:case-insensitive -package:base-compat -package:containers -package:aeson -package:blaze-html

map :: Monad m => (a -> b) -> Stream m a x -> Stream m b x

Apply a function to each element of a Stream, lazily

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-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 :: (Char -> Char) -> CharSet -> CharSet

charset Data.CharSet

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 :: (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 :: 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 :: (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.