Idris2Doc : Control.Monad.Maybe

Control.Monad.Maybe

MaybeT : (Type -> Type) -> Type -> Type
Totality: total
Constructor: 
MkMaybeT : m (Maybea) -> MaybeTma
fromMaybeT : Monadm => ma -> MaybeTma -> ma
isJustT : Functorm => MaybeTma -> mBool
isNothingT : Functorm => MaybeTma -> mBool
just : Applicativem => a -> MaybeTma
Analogous to Just, aka pure for MaybeT
mapMaybeT : (m (Maybea) -> n (Maybea')) -> MaybeTma -> MaybeTna'
map the underlying computation
The basic 'unwrap, apply, rewrap' of this transformer.
maybeT : Monadm => mb -> (a -> mb) -> MaybeTma -> mb
nothing : Applicativem => MaybeTma
Analogous to Nothing, aka empty for MaybeT
runMaybeT : MaybeTma -> m (Maybea)
toMaybeT : Functorm => Bool -> ma -> MaybeTma