Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

1. mapMaybeMS :: Monad m => (a -> m (Maybe b)) -> StreamConduit a m b

   conduit	Data.Conduit.Internal.List.Stream

   No documentation available.

2. mapMaybeS :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> StreamConduit a m b

   conduit	Data.Conduit.Internal.List.Stream

   No documentation available.

3. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> ConduitT a b m ()

   conduit	Data.Conduit.List

   Apply a monadic transformation that may fail to all values in a stream, discarding the failures. Subject to fusion Since 0.5.1

4. mapMaybeT :: MonadGen m => (a -> Maybe b) -> m a -> m b

   hedgehog	Hedgehog.Gen

   Generates a value which is the result of the given function returning a Just. The original generator's shrink tree will be retained, with values returning Nothing removed. Subsequent shrinks of those values will be retained. Compared to mapMaybeT, shrinking may be slower but will be optimal. The type is also more general, because the shrink behavior from mapMaybe would force the entire shrink tree to be evaluated when applied to an impure tree. It's possible that the function will never return Just, or will only do so a larger size than we're currently running at. To avoid looping forever, we limit the number of retries, and grow the size with each retry. If we retry too many times then the whole generator is discarded.

5. mapMaybeT :: MonadGen m => (a -> Maybe b) -> m a -> m b

   hedgehog	Hedgehog.Internal.Gen

   Generates a value which is the result of the given function returning a Just. The original generator's shrink tree will be retained, with values returning Nothing removed. Subsequent shrinks of those values will be retained. Compared to mapMaybeT, shrinking may be slower but will be optimal. The type is also more general, because the shrink behavior from mapMaybe would force the entire shrink tree to be evaluated when applied to an impure tree. It's possible that the function will never return Just, or will only do so a larger size than we're currently running at. To avoid looping forever, we limit the number of retries, and grow the size with each retry. If we retry too many times then the whole generator is discarded.

6. mapMaybeMaybeT :: (a -> Maybe b) -> TreeT (MaybeT Identity) a -> TreeT (MaybeT Identity) b

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

7. mapMaybeT :: forall (m :: Type -> Type) a b . (Monad m, Alternative m) => (a -> Maybe b) -> TreeT m a -> TreeT m b

   hedgehog	Hedgehog.Internal.Tree

   No documentation available.

8. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

   extra	Control.Monad.Extra

   A version of mapMaybe that works with a monadic predicate.

9. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> [a] -> m [b]

   extra	Extra

   A version of mapMaybe that works with a monadic predicate.

10. mapMaybeStep :: forall (m :: Type -> Type) a b . Functor m => (a -> Maybe b) -> StepT m a -> StepT m b

    servant	Servant.Types.SourceT

    No documentation available.

Page 16 of many | Previous | Next