- data MaybeT : (Type -> Type) -> Type -> Type
- Totality: total
Constructor: - MkMaybeT : m (Maybe a) -> MaybeT m a
- fromMaybeT : Monad m => m a -> MaybeT m a -> m a
- Totality: total
- isJustT : Functor m => MaybeT m a -> m Bool
- Totality: total
- isNothingT : Functor m => MaybeT m a -> m Bool
- Totality: total
- just : Applicative m => a -> MaybeT m a
Analogous to Just, aka pure for MaybeT
Totality: total- mapMaybeT : (m (Maybe a) -> n (Maybe a')) -> MaybeT m a -> MaybeT n a'
map the underlying computation
The basic 'unwrap, apply, rewrap' of this transformer.
Totality: total- maybeT : Monad m => m b -> (a -> m b) -> MaybeT m a -> m b
- Totality: total
- nothing : Applicative m => MaybeT m a
Analogous to Nothing, aka empty for MaybeT
Totality: total- runMaybeT : MaybeT m a -> m (Maybe a)
- Totality: total
- toMaybeT : Functor m => Bool -> m a -> MaybeT m a
- Totality: total