MaybeT

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

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 Fs.

final def asInstanceOf[T0]: T0

def canEqual(arg0: Any): Boolean

def cata[X](just: (A) ⇒ X, empty: ⇒ X)(implicit F: Functor[F]): F[X]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

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(): java.lang.Class[_]

def getOrElse(default: ⇒ A)(implicit F: Functor[F]): F[A]

def getOrElseF(default: ⇒ F[A])(implicit F: Monad[F]): F[A]

def hashCode(): Int

def isDefined(implicit F: Functor[F]): F[Boolean]

def isEmpty(implicit F: Functor[F]): F[Boolean]

final def isInstanceOf[T0]: Boolean

def isJust(implicit F: Functor[F]): F[Boolean]

def map[B](f: (A) ⇒ B)(implicit F: Functor[F]): MaybeT[F, B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def orElse(a: ⇒ MaybeT[F, A])(implicit F: Monad[F]): MaybeT[F, A]

def orZero(implicit F0: Functor[F], M0: Monoid[A]): F[A]

def productArity: Int

def productElement(arg0: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

val run: F[Maybe[A]]

final def synchronized[T0](arg0: ⇒ T0): T0

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 toString(): String

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

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def |(default: ⇒ A)(implicit F: Functor[F]): F[A]

Alias for getOrElse.

def |||(a: ⇒ MaybeT[F, A])(implicit F: Monad[F]): MaybeT[F, A]

def productElements: Iterator[Any]