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 :: (Word8 -> Word8) -> ByteString -> ByteString

   rio	RIO.ByteString.Lazy

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

2. map :: (v1 -> v2) -> HashMap k v1 -> HashMap k v2

   rio	RIO.HashMap

   Transform this map by applying a function to every value.

3. map :: (Hashable b, Eq b) => (a -> b) -> HashSet a -> HashSet b

   rio	RIO.HashSet

   Transform this set by applying a function to every value. The resulting set may be smaller than the source.

   >>> HashSet.map show (HashSet.fromList [1,2,3])
   HashSet.fromList ["1","2","3"]
   

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

   rio	RIO.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) -> Map k a -> Map k b

   rio	RIO.Map

   Map a function over all values in the map.

   map (++ "x") (fromList [(5,"a"), (3,"b")]) == fromList [(3, "bx"), (5, "ax")]
   

6. map :: (a -> b) -> NonEmpty a -> NonEmpty b

   rio	RIO.NonEmpty

   Map a function over a NonEmpty stream.

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

8. map :: Ord b => (a -> b) -> Set a -> Set b

   rio	RIO.Set

   map f s is the set obtained by applying f to each element of s. It's worth noting that the size of the result may be smaller if, for some (x,y), x /= y && f x == f y

9. map :: (Char -> Char) -> Text -> Text

   rio	RIO.Text

   O(n) map f t is the Text obtained by applying f to each element of t. Example:

   >>> let message = pack "I am not angry. Not at all."
   
   >>> T.map (\c -> if c == '.' then '!' else c) message
   "I am not angry! Not at all!"
   

   Performs replacement on invalid scalar values.

10. map :: (Char -> Char) -> Text -> Text

    rio	RIO.Text.Lazy

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

Page 8 of many | Previous | Next