Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. fromMaybeContext :: forall (p :: Pass) . Maybe (LHsContext (GhcPass p)) -> HsContext (GhcPass p)

   ghc-lib-parser	GHC.Hs.Type

   No documentation available.

2. fromMaybe_ :: BeamSqlBackend be => QGenExpr ctxt be s a -> QGenExpr ctxt be s (Maybe a) -> QGenExpr ctxt be s a

   beam-core	Database.Beam.Query

   Convert a Maybe value to a concrete value, by suppling a default

3. fromMaybeS :: Selective f => f a -> f (Maybe a) -> f a

   rebase	Rebase.Prelude

   A lifted version of fromMaybe.

4. fromMaybeX :: MaybeX a -> a

   clash-prelude	Clash.XException.MaybeX

   Deconstruct MaybeX into an a - the opposite of toMaybeX. Be careful when using this function, because it might return an XException if the argument was IsX.

5. fromMaybeOrd :: Maybe Ordering -> PartialOrdering

   partialord	Data.PartialOrd

   Convert an ordering into a partial ordering

6. fromMaybeNullableText :: forall (n :: Nat) . Maybe (NullableNonEmptyText n) -> NullableNonEmptyText n

   string-variants	Data.StringVariants

   No documentation available.

7. fromMaybeNullableText :: forall (n :: Nat) . Maybe (NullableNonEmptyText n) -> NullableNonEmptyText n

   string-variants	Data.StringVariants.NullableNonEmptyText

   No documentation available.

8. fromMaybes :: [Maybe a] -> Pattern a

   tidal-core	Sound.Tidal.Core

   'fromMaybes; is similar to fromList, but allows values to be optional using the Maybe type, so that Nothing results in gaps in the pattern. The following are equivalent: > d1 $ n (fromMaybes [Just 0, Nothing, Just 2]) # s "superpiano" > d1 $ n "0 ~ 2" # s "superpiano"

9. fromMaybeM :: Monad m => m a -> m (Maybe a) -> m a

   Agda	Agda.Utils.Maybe

   Monadic version of fromMaybe.

10. fromMaybeM :: Monad m => m a -> m (Maybe a) -> m a

    Agda	Agda.Utils.Maybe.Strict

    Monadic version of fromMaybe.

Page 6 of many | Previous | Next