Hoogle Search

Within LTS Haskell 24.46 (ghc-9.10.3)

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

Exact lookup

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

   text	Data.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.

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

   text	Data.Text.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
   

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

   text	Data.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.

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

   containers	Data.IntMap.Internal

   Map a function over all values in the map.

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

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

   containers	Data.IntMap.Lazy

   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) -> IntMap a -> IntMap b

   containers	Data.IntMap.Strict

   Map a function over all values in the map.

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

7. map :: (a -> b) -> IntMap a -> IntMap b

   containers	Data.IntMap.Strict.Internal

   Map a function over all values in the map.

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

8. map :: (Key -> Key) -> IntSet -> IntSet

   containers	Data.IntSet

   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 :: (Key -> Key) -> IntSet -> IntSet

   containers	Data.IntSet.Internal

   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

10. map :: (a -> b) -> Map k a -> Map k b

    containers	Data.Map.Internal

    Map a function over all values in the map.

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

Page 14 of many | Previous | Next