Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

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

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

7. data MyMaybe a

   LPFP-core	LPFPCore.SimpleVec

   No documentation available.

8. evalMaybeT :: Functor m => MaybeT m a -> a -> m a

   alternators	Control.Monad.Trans.Maybe.Extras

   The more useful version is to use evalMaybeT flipped so it can be in a chain of transformer runners, like this evalCont . (evalMaybeT val) This argument ordering is consistent with evalStateT.

9. class ReifyMaybeSymbol (mstr :: Maybe Symbol)

   bytezap	Bytezap.Parser.Struct.Generic

   No documentation available.

10. reifyMaybeSymbol :: ReifyMaybeSymbol mstr => Maybe String

    bytezap	Bytezap.Parser.Struct.Generic

    No documentation available.

Page 290 of many | Previous | Next