Hoogle Search

Within Stackage Nightly 2025-08-12 (ghc-9.12.2)

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

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

    LambdaHack Game.LambdaHack.Core.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]

    cabal-install-solver Distribution.Solver.Compat.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]

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

    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, ...]
    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]

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

    dimensional Numeric.Units.Dimensional.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]

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

    faktory Faktory.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]

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

    constrained-categories Control.Category.Constrained.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]

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

    constrained-categories Control.Category.Hask

    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]

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

    listsafe Data.List.Safe

    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]

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

    xmonad-contrib XMonad.Config.Prime

    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]

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

    xmonad-contrib XMonad.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]

Page 3 of many | Previous | Next