Hoogle Search

Within LTS Haskell 24.16 (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) -> IntervalMap k a -> IntervalMap k b

   IntervalMap	Data.IntervalMap.Lazy

   O(n). Map a function over all values in the map.

2. map :: (a -> b) -> IntervalMap k a -> IntervalMap k b

   IntervalMap	Data.IntervalMap.Strict

   O(n). Map a function over all values in the map.

3. map :: (Interval b e2, Ord b) => (a -> b) -> IntervalSet a -> IntervalSet b

   IntervalMap	Data.IntervalSet

   O(n log n). Map a function over all values in the set. The size of the result may be smaller if f maps two or more distinct elements to the same value.

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

   bencoding	Data.BEncode.BDict

   O(n). Map a function over all values in the dictionary.

5. map :: (Word8 -> Word8) -> ByteSet -> ByteSet

   byteset	Data.ByteSet

   O(n). Map a function over a byteset.

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

   classy-prelude-yesod	ClassyPrelude.Yesod

   No documentation available.

7. map :: Selector

   clay	Clay

   No documentation available.

8. map :: Selector

   clay	Clay.Elements

   No documentation available.

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

   constrained-categories	Control.Category.Constrained.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 :: (a -> b) -> [a] -> [b]

    constrained-categories	Control.Category.Hask

    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]
    

Page 33 of many | Previous | Next