Hoogle Search

Within LTS Haskell 23.24 (ghc-9.8.4)

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

Exact lookup

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 :: forall (m :: Type -> Type) a b r . 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
   

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

   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]

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

   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]

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

   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 :: forall (m :: Type -> Type) a b r . 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
   

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

   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]

   prelude-compat	Prelude2010

   No documentation available.

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

   mixed-types-num	Numeric.MixedTypes.PreludeHiding

   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]

    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]
    

Page 1 of many | Next