Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

Exact lookup

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

   Agda	Agda.Utils.Maybe

   Monadic version of maybe.

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

   Agda	Agda.Utils.Maybe.Strict

   Monadic version of maybe.

3. maybeTokenCat :: Cat -> Maybe TokenCat

   BNFC	BNFC.CF

   No documentation available.

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

   OrderedBits	Data.Bits.Ordered

   Maybe the lowest active bit.

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

   OrderedBits	Data.Bits.Ordered

   Return next active bit, using Maybe.

6. mayBecomeMultipleArgs :: Token -> Bool

   ShellCheck	ShellCheck.ASTLib

   No documentation available.

7. maybeToEvent :: Maybe a -> Event a

   Yampa	FRP.Yampa

   Convert a maybe value into a event (Event is isomorphic to Maybe).

8. maybeToEvent :: Maybe a -> Event a

   Yampa	FRP.Yampa.Event

   Convert a maybe value into a event (Event is isomorphic to Maybe).

9. maybeKey :: Key -> Decoder a -> Decoder (Maybe a)

   aeson-combinators	Data.Aeson.Combinators.Decode

   Same as key but works with omitted attributes in payloads and produces parsed values in the context of Maybe. Note that this combinator behaves differently to a combination of maybe and key, which produce error if the attribute is missing from the json object. >>> decode (maybeKey "data" int) "{}" Just Nothing

10. maybeDecoder :: Decoder r -> Maybe r

    binary-parsers	Data.Binary.Parser

    Convert a Decoder value to a Maybe value. A Partial result is treated as failure. Since: 0.2.3.0

Page 63 of many | Previous | Next