Help | Examples | About | API | Blog | Hackage | Haskell
Concurrently search more than 6377 packages and more than 599194 functions! (Index generated: Tue, 22 Apr 2014 14:04:47 UTC )
Found 572 functions, 0 packages and 4 completions.
Prelude.map:: (a -> b) -> [a] -> [b]
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, ...]
Source
Prelude.map:: (a -> b) -> [a] -> [b]
haskell98

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, ...]
Data.List.map:: (a -> b) -> [a] -> [b]
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, ...]
Source
List.map:: (a -> b) -> [a] -> [b]
haskell98

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, ...]
Data.ByteString.map:: (Word8 -> Word8) -> ByteString -> ByteString
bytestring

O(n) map f xs is the ByteString obtained by applying f to each element of xs.

Source
Prelude.map:: (a -> b) -> [a] -> [b]
fay-base
No description.
Source
Data.Set.map:: (a -> b) -> Set a -> Set b
containers
No description.
Source
Data.IntSet.map:: (Key -> Key) -> IntSet -> IntSet
containers
No description.
Source
Data.Text.map:: (Char -> Char) -> Text -> Text
text

O(n) map f t is the Text obtained by applying f to each element of t. Subject to fusion. Performs replacement on invalid scalar values.

Source
Prelude.map:: (a -> b) -> [a] -> [b]
haskell2010

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, ...]
Powered by Haskell, HXT, Snap, and
Please send any feedback to hayoo@holumbus.org