Hoogle Search

Within LTS Haskell 22.22 (ghc-9.6.5)

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

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

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

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

    rebase Rebase.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]

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

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

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

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

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

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

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

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

  7. map :: Monad m => (a -> b) -> Stream (Of a) m r % 1 -> Stream (Of b) m r

    linear-base Streaming.Prelude.Linear

    Standard map on the elements of a stream. 

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

  8. map :: (a -> b) -> Vec n a -> Vec n b

    clash-prelude Clash.Explicit.Prelude

    "map f xs" is the vector obtained by applying f to each element of xs, i.e., 

    map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
    and corresponds to the following circuit layout:

  9. map :: (a -> b) -> Vec n a -> Vec n b

    clash-prelude Clash.Explicit.Prelude.Safe

    "map f xs" is the vector obtained by applying f to each element of xs, i.e., 

    map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
    and corresponds to the following circuit layout:

  10. map :: (a -> b) -> Vec n a -> Vec n b

    clash-prelude Clash.Prelude

    "map f xs" is the vector obtained by applying f to each element of xs, i.e., 

    map f (x1 :> x2 :>  ... :> xn :> Nil) == (f x1 :> f x2 :> ... :> f xn :> Nil)
    and corresponds to the following circuit layout:

Page 2 of many | Previous | Next