map -package:basement -is:exact -package:base-compat-batteries -package:monoidal-containers -package:imports -package:dlist -package:integration -package:os-string -package:pipes -package:base-compat -package:hedgehog -is:exact -package:blaze-html -package:conduit -package:filepath -package:case-insensitive -is:exact -package:charset -package:ghc -package:containers -package:unordered-containers -package:base-prelude -package:invertible -package:vector -package:aeson -package:bloodhound -package:regex-tdfa -is:module -is:exact -package:first-class-families

map :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b
Cabal-syntax Distribution.Compat.NonEmptySet
map :: (a -> b) -> [a] -> [b]
Cabal-syntax Distribution.Compat.Prelude, amazonka-core Amazonka.Prelude, base Prelude Data.List GHC.Base GHC.List GHC.OldList, incipit-base Incipit.Base
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
Map a function over a NonEmpty stream.
map :: (Word8 -> Word8) -> ByteString -> ByteString
bytestring Data.ByteString Data.ByteString.Lazy
O(n) map f xs is the ByteString obtained by applying f to each element of xs.
map :: (Char -> Char) -> ByteString -> ByteString
bytestring Data.ByteString.Char8 Data.ByteString.Lazy.Char8
O(n) map f xs is the ByteString obtained by applying f to each element of xs
map :: (Word8 -> Word8) -> ShortByteString -> ShortByteString
bytestring Data.ByteString.Short Data.ByteString.Short.Internal
O(n) map f xs is the ShortByteString obtained by applying f to each element of xs.
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 :: (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 :: (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 :: (Char -> Char) -> Text -> Text
text Data.Text
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.
map :: (Char -> Char) -> Stream Char -> Stream Char
text Data.Text.Internal.Fusion.Common
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
map :: (Char -> Char) -> Text -> Text
text Data.Text.Lazy
O(n) map f t is the Text obtained by applying f to each element of t. Performs replacement on invalid scalar values.
map :: Monad m => (a -> b) -> Stream m a -> Stream m b
vector-stream Data.Stream.Monadic
Map a function over a Stream
data () => Map k a
Cabal-syntax Distribution.Compat.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.
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
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
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.