map -package:containers -package:blaze-html -package:bytestring -package:conduit -package:case-insensitive -package:invertible -package:os-string -package:filepath -package:foldl -package:monoidal-containers -package:hedgehog -package:pipes -package:dlist

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

Apply a function to each element of a Stream, lazily

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 :: Ord b => (a -> b) -> NonEmptySet a -> NonEmptySet b

Cabal-syntax Distribution.Compat.NonEmptySet

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, base-compat-batteries Data.List.NonEmpty.Compat

Map a function over a NonEmpty stream.

map :: (PrimType a, PrimType b) => (a -> b) -> Block a -> Block b

basement Basement.Block

Map all element a from a block to a new block of b

map :: (PrimType a, PrimType b) => (a -> b) -> BlockN n a -> BlockN n b

basement Basement.Sized.Block

map :: (a -> b) -> ListN n a -> ListN n b

basement Basement.Sized.List

Map all elements in a list

map :: (PrimType a, PrimType b) => (a -> b) -> UVect n a -> UVect n b

basement Basement.Sized.UVect

map :: (a -> b) -> Vect n a -> Vect n b

basement Basement.Sized.Vect

map :: (PrimType a, PrimType b) => (a -> b) -> UArray a -> UArray b

basement Basement.UArray

map :: (Char -> Char) -> CharSet -> CharSet

charset Data.CharSet

map :: (Double -> Double) -> Matrix -> Matrix

dense-linear-algebra Statistics.Matrix

Apply function to every element of matrix

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 :: (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 :: (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 :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2

unordered-containers Data.HashMap.Internal

Transform this map by applying a function to every value.