map -package:containers -package:insert-ordered-containers -package:amazonka-core -package:dense-linear-algebra -package:dlist -package:aeson -package:ghc -package:monoidal-containers -package:conduit -package:base-compat -package:base -package:base-compat-batteries -package:hedgehog -package:integration -package:imports -package:filepath

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 :: (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, 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 :: FoldCase s2 => (s1 -> s2) -> CI s1 -> CI s2

case-insensitive Data.CaseInsensitive

Transform the original string-like value but keep it case insensitive.

map :: (Char -> Char) -> CharSet -> CharSet

charset Data.CharSet

map :: Ord a => Fold (a, b) (Map a b)

foldl Control.Foldl

Fold pairs into a map.

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 :: (Word16 -> Word16) -> ShortByteString -> ShortByteString

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

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.

map :: (a -> b) -> CharMap a -> CharMap b

regex-tdfa Data.IntMap.CharMap2