Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

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

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

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

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

   infinite-list	Data.List.Infinite

   Apply a function to every element of an infinite list.

6. map :: (Index ix, Source r e') => (e' -> e) -> Array r ix e' -> Array D ix e

   massiv	Data.Massiv.Array

   Map a function over an array

7. map :: forall (m :: Type -> Type) r . Monad m => (Word8 -> Word8) -> Pipe ByteString ByteString m r

   pipes-bytestring	Pipes.ByteString

   Apply a transformation to each Word8 in the stream

8. map :: Functor f => (a -> b) -> f a -> f b

   protolude	Protolude

   No documentation available.

9. map :: Ord c => (a -> c) -> Bimap a b -> Bimap c b

   bimap	Data.Bimap

   O(n*log n) Map a function over all the left keys in the map. Version 0.3

10. 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.

Page 25 of many | Previous | Next