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.

Exact lookup

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

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

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

   automaton	Data.Automaton.Trans.Maybe

   Convert a Maybe computation to MaybeT.

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

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

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

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

8. runMaybeS :: forall (m :: Type -> Type) a b . (Functor m, Monad m) => Automaton (MaybeT m) a b -> Automaton m a (Maybe b)

   automaton	Data.Automaton.Trans.Maybe

   Remove the MaybeT layer by outputting Nothing when the exception occurs. The current state is then tested again on the next input.

9. runMaybeT :: MaybeT (m :: Type -> Type) a -> m (Maybe a)

   automaton	Data.Automaton.Trans.Maybe

   No documentation available.

10. untilMaybe :: forall (m :: Type -> Type) a b . Monad m => Automaton m a b -> Automaton m b Bool -> Automaton (MaybeT m) a b

    automaton	Data.Automaton.Trans.Maybe

    Run the first automaton until the second one produces True from the output of the first.

Page 228 of many | Previous | Next