Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. map :: (branch0 -> branch1) -> (leaf0 -> leaf1) -> T i branch0 leaf0 -> T i branch1 leaf1

   wraxml	Data.Tree.BranchLeafLabel

   No documentation available.

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

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

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

   IntervalMap	Data.IntervalMap.Generic.Strict

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

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

   IntervalMap	Data.IntervalMap.Lazy

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

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

   IntervalMap	Data.IntervalMap.Strict

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

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

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

   bencoding	Data.BEncode.BDict

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

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

   byteset	Data.ByteSet

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

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

   classy-prelude-yesod	ClassyPrelude.Yesod

   No documentation available.

10. map :: Selector

    clay	Clay

    No documentation available.

Page 44 of many | Previous | Next