Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. mapMaybe :: Ord b => (a -> Maybe b) -> MaxQueue a -> MaxQueue b

   pqueue	Data.PQueue.Max

   Maps a function over the elements of the queue, and collects the Just values.

2. mapMaybe :: Ord b => (a -> Maybe b) -> MinQueue a -> MinQueue b

   pqueue	Data.PQueue.Min

   Map elements and collect the Just results.

3. mapMaybe :: Ord k => (a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k b

   pqueue	Data.PQueue.Prio.Max

   Map values and collect the Just results.

4. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k b

   pqueue	Data.PQueue.Prio.Max

   Map values and collect the Just results.

5. mapMaybe :: Ord k => (a -> Maybe b) -> MinPQueue k a -> MinPQueue k b

   pqueue	Data.PQueue.Prio.Min

   Map values and collect the Just results.

6. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MinPQueue k a -> MinPQueue k b

   pqueue	Data.PQueue.Prio.Min

   Map values and collect the Just results.

7. runMaybeByteArrayST :: (forall s . () => ST s (Maybe ByteArray)) -> Maybe ByteArray

   run-st	Control.Monad.ST.Run

   No documentation available.

8. fromMaybe :: (Steppable (->) t (Either a), Corecursive (->) t (Either a)) => Maybe a -> t

   yaya	Yaya.Applied

   Converts exceptional divergence to non-termination.

9. data AndMaybe a b

   yaya	Yaya.Pattern

   Isomorphic to (a, Maybe b), it’s also the pattern functor for non-empty lists.

10. andMaybe :: (a -> c) -> (a -> b -> c) -> AndMaybe a b -> c

    yaya	Yaya.Pattern

    Eliminator for AndMaybe, akin to either or maybe.

Page 217 of many | Previous | Next