Hayoo! - Haskell API Search

Prelude.	map	:: map
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, ...]
Prelude.	mapM_	:: (a -> m b) -> [a] -> m ()
base	`mapM_ f` is equivalent to `sequence_ . map f`. Source
Prelude.	mapM	:: (a -> m b) -> [a] -> m [b]
base	`mapM f` is equivalent to `sequence . map f`. Source
Prelude.	map	:: map
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	:: map
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, ...]
List.	map	:: map
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, ...]
Prelude.	mapM_	:: (a -> m b) -> [a] -> m ()
haskell98	`mapM_ f` is equivalent to `sequence_ . map f`.
Prelude.	mapM	:: (a -> m b) -> [a] -> m [b]
haskell98	`mapM f` is equivalent to `sequence . map f`.
Data.ByteString.	map	:: map
bytestring	O(n) `map` `f xs` is the ByteString obtained by applying `f` to each element of `xs`. This function is subject to array fusion.
Prelude.	map	:: map
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, ...]