Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

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

   ghc-internal	GHC.Internal.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]
   

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

   ghc-internal	GHC.Internal.Data.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]
   

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

   ghc-internal	GHC.Internal.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]
   

4. map :: (a -> b) -> Infinite a -> Infinite b

   infinite-list	Data.List.Infinite

   Apply a function to every element of an infinite list.

5. map :: (Char -> Char) -> JSString -> JSString

   jsaddle	Data.JSString

   O(n) map f t is the JSString obtained by applying f to each element of t. Subject to fusion. Performs replacement on invalid scalar values.

6. map :: (Char -> Char) -> Stream Char -> Stream Char

   jsaddle	Data.JSString.Internal.Fusion.Common

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

   unstream . map f . stream = map f
   

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

   numeric-prelude	NumericPrelude

   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]

   numeric-prelude	NumericPrelude.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]
   

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

   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 :: (k -> p -> v -> w) -> HashPSQ k p v -> HashPSQ k p w

    psqueues	Data.HashPSQ

    O(n) Modify every value in the queue.

Page 25 of many | Previous | Next