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.

Exact lookup

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

   errors	Control.Error

   Transform the computation inside a MaybeT.

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

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

   errors	Control.Error

   No documentation available.

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

   errors	Control.Error.Util

   Lift a Maybe to the MaybeT monad

4. spanMaybe :: FactorialMonoid m => s -> (s -> m -> Maybe s) -> m -> (m, m, s)

   monoid-subclasses	Data.Monoid.Factorial

   A stateful variant of span, threading the result of the test function as long as it returns Just.

5. spanMaybe' :: FactorialMonoid m => s -> (s -> m -> Maybe s) -> m -> (m, m, s)

   monoid-subclasses	Data.Monoid.Factorial

   Strict version of spanMaybe.

6. spanMaybe :: TextualMonoid t => s -> (s -> t -> Maybe s) -> (s -> Char -> Maybe s) -> t -> (t, t, s)

   monoid-subclasses	Data.Monoid.Textual

   A stateful variant of span, threading the result of the test function as long as it returns Just.

7. spanMaybe' :: TextualMonoid t => s -> (s -> t -> Maybe s) -> (s -> Char -> Maybe s) -> t -> (t, t, s)

   monoid-subclasses	Data.Monoid.Textual

   Strict version of spanMaybe.

8. spanMaybe_ :: TextualMonoid t => s -> (s -> Char -> Maybe s) -> t -> (t, t, s)

   monoid-subclasses	Data.Monoid.Textual

   spanMaybe_ s = spanMaybe s (const . Just)
   

9. spanMaybe_' :: TextualMonoid t => s -> (s -> Char -> Maybe s) -> t -> (t, t, s)

   monoid-subclasses	Data.Monoid.Textual

   No documentation available.

10. indexMaybe :: OsString -> Int -> Maybe OsChar

    os-string	System.OsString

    O(1) OsString index, starting from 0, that returns Just if:

    0 <= n < length bs
    

Page 162 of many | Previous | Next