map -package:containers -package:basement -package:conduit -is:exact -package:monoidal-containers -package:insert-ordered-containers -package:hedgehog -package:regex-tdfa -package:invertible -package:dlist -package:aeson -package:ghc -package:pipes -package:bytestring -package:base-compat -package:text -package:unordered-containers -package:blaze-html -package:amazonka-core -package:filepath -package:foldl -package:os-string

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.

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

Apply function to every element of matrix

O(n) Modify every value in the queue.

O(n) Modify every value in the queue.

O(n) Modify every value in the queue.

O(n) Map a function over a vector.

Map a function over a Bundle

Map a function over a Bundle

O(n) Map a function over a vector.

O(n) Map a function over a vector.

O(n) Map a function over a vector.

O(n) Map a function over a vector.

Map a function over a Stream

A Map from keys k to values a. The Semigroup operation for Map is union, which prefers values from the left operand. If m1 maps a key k to a value a1, and m2 maps the same key to a different value a2, then their union m1 <> m2 maps k to a1.

Type-level fmap for type-level functors. Note: this name clashes with Map from containers. FMap is provided as a synonym to avoid this.

Example

>>> data Example where Ex :: a -> Example  -- Hide the type of examples to avoid brittleness in different GHC versions

>>> data AddMul :: Nat -> Nat -> Exp Nat

>>> type instance Eval (AddMul x y) = (x TL.+ y) TL.* (x TL.+ y)

>>> :kind! Ex (Eval (Map (AddMul 2) '[0, 1, 2, 3, 4]) :: [Nat])
Ex (Eval (Map (AddMul 2) '[0, 1, 2, 3, 4]) :: [Nat]) :: Example
= Ex [4, 9, 16, 25, 36]