map -package:containers -package:Cabal-syntax -is:exact -package:base-compat-batteries -package:basement -package:bytestring -package:dlist -package:dense-linear-algebra -package:os-string -package:ghc -package:pipes -package:invertible -package:filepath -package:aeson -package:psqueues -package:conduit -package:base-prelude -package:vector -package:regex-tdfa -package:unordered-containers -package:incipit-base -package:text

map :: (a -> b) -> [a] -> [b]
amazonka-core Amazonka.Prelude, base Prelude Data.List GHC.Base GHC.List GHC.OldList, imports Imports, integration Testlib.Prelude
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 Data.List.NonEmpty, 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 :: Ord a => Fold (a, b) (Map a b)
foldl Control.Foldl
Fold pairs into a map.
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 :: (v1 -> v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2
insert-ordered-containers Data.HashMap.Strict.InsOrd
map :: (Hashable b, Eq b) => (a -> b) -> InsOrdHashSet a -> InsOrdHashSet b
insert-ordered-containers Data.HashSet.InsOrd
map :: (v1 -> v2) -> MonoidalHashMap k v1 -> MonoidalHashMap k v2
monoidal-containers Data.HashMap.Monoidal
O(n) Transform this map by applying a function to every value.
map :: (a -> b) -> MonoidalIntMap a -> MonoidalIntMap b
monoidal-containers Data.IntMap.Monoidal Data.IntMap.Monoidal.Strict
map :: (a -> b) -> MonoidalMap k a -> MonoidalMap k b
monoidal-containers Data.Map.Monoidal Data.Map.Monoidal.Strict
map :: Monad m => (a -> b) -> Stream m a -> Stream m b
vector-stream Data.Stream.Monadic
Map a function over a Stream
Map :: ExecutionHint
bloodhound Database.Bloodhound.Internal.Aggregation Database.Bloodhound.Types
newtype Map a b
cql Database.CQL.Protocol Database.CQL.Protocol.Internal
Map :: [(a, b)] -> Map a b
cql Database.CQL.Protocol Database.CQL.Protocol.Internal
data Map
first-class-families Fcf Fcf.Class.Functor Fcf.Classes
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]
data () => Map k a
imports Imports, integration Testlib.Prelude
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 family Map (a_a8upe :: (~>) a_a8u0m b_a8u0n) (a_a8upf :: NonEmpty a_a8u0m) :: NonEmpty b_a8u0n
singletons-base Data.List.NonEmpty.Singletons
type family Map (a_aKtL :: (~>) a_aKqu b_aKqv) (a_aKtM :: [a_aKqu]) :: [b_aKqv]
singletons-base Data.List.Singletons Prelude.Singletons
module StmContainers.Map
stm-containers
data Map key value
stm-containers StmContainers.Map
Hash-table, based on STM-specialized Hash Array Mapped Trie.
data Map k v
uniplate Data.Generics.Uniplate.Data.Instances
Invariant preserving version of Map from the containers packages, suitable for use with Uniplate. Use toMap to construct values, and fromMap to deconstruct values.
mapAccumM :: (Monad m, Traversable t) => (a -> b -> m (a, c)) -> a -> t b -> m (a, t c)
Cabal Distribution.Utils.MapAccum
Monadic variant of mapAccumL.
mapRand :: ((a, g) -> (b, g)) -> Rand g a -> Rand g b
MonadRandom Control.Monad.Random.Lazy
Map both the return value and final generator of a computation using the given function.