Hoogle Search

Within LTS Haskell 24.51 (ghc-9.10.3)

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

Exact lookup

1. maybeNamed :: Expr -> Parser (Named_ Expr)

   Agda	Agda.Syntax.Parser.Helpers

   When given expression is e1 = e2, turn it into a named expression. Call this inside an implicit argument {e} or {{e}}, where an equality must be a named argument (rather than a cubical partial match).

2. maybeFlexiblePattern :: forall (m :: Type -> Type) . (IsFlexiblePattern a, HasConstInfo m, MonadDebug m) => a -> MaybeT m FlexibleVarKind

   Agda	Agda.TypeChecking.Rules.LHS

   No documentation available.

3. maybeLeft :: Either a b -> Maybe a

   Agda	Agda.Utils.Either

   Safe projection from Left.

   maybeLeft (Left a) = Just a
   maybeLeft Right{}  = Nothing
   

4. maybeRight :: Either a b -> Maybe b

   Agda	Agda.Utils.Either

   Safe projection from Right.

   maybeRight (Right b) = Just b
   maybeRight Left{}    = Nothing
   

5. maybeToEither :: e -> Maybe a -> Either e a

   Agda	Agda.Utils.Either

   Convert Maybe to Either e, given an error e for the Nothing case.

6. maybeM :: Monad m => m b -> (a -> m b) -> m (Maybe a) -> m b

   Agda	Agda.Utils.Maybe

   Monadic version of maybe.

7. maybeM :: Monad m => m b -> (a -> m b) -> m (Maybe a) -> m b

   Agda	Agda.Utils.Maybe.Strict

   Monadic version of maybe.

8. maybeTokenCat :: Cat -> Maybe TokenCat

   BNFC	BNFC.CF

   No documentation available.

9. maybeLsb :: Ranked t => t -> Maybe Int

   OrderedBits	Data.Bits.Ordered

   Maybe the lowest active bit.

10. maybeNextActive :: Ranked t => Int -> t -> Maybe Int

    OrderedBits	Data.Bits.Ordered

    Return next active bit, using Maybe.

Page 63 of many | Previous | Next