Hoogle Search
Within LTS Haskell 24.36 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
containers Data.Sequence.Internal.Sorting A foldMapWithIndex-like function, specialized to the Option monoid, which takes advantage of the internal structure of Seq to avoid wrapping in Maybe at certain points.
exceptToMaybeT :: forall (m :: Type -> Type) e a . Functor m => ExceptT e m a -> MaybeT m atransformers Control.Monad.Trans.Maybe Convert a ExceptT computation to MaybeT, discarding the value of any exception.
hoistMaybe :: forall (m :: Type -> Type) b . Applicative m => Maybe b -> MaybeT m btransformers Control.Monad.Trans.Maybe mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n btransformers Control.Monad.Trans.Maybe Transform the computation inside a MaybeT.
runMaybeT :: MaybeT (m :: Type -> Type) a -> m (Maybe a)transformers Control.Monad.Trans.Maybe No documentation available.
suchThatMaybe :: Gen a -> (a -> Bool) -> Gen (Maybe a)QuickCheck Test.QuickCheck Tries to generate a value that satisfies a predicate. If it fails to do so after enough attempts, returns Nothing.
suchThatMaybe :: Gen a -> (a -> Bool) -> Gen (Maybe a)QuickCheck Test.QuickCheck.Gen Tries to generate a value that satisfies a predicate. If it fails to do so after enough attempts, returns Nothing.
mapMaybe :: (a -> Maybe b) -> KeyMap a -> KeyMap baeson Data.Aeson.KeyMap Map values and collect the Just results.
mapMaybeWithKey :: (Key -> v -> Maybe u) -> KeyMap v -> KeyMap uaeson Data.Aeson.KeyMap Map values and collect the Just results.
explicitParseFieldMaybe :: (Value -> Parser a) -> Object -> Key -> Parser (Maybe a)aeson Data.Aeson.Types Variant of .:? with explicit parser function.