map -package:containers -package:insert-ordered-containers -package:blaze-html -package:imports -package:dlist -package:charset -package:conduit -package:basement -package:incipit-base -package:bytestring -package:invertible -package:base -package:hedgehog -package:text -package:ghc -package:dense-linear-algebra

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-compat Data.List.NonEmpty.Compat, base-compat-batteries Data.List.NonEmpty.Compat

Map a function over a NonEmpty stream.

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

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

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