Hoogle Search

Within LTS Haskell 22.29 (ghc-9.6.6)

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, ...]
    
    >>> map (+1) [1, 2, 3]
    [2,3,4]
    

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

    amazonka-core Amazonka.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, ...]
    
    >>> map (+1) [1, 2, 3]
    [2,3,4]
    

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

    ghc GHC.Prelude.Basic

    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]
    

  4. map :: Functor m => (a -> b) -> Pipe a b m r

    pipes Pipes.Prelude

    Apply a function to all values flowing downstream

    map id = cat
    
    map (g . f) = map f >-> map g
    

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

    rio RIO.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, ...]
    
    >>> map (+1) [1, 2, 3]
    [2,3,4]
    

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

    Cabal-syntax Distribution.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, ...]
    
    >>> map (+1) [1, 2, 3]
    [2,3,4]
    

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

    ghc-lib-parser GHC.Prelude.Basic

    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]
    

  8. map :: Monad m => (a -> b) -> Stream (Of a) m r -> Stream (Of b) m r

    streaming Streaming.Prelude

    Standard map on the elements of a stream.

    >>> S.stdoutLn $ S.map reverse $ each (words "alpha beta")
    ahpla
    ateb
    

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

    numhask NumHask.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, ...]
    
    >>> map (+1) [1, 2, 3]
    [2,3,4]
    

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

    prelude-compat Prelude2010

    No documentation available.

Page 1 of many | Next