Hoogle Search

Within LTS Haskell 23.21 (ghc-9.8.4)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. map :: (a -> b) -> [a] -> [b]

    base 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, ...]
    this means that map id == id

    Examples

    >>> map (+1) [1, 2, 3]
[2,3,4]

    >>> map id [1, 2, 3]
[1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]

  2. map :: (a -> b) -> [a] -> [b]

    base Data.List

    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, ...]
    this means that map id == id

    Examples

    >>> map (+1) [1, 2, 3]
[2,3,4]

    >>> map id [1, 2, 3]
[1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]

  3. map :: (a -> b) -> NonEmpty a -> NonEmpty b

    base Data.List.NonEmpty

    Map a function over a NonEmpty stream.

  4. map :: (a -> b) -> [a] -> [b]

    base GHC.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, ...]
    this means that map id == id

    Examples

    >>> map (+1) [1, 2, 3]
[2,3,4]

    >>> map id [1, 2, 3]
[1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]

  5. map :: (a -> b) -> [a] -> [b]

    base GHC.List

    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, ...]
    this means that map id == id

    Examples

    >>> map (+1) [1, 2, 3]
[2,3,4]

    >>> map id [1, 2, 3]
[1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]

  6. map :: (a -> b) -> [a] -> [b]

    base GHC.OldList

    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, ...]
    this means that map id == id

    Examples

    >>> map (+1) [1, 2, 3]
[2,3,4]

    >>> map id [1, 2, 3]
[1,2,3]

    >>> map (\n -> 3 * n + 1) [1, 2, 3]
[4,7,10]

  7. map :: (Word8 -> Word8) -> ByteString -> ByteString

    bytestring Data.ByteString

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

  8. map :: (Char -> Char) -> ByteString -> ByteString

    bytestring Data.ByteString.Char8

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

  9. map :: (Word8 -> Word8) -> ByteString -> ByteString

    bytestring Data.ByteString.Lazy

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

  10. map :: (Char -> Char) -> ByteString -> ByteString

    bytestring Data.ByteString.Lazy.Char8

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

Page 1 of many | Next