map -package:containers -package:insert-ordered-containers -package:bytestring -is:exact -package:charset -is:exact -package:basement -package:Cabal-syntax -package:blaze-html -package:os-string -package:filepath -package:invertible -package:case-insensitive -package:dlist -package:text -package:monoidal-containers -package:vector -package:base-compat-batteries -package:psqueues -package:unordered-containers -package:pipes -package:incipit-base -package:first-class-families

map :: Monad m => (a -> b) -> Stream m a x -> Stream m b x

Apply a function to each element of a Stream, lazily

ghc GHC.Prelude.Basic, amazonka-core Amazonka.Prelude, base Prelude Data.List GHC.Base GHC.List GHC.OldList, base-prelude BasePrelude, 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) -> 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 Data.List.NonEmpty, base-compat Data.List.NonEmpty.Compat

Map a function over a NonEmpty stream.

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 :: (Double -> Double) -> Matrix -> Matrix

dense-linear-algebra Statistics.Matrix

Apply function to every element of matrix

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 :: (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 :: Monad m => (a -> b) -> Stream m a -> Stream m b

vector-stream Data.Stream.Monadic

Map a function over a Stream

module GHC.Types.Unique.Map

ghc

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

mapMG :: (ModSummary -> ModSummary) -> ModuleGraph -> ModuleGraph

ghc GHC

Map a function f over all the ModSummaries. To preserve invariants f can't change the isBoot status.

mapIdKey :: Unique

ghc GHC.Builtin.Names