final case class MaybeT[F[_], A](run: F[Maybe[A]]) extends Product with Serializable
- Alphabetic
- By Inheritance
- MaybeT
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def ap[B](f: ⇒ MaybeT[F, (A) ⇒ B])(implicit F: Monad[F]): MaybeT[F, B]
-
def
app[B](f: ⇒ MaybeT[F, (A) ⇒ B])(implicit F: Apply[F]): MaybeT[F, B]
Apply a function in the environment of both maybes, containing both
F
s.Apply a function in the environment of both maybes, containing both
F
s. It is not compatible withMonad#bind
. -
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- def cata[X](just: (A) ⇒ X, empty: ⇒ X)(implicit F: Functor[F]): F[X]
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def exists(f: (A) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]
- def filter(f: (A) ⇒ Boolean)(implicit F: Functor[F]): MaybeT[F, A]
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def flatMap[B](f: (A) ⇒ MaybeT[F, B])(implicit F: Monad[F]): MaybeT[F, B]
- def flatMapF[B](f: (A) ⇒ F[B])(implicit F: Monad[F]): MaybeT[F, B]
- def foldRight[Z](z: ⇒ Z)(f: (A, ⇒ Z) ⇒ Z)(implicit F: Foldable[F]): Z
- def forall(f: (A) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def getOrElse(default: ⇒ A)(implicit F: Functor[F]): F[A]
- def getOrElseF(default: ⇒ F[A])(implicit F: Monad[F]): F[A]
- def isDefined(implicit F: Functor[F]): F[Boolean]
- def isEmpty(implicit F: Functor[F]): F[Boolean]
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def isJust(implicit F: Functor[F]): F[Boolean]
- def map[B](f: (A) ⇒ B)(implicit F: Functor[F]): MaybeT[F, B]
- def mapT[G[_], B](f: (F[Maybe[A]]) ⇒ G[Maybe[B]]): MaybeT[G, B]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def orElse(a: ⇒ MaybeT[F, A])(implicit F: Monad[F]): MaybeT[F, A]
- def orZero(implicit F0: Functor[F], M0: Monoid[A]): F[A]
- val run: F[Maybe[A]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def toLeft[B](b: ⇒ B)(implicit F: Functor[F]): EitherT[F, A, B]
- def toRight[E](e: ⇒ E)(implicit F: Functor[F]): EitherT[F, E, A]
- def traverse[G[_], B](f: (A) ⇒ G[B])(implicit F: Traverse[F], G: Applicative[G]): G[MaybeT[F, B]]
- def unary_~(implicit F0: Functor[F], M0: Monoid[A]): F[A]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
def
|(default: ⇒ A)(implicit F: Functor[F]): F[A]
Alias for
getOrElse
. - def |||(a: ⇒ MaybeT[F, A])(implicit F: Monad[F]): MaybeT[F, A]