Packages

final case class MaybeT[F[_], A](run: F[Maybe[A]]) extends Product with Serializable

monad transformer for Maybe

Self Type
MaybeT[F, A]
Source
MaybeT.scala
Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. MaybeT
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new MaybeT(run: F[Maybe[A]])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def ap[B](f: ⇒ MaybeT[F, (A) ⇒ B])(implicit F: Monad[F]): MaybeT[F, B]
  5. 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.

    Apply a function in the environment of both maybes, containing both Fs. It is not compatible with Monad#bind.

  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def cata[X](just: (A) ⇒ X, empty: ⇒ X)(implicit F: Functor[F]): F[X]
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def exists(f: (A) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]
  11. def filter(f: (A) ⇒ Boolean)(implicit F: Functor[F]): MaybeT[F, A]
  12. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def flatMap[B](f: (A) ⇒ MaybeT[F, B])(implicit F: Monad[F]): MaybeT[F, B]
  14. def flatMapF[B](f: (A) ⇒ F[B])(implicit F: Monad[F]): MaybeT[F, B]
  15. def foldRight[Z](z: ⇒ Z)(f: (A, ⇒ Z) ⇒ Z)(implicit F: Foldable[F]): Z
  16. def forall(f: (A) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]
  17. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  18. def getOrElse(default: ⇒ A)(implicit F: Functor[F]): F[A]
  19. def getOrElseF(default: ⇒ F[A])(implicit F: Monad[F]): F[A]
  20. def isDefined(implicit F: Functor[F]): F[Boolean]
  21. def isEmpty(implicit F: Functor[F]): F[Boolean]
  22. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  23. def isJust(implicit F: Functor[F]): F[Boolean]
  24. def map[B](f: (A) ⇒ B)(implicit F: Functor[F]): MaybeT[F, B]
  25. def mapT[G[_], B](f: (F[Maybe[A]]) ⇒ G[Maybe[B]]): MaybeT[G, B]
  26. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  27. final def notify(): Unit
    Definition Classes
    AnyRef
  28. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  29. def orElse(a: ⇒ MaybeT[F, A])(implicit F: Monad[F]): MaybeT[F, A]
  30. def orZero(implicit F0: Functor[F], M0: Monoid[A]): F[A]
  31. val run: F[Maybe[A]]
  32. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  33. def toLeft[B](b: ⇒ B)(implicit F: Functor[F]): EitherT[F, A, B]
  34. def toRight[E](e: ⇒ E)(implicit F: Functor[F]): EitherT[F, E, A]
  35. def traverse[G[_], B](f: (A) ⇒ G[B])(implicit F: Traverse[F], G: Applicative[G]): G[MaybeT[F, B]]
  36. def unary_~(implicit F0: Functor[F], M0: Monoid[A]): F[A]
  37. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. def |(default: ⇒ A)(implicit F: Functor[F]): F[A]

    Alias for getOrElse.

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped