final case class CheckedT[F[_], A, N, R](value: F[Checked[A, N, R]]) extends Product with Serializable

Monad Transformer for Checked, allowing the effect of a monad F to be combined with the aborting and non-aborting failure effect of Checked. Similar to cats.data.EitherT.

Linear Supertypes
Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CheckedT
  2. Serializable
  3. Product
  4. Equals
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new CheckedT(value: F[Checked[A, N, R]])

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 abortFlatMap[AA, NN >: N, RR >: R](f: (A) => CheckedT[F, AA, NN, RR])(implicit F: Monad[F]): CheckedT[F, AA, NN, RR]
  5. def abortSubflatMap[AA, NN >: N, RR >: R](f: (A) => Checked[AA, NN, RR])(implicit F: Functor[F]): CheckedT[F, AA, NN, RR]
  6. def appendNonabort[NN >: N](nonabort: NN)(implicit F: Functor[F]): CheckedT[F, A, NN, R]
  7. def appendNonaborts[NN >: N](nonaborts: Chain[NN])(implicit F: Functor[F]): CheckedT[F, A, NN, R]
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def biflatMap[AA, NN >: N, RR](f: (A) => CheckedT[F, AA, NN, RR], g: (R) => CheckedT[F, AA, NN, RR])(implicit F: FlatMap[F]): CheckedT[F, AA, NN, RR]
  10. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def exists(pred: (R) => Boolean)(implicit F: Functor[F]): F[Boolean]
  13. def flatMap[AA >: A, NN >: N, RR](f: (R) => CheckedT[F, AA, NN, RR])(implicit F: Monad[F]): CheckedT[F, AA, NN, RR]
  14. def flatMapIfSuccess[RR >: R, AA >: A, NN >: N](f: (R) => CheckedT[F, AA, NN, RR])(implicit F: Monad[F]): CheckedT[F, AA, NN, RR]

    Flatmap if the Checked is successful, otherwise return the current result value.

  15. def fold[B](f: (A, Chain[N]) => B, g: (Chain[N], R) => B)(implicit F: Functor[F]): F[B]
  16. def forall(pred: (R) => Boolean)(implicit F: Functor[F]): F[Boolean]
  17. def foreach(f: (R) => Unit)(implicit F: Functor[F]): F[Unit]
  18. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  19. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  20. def map[RR](f: (R) => RR)(implicit F: Functor[F]): CheckedT[F, A, N, RR]
  21. def mapAbort[AA](f: (A) => AA)(implicit F: Functor[F]): CheckedT[F, AA, N, R]
  22. def mapNonabort[NN](f: (N) => NN)(implicit F: Functor[F]): CheckedT[F, A, NN, R]
  23. def mapNonaborts[NN](f: (Chain[N]) => Chain[NN])(implicit F: Functor[F]): CheckedT[F, A, NN, R]
  24. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  26. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  27. def prependNonabort[NN >: N](nonabort: NN)(implicit F: Functor[F]): CheckedT[F, A, NN, R]
  28. def prependNonaborts[NN >: N](nonaborts: Chain[NN])(implicit F: Functor[F]): CheckedT[F, A, NN, R]
  29. def product[AA >: A, NN >: N, RR](other: CheckedT[F, AA, NN, RR])(implicit F: Applicative[F]): CheckedT[F, AA, NN, (R, RR)]

    Applicative product operation.

    Applicative product operation. Errors from this take precedence over other

  30. def productElementNames: Iterator[String]
    Definition Classes
    Product
  31. def semiflatMap[RR](f: (R) => F[RR])(implicit F: Monad[F]): CheckedT[F, A, N, RR]
  32. def subflatMap[AA >: A, NN >: N, RR](f: (R) => Checked[AA, NN, RR])(implicit F: Functor[F]): CheckedT[F, AA, NN, RR]
  33. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  34. def toEitherT(implicit F: Functor[F]): EitherT[F, A, R]

    Discards nonaborts.

  35. def toEitherTWithNonaborts[L, A1 >: A <: L, N1 >: N <: L](implicit F: Functor[F]): EitherT[F, NonEmptyChain[L], R]

    Discards results if there are nonaborts.

  36. def toOptionT(implicit F: Functor[F]): OptionT[F, R]
  37. def toResult[NN, A1 >: A <: NN, N1 >: N <: NN](default: => R)(implicit F: Functor[F]): CheckedT[F, Nothing, NN, R]

    Merges aborts with nonaborts, using the given default result if no result is contained.

  38. def trimap[AA, NN, RR](abortMap: (A) => AA, nonabortMap: (N) => NN, resultMap: (R) => RR)(implicit F: Functor[F]): CheckedT[F, AA, NN, RR]
  39. val value: F[Checked[A, N, R]]
  40. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  41. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  42. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  43. def widenAbort[AA >: A]: CheckedT[F, AA, N, R]
    Annotations
    @SuppressWarnings()
  44. def widenNonabort[NN >: N]: CheckedT[F, A, NN, R]
    Annotations
    @SuppressWarnings()
  45. def widenResult[RR >: R]: CheckedT[F, A, N, RR]
    Annotations
    @SuppressWarnings()

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped