Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. newtype MaybeT (m :: Type -> Type) a

   ghc	GHC.Data.Maybe

   The parameterizable maybe monad, obtained by composing an arbitrary monad with the Maybe monad. Computations are actions that may produce a value or exit. The return function yields a computation that produces that value, while >>= sequences two subcomputations, exiting if either computation does.

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

   ghc	GHC.Data.Maybe

   No documentation available.

3. data MaybeMap (m :: Type -> Type) a

   ghc	GHC.Data.TrieMap

   No documentation available.

4. data MaybeUB a

   ghc	GHC.Data.Unboxed

   Like Maybe, but using unboxed sums. Use with care. Using a unboxed maybe is not always a win in execution *time* even when allocations go down. So make sure to benchmark for execution time as well. If the difference in *runtime* for the compiler is too small to measure it's likely better to use a regular Maybe instead. This is since it causes more function arguments to be passed, and potentially more variables to be captured by closures increasing closure size.

5. MaybeRecompile :: Fingerprint -> PluginRecompile

   ghc	GHC.Driver.Plugins

   No documentation available.

6. MaybeBot :: BotInfo

   ghc	GHC.HsToCore.Pmc.Solver.Types

   No documentation available.

7. data MaybeValidated a

   ghc	GHC.Iface.Recomp

   No documentation available.

8. data MaybeNew

   ghc	GHC.Tc.Solver.Monad

   No documentation available.

9. MaybeGivenEqs :: HasGivenEqs

   ghc	GHC.Tc.Types.Constraint

   No documentation available.

10. MayBeFlaky :: !Maybe String -> FlakinessMode

    sydtest	Test.Syd

    No documentation available.

Page 15 of many | Previous | Next