Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

Exact lookup

1. mapM_ :: (Monad m, Unboxable a) => (a -> m b) -> Vector a -> m ()

   unboxing-vector	Data.Vector.Unboxing

   No documentation available.

2. mapMaybe :: (Unboxable a, Unboxable b) => (a -> Maybe b) -> Vector a -> Vector b

   unboxing-vector	Data.Vector.Unboxing

   No documentation available.

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

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

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

   IntervalMap	Data.IntervalMap.Generic.Lazy

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

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

   IntervalMap	Data.IntervalMap.Generic.Strict

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

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

   IntervalMap	Data.IntervalMap.Generic.Strict

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

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

   IntervalMap	Data.IntervalMap.Lazy

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

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

   IntervalMap	Data.IntervalMap.Lazy

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

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

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

Page 59 of many | Previous | Next