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.
- Annotations
- @FutureTransformer(transformedTypeArgumentPosition = 0)
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- CheckedT
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
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 abortFlatMap[AA, NN >: N, RR >: R](f: (A) => CheckedT[F, AA, NN, RR])(implicit F: Monad[F]): CheckedT[F, AA, NN, RR]
- def abortSubflatMap[AA, NN >: N, RR >: R](f: (A) => Checked[AA, NN, RR])(implicit F: Functor[F]): CheckedT[F, AA, NN, RR]
- def ap[AA >: A, NN >: N, RR](ff: CheckedT[F, AA, NN, (R) => RR])(implicit F: Applicative[F]): CheckedT[F, AA, NN, RR]
Applicative operation.
Applicative operation. Consistent with flatMap according to Cats' laws. Errors from the function take precedence over the function argument (=this).
- def appendNonabort[NN >: N](nonabort: NN)(implicit F: Functor[F]): CheckedT[F, A, NN, R]
- def appendNonaborts[NN >: N](nonaborts: Chain[NN])(implicit F: Functor[F]): CheckedT[F, A, NN, R]
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- 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]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @IntrinsicCandidate() @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def exists(pred: (R) => Boolean)(implicit F: Functor[F]): F[Boolean]
- def flatMap[AA >: A, NN >: N, RR](f: (R) => CheckedT[F, AA, NN, RR])(implicit F: Monad[F]): CheckedT[F, AA, NN, RR]
- 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.
- def fold[B](f: (A, Chain[N]) => B, g: (Chain[N], R) => B)(implicit F: Functor[F]): F[B]
- def forall(pred: (R) => Boolean)(implicit F: Functor[F]): F[Boolean]
- def foreach(f: (R) => Unit)(implicit F: Functor[F]): F[Unit]
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @IntrinsicCandidate() @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def map[RR](f: (R) => RR)(implicit F: Functor[F]): CheckedT[F, A, N, RR]
- def mapAbort[AA](f: (A) => AA)(implicit F: Functor[F]): CheckedT[F, AA, N, R]
- def mapK[G[_]](f: ~>[F, G]): CheckedT[G, A, N, R]
- def mapNonabort[NN](f: (N) => NN)(implicit F: Functor[F]): CheckedT[F, A, NN, R]
- def mapNonaborts[NN](f: (Chain[N]) => Chain[NN])(implicit F: Functor[F]): CheckedT[F, A, NN, R]
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @IntrinsicCandidate() @native()
- def prependNonabort[NN >: N](nonabort: NN)(implicit F: Functor[F]): CheckedT[F, A, NN, R]
- def prependNonaborts[NN >: N](nonaborts: Chain[NN])(implicit F: Functor[F]): CheckedT[F, A, NN, R]
- 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
thistake precedence overother - def productElementNames: Iterator[String]
- Definition Classes
- Product
- def semiflatMap[RR](f: (R) => F[RR])(implicit F: Monad[F]): CheckedT[F, A, N, RR]
- def subflatMap[AA >: A, NN >: N, RR](f: (R) => Checked[AA, NN, RR])(implicit F: Functor[F]): CheckedT[F, AA, NN, RR]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toEitherT(implicit F: Functor[F]): EitherT[F, A, R]
Discards nonaborts.
- def toEitherTWithNonaborts[L, A1 >: A <: L, N1 >: N <: L](implicit F: Functor[F]): EitherT[F, NonEmptyChain[L], R]
Discards results if there are nonaborts.
- def toOptionT(implicit F: Functor[F]): OptionT[F, R]
- 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
defaultresult if no result is contained. - def trimap[AA, NN, RR](abortMap: (A) => AA, nonabortMap: (N) => NN, resultMap: (R) => RR)(implicit F: Functor[F]): CheckedT[F, AA, NN, RR]
- val value: F[Checked[A, N, R]]
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- def widenAbort[AA >: A]: CheckedT[F, AA, N, R]
- Annotations
- @SuppressWarnings()
- def widenNonabort[NN >: N]: CheckedT[F, A, NN, R]
- Annotations
- @SuppressWarnings()
- def widenResult[RR >: R]: CheckedT[F, A, N, RR]
- Annotations
- @SuppressWarnings()