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.
mapMaybe :: Interval k e => (a -> Maybe b) -> IntervalMap k a -> IntervalMap k bIntervalMap Data.IntervalMap.Lazy 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.Lazy O(n). Map keys/values and collect the Just results.
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.
-
LPFP-core LPFPCore.SimpleVec No documentation available.
evalMaybeT :: Functor m => MaybeT m a -> a -> m aalternators 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.
class
ReifyMaybeSymbol (mstr :: Maybe Symbol)bytezap Bytezap.Parser.Struct.Generic No documentation available.
reifyMaybeSymbol :: ReifyMaybeSymbol mstr => Maybe Stringbytezap Bytezap.Parser.Struct.Generic No documentation available.
-
classy-prelude-yesod ClassyPrelude.Yesod No documentation available.
-
classy-prelude-yesod ClassyPrelude.Yesod The Maybe keyword goes after the type. This indicates that the column is nullable, and the generated Haskell code will have a Maybe type for it. Example:
User name Text Maybe