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. throwMaybe :: forall (m :: Type -> Type) e void . Monad m => Automaton (ExceptT e m) (Maybe e) (Maybe void)

   automaton	Data.Automaton.Trans.Except

   When the input is Just e, throw the exception e. This does not output any data since it terminates on the first nontrivial input.

2. throwOnMaybe :: forall (m :: Type -> Type) a e . Monad m => (a -> Maybe e) -> Automaton (ExceptT e m) a a

   automaton	Data.Automaton.Trans.Except

   When the predicate evaluates to Just e, throw the exception e, otherwise forward the input.

3. catchMaybe :: forall (m :: Type -> Type) a b . (Functor m, Monad m) => Automaton (MaybeT m) a b -> Automaton m a b -> Automaton m a b

   automaton	Data.Automaton.Trans.Maybe

   When an exception occurs in the first automaton, the second automaton is executed from there.

4. exceptToMaybeS :: forall (m :: Type -> Type) e a b . (Functor m, Monad m) => Automaton (ExceptT e m) a b -> Automaton (MaybeT m) a b

   automaton	Data.Automaton.Trans.Maybe

   Convert exceptions into Nothing, discarding the exception value.

5. exceptToMaybeT :: forall (m :: Type -> Type) e a . Functor m => ExceptT e m a -> MaybeT m a

   automaton	Data.Automaton.Trans.Maybe

   Convert a ExceptT computation to MaybeT, discarding the value of any exception.

6. hoistMaybe :: forall (m :: Type -> Type) b . Applicative m => Maybe b -> MaybeT m b

   automaton	Data.Automaton.Trans.Maybe

   Convert a Maybe computation to MaybeT.

7. inMaybeT :: forall (m :: Type -> Type) a . Monad m => Automaton (MaybeT m) (Maybe a) a

   automaton	Data.Automaton.Trans.Maybe

   Embed a Maybe value in the MaybeT layer. Identical to maybeExit.

8. listToMaybeS :: forall (m :: Type -> Type) b a . (Functor m, Monad m) => [b] -> Automaton (MaybeT m) a b

   automaton	Data.Automaton.Trans.Maybe

   Converts a list to an Automaton in MaybeT, which outputs an element of the list at each step, throwing Nothing when the list ends.

9. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   automaton	Data.Automaton.Trans.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

10. reactimateMaybe :: (Functor m, Monad m) => Automaton (MaybeT m) () () -> m ()

    automaton	Data.Automaton.Trans.Maybe

    reactimates an Automaton in the MaybeT monad until it throws Nothing.

Page 227 of many | Previous | Next