Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
newtype
MaybeT (m :: Type -> Type) adunai Control.Monad.Trans.MSF.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) adunai Control.Monad.Trans.MSF.Maybe No documentation available.
type
MaybePromotedName = MaybePromotedName ()haskell-src-exts-simple Language.Haskell.Exts.Simple.Syntax No documentation available.
module Data.Histogram.Bin.
MaybeBin No documentation available.
-
histogram-fill Data.Histogram.Bin.MaybeBin This binning algorithms adds special case of no value.
MaybeBin :: bin -> MaybeBin binhistogram-fill Data.Histogram.Bin.MaybeBin No documentation available.
-
hledger-iadd Model No documentation available.
-
mappings Data.Bijection A newtype, just to get a partial monoidal structure representing consistent unions.
MaybeBij :: Maybe Bij -> MaybeBijmappings Data.Bijection No documentation available.
-
Defines MaybeLike typeclass - a generic way to look at some types as if they were Maybe It is currently used to add maybe-ness to unboxed primitive types in cases when it isn't possuble to just use `Maybe a` (e.g. unboxed arrays)