map -package:containers -package:ghc -package:incipit-base -package:base -package:base-compat-batteries -is:exact -package:basement -package:foldl -package:dense-linear-algebra -package:monoidal-containers -package:bytestring -package:os-string -package:base-prelude -package:insert-ordered-containers -package:aeson -package:text

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) -> NonEmpty a -> NonEmpty b

base-compat Data.List.NonEmpty.Compat

Map a function over a NonEmpty stream.

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

filepath System.OsPath.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

O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.

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 :: (a <-> b) -> [a] <-> [b]

invertible Data.Invertible.List Data.Invertible.Prelude

Apply a bijection over a list using map.

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.