Idris2Doc : Control.Monad.Maybe

Control.Monad.Maybe

dataMaybeT : (Type -> Type) -> Type -> Type
Totality: total
Constructor: 
MkMaybeT : m (Maybea) -> MaybeTma
fromMaybeT : Monadm => ma -> MaybeTma -> ma
Totality: total
isJustT : Functorm => MaybeTma -> mBool
Totality: total
isNothingT : Functorm => MaybeTma -> mBool
Totality: total
just : Applicativem => a -> MaybeTma
  Analogous to Just, aka pure for MaybeT

Totality: total
mapMaybeT : (m (Maybea) -> n (Maybea')) -> MaybeTma -> MaybeTna'
  map the underlying computation
The basic 'unwrap, apply, rewrap' of this transformer.

Totality: total
maybeT : Monadm => mb -> (a -> mb) -> MaybeTma -> mb
Totality: total
nothing : Applicativem => MaybeTma
  Analogous to Nothing, aka empty for MaybeT

Totality: total
runMaybeT : MaybeTma -> m (Maybea)
Totality: total
toMaybeT : Functorm => Bool -> ma -> MaybeTma
Totality: total