Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

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

    ghc-lib-parser GHC.Data.Maybe

    No documentation available.

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

    ghc-lib-parser GHC.Data.TrieMap

    No documentation available.

  3. data MaybeUB a

    ghc-lib-parser 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.

  4. MaybeRecompile :: Fingerprint -> PluginRecompile

    ghc-lib-parser GHC.Driver.Plugins

    No documentation available.

  5. MaybeBot :: BotInfo

    ghc-lib-parser GHC.HsToCore.Pmc.Solver.Types

    No documentation available.

  6. MaybeGivenEqs :: HasGivenEqs

    ghc-lib-parser GHC.Tc.Types.Constraint

    No documentation available.

  7. data MaybeFin# (a :: Nat)

    natural-arithmetic Arithmetic.Types

    Either a Fin# or Nothing. Internally, this uses negative one to mean Nothing.

  8. pattern MaybeFinJust# :: Fin# n -> MaybeFin# n

    natural-arithmetic Arithmetic.Types

    No documentation available.

  9. pattern MaybeFinNothing# :: MaybeFin# n

    natural-arithmetic Arithmetic.Types

    No documentation available.

  10. newtype MaybeFin# (a :: Nat)

    natural-arithmetic Arithmetic.Unsafe

    Either a Fin# or Nothing. Internally, this uses negative one to mean Nothing.

Page 19 of many | Previous | Next