Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybe :: Interval k e => (a -> Maybe b) -> IntervalMap k a -> IntervalMap k bIntervalMap Data.IntervalMap.Strict O(n). Map values and collect the Just results.
mapMaybeWithKey :: Interval k e => (k -> a -> Maybe b) -> IntervalMap k a -> IntervalMap k bIntervalMap Data.IntervalMap.Strict O(n). Map keys/values and collect the Just results.
mapWithKey :: (k -> a -> b) -> IntervalMap k a -> IntervalMap k bIntervalMap Data.IntervalMap.Strict O(n). Map a function over all values in the map.
mapMonotonic :: (Interval k2 e, Ord k2) => (k1 -> k2) -> IntervalSet k1 -> IntervalSet k2IntervalMap 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.
mappedText :: [(Text, a)] -> String aaeson-value-parser AesonValueParser No documentation available.
-
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
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
mapConcurrentlyBounded :: Traversable t => Int -> (a -> IO b) -> t a -> IO (t b)async-extra Control.Concurrent.Async.Extra Span a green thread for each task, but only execute N tasks concurrently.
mapConcurrentlyBounded_ :: Traversable t => Int -> (a -> IO ()) -> t a -> IO ()async-extra Control.Concurrent.Async.Extra Span a green thread for each task, but only execute N tasks concurrently. Ignore the result
-
async-extra Control.Concurrent.Async.Extra Split input into N chunks with equal length and work on each chunk in a dedicated green thread. Then merge results using provided merge function