Hoogle Search
Within LTS Haskell 24.31 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
MaybeApply :: Either (f a) a -> MaybeApply (f :: Type -> Type) arebase Rebase.Prelude No documentation available.
newtype
MaybeT (m :: Type -> Type) arebase Rebase.Prelude 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.
MaybeT :: m (Maybe a) -> MaybeT (m :: Type -> Type) arebase Rebase.Prelude No documentation available.
-
apecs Apecs.Components Pseudostore used to produce values of type Maybe a. Will always return True for explExists. Writing can both set and delete a component using Just and Nothing respectively.
MaybeStore :: s -> MaybeStore sapecs Apecs.Components No documentation available.
newtype
MaybeT (m :: Type -> Type) aautomaton Data.Automaton.Trans.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.
MaybeT :: m (Maybe a) -> MaybeT (m :: Type -> Type) aautomaton Data.Automaton.Trans.Maybe No documentation available.
type family
MaybeToList (a :: Maybe Type) :: [Type]hvect Data.HVect No documentation available.
MaybePartiallyTrimmed :: FinalExceptionmmsyn7ukr-common Sound.Control.Exception.FinalException No documentation available.
module Clash.XException.
MaybeX Helpers to make XException explicit in the type system. Using these helpers can help programmers account for XExceptions properly in blackbox models or tests. Note that none of these operations can be translated to HDL.