Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. mapKeys :: (Interval k2 e, Ord k2) => (k1 -> k2) -> IntervalMap k1 a -> IntervalMap k2 a

   IntervalMap	Data.IntervalMap.Strict

   O(n log n). mapKeys f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the value at the smallest of these keys is retained.

2. mapKeysMonotonic :: (Interval k2 e, Ord k2) => (k1 -> k2) -> IntervalMap k1 a -> IntervalMap k2 a

   IntervalMap	Data.IntervalMap.Strict

   O(n). mapKeysMonotonic f s == mapKeys f s, but works only when f is strictly monotonic. That is, for any values x and y, if x < y then f x < f y. The precondition is not checked.

3. mapKeysWith :: (Interval k2 e, Ord k2) => (a -> a -> a) -> (k1 -> k2) -> IntervalMap k1 a -> IntervalMap k2 a

   IntervalMap	Data.IntervalMap.Strict

   O(n log n). mapKeysWith c f s is the map obtained by applying f to each key of s. The size of the result may be smaller if f maps two or more distinct keys to the same new key. In this case the associated values will be combined using c.

4. mapMaybe :: Interval k e => (a -> Maybe b) -> IntervalMap k a -> IntervalMap k b

   IntervalMap	Data.IntervalMap.Strict

   O(n). Map values and collect the Just results.

5. mapMaybeWithKey :: Interval k e => (k -> a -> Maybe b) -> IntervalMap k a -> IntervalMap k b

   IntervalMap	Data.IntervalMap.Strict

   O(n). Map keys/values and collect the Just results.

6. mapWithKey :: (k -> a -> b) -> IntervalMap k a -> IntervalMap k b

   IntervalMap	Data.IntervalMap.Strict

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

7. mapMonotonic :: (Interval k2 e, Ord k2) => (k1 -> k2) -> IntervalSet k1 -> IntervalSet k2

   IntervalMap	Data.IntervalSet

   O(n). mapMonotonic f s == map f s, but works only when f is strictly monotonic. That is, for any values x and y, if x < y then f x < f y. The precondition is not checked.

8. mappedText :: [(Text, a)] -> String a

   aeson-value-parser	AesonValueParser

   No documentation available.

9. mapConcurrentlyBatched :: (NFData b, Foldable t) => Int -> ([[b]] -> IO r) -> (a -> IO b) -> t a -> IO r

   async-extra	Control.Concurrent.Async.Extra

   Span green threads to perform N (batch size) tasks in one thread and merge results using provided merge function

10. mapConcurrentlyBatched_ :: Foldable t => Int -> (a -> IO ()) -> t a -> IO ()

    async-extra	Control.Concurrent.Async.Extra

    Span green threads to perform N (batch size) tasks in one thread and ignore results

Page 373 of many | Previous | Next