map -package:vector -package:basement -package:conduit -package:case-insensitive -package:pipes -package:monoidal-containers -package:insert-ordered-containers -package:hedgehog -package:ghc -package:Cabal-syntax -package:base -package:base-prelude -package:aeson -package:os-string -package:psqueues -package:regex-tdfa -package:foldl

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 function over a NonEmpty stream.

Combinator for the <map> element. Example:

map $ span $ toHtml "foo"

Result:

<map><span>foo</span></map>

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

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

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

Map a function over all values in the map.

map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]

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 function over all values in the map.

map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]

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

Apply function to every element of matrix

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 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)

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

Apply a bijection over a list using map.

O(n) map f t is the Text obtained by applying f to each element of t. Example:

>>> let message = pack "I am not angry. Not at all."

>>> T.map (\c -> if c == '.' then '!' else c) message
"I am not angry! Not at all!"

Performs replacement on invalid scalar values.

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

unstream . map f . stream = map f

O(n) map f t is the Text obtained by applying f to each element of t. Performs replacement on invalid scalar values.

Transform this map by applying a function to every value.

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 function over a Stream

Note: You should use Data.Map.Strict instead of this module if:

• You will eventually need all the values stored.
• The stored values don't represent large virtual data structures to be lazily computed.

An efficient implementation of ordered maps from keys to values (dictionaries). These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.

import qualified Data.Map as Map

The implementation of Map is based on size balanced binary trees (or trees of bounded balance) as described by:

• Stephen Adams, "Efficient sets: a balancing act", Journal of Functional Programming 3(4):553-562, October 1993, http://www.swiss.ai.mit.edu/~adams/BB/.
• J. Nievergelt and E.M. Reingold, "Binary search trees of bounded balance", SIAM journal of computing 2(1), March 1973.

Bounds for union, intersection, and difference are as given by

• Guy Blelloch, Daniel Ferizovic, and Yihan Sun, "Just Join for Parallel Ordered Sets", https://arxiv.org/abs/1602.02120v3.

Note that the implementation is left-biased -- the elements of a first argument are always preferred to the second, for example in union or insert. Warning: The size of the map must not exceed maxBound::Int. Violation of this condition is not detected and if the size limit is exceeded, its behaviour is undefined. Operation comments contain the operation time complexity in the Big-O notation (http://en.wikipedia.org/wiki/Big_O_notation).