Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

Exact lookup

1. mapMaybeWithKey :: (Build1 -> a -> Maybe b) -> Radix1Tree a -> Radix1Tree b

   radix-tree	Data.Radix1Tree.Word8.Strict

   Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.

2. mapMaybeWithKey :: (Build -> a -> Maybe b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Lazy

   Apply a function to every value in the tree and create one out of Just values.

3. mapMaybeWithKey :: (Build -> a -> Maybe b) -> RadixTree a -> RadixTree b

   radix-tree	Data.RadixTree.Word8.Strict

   Apply a function to every value in the tree and create one out of Just values. The Maybe is evaluated to WHNF.

4. mapMaybeM :: (IsStream t, MonadAsync m, Functor (t m)) => (a -> m (Maybe b)) -> t m a -> t m b

   streamly	Streamly.Internal.Data.Stream.IsStream

   Like mapMaybe but maps a monadic function. Equivalent to:

   mapMaybeM f = Stream.map fromJust . Stream.filter isJust . Stream.mapM f
   

   Concurrent (do not use with fromParallel on infinite streams)

5. mapMaybeM :: (IsStream t, MonadAsync m, Functor (t m)) => (a -> m (Maybe b)) -> t m a -> t m b

   streamly	Streamly.Prelude

   Like mapMaybe but maps a monadic function. Equivalent to:

   mapMaybeM f = Stream.map fromJust . Stream.filter isJust . Stream.mapM f
   

   Concurrent (do not use with fromParallel on infinite streams)

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

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

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

10. mapMaybeOccEnv :: (a -> Maybe b) -> OccEnv a -> OccEnv b

    ghc-lib	GHC.Plugins

    mapMaybe for b OccEnv.

Page 27 of many | Previous | Next