final case class TheseT[F[_], A, B](run: F[\&/[A, B]]) extends Product with Serializable
Instance Constructors
- new TheseT(run: F[\&/[A, B]])
Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def &&&[AA >: A, C](t: TheseT[F, AA, C])(implicit M: Semigroup[AA], F: Apply[F]): TheseT[F, AA, (B, C)]
- final def ==(arg0: Any): Boolean
- def a(implicit F: Functor[F]): OptionT[F, A]
- def append[AA >: A, BB >: B](that: => TheseT[F, AA, BB])(implicit F: Apply[F], SA: Semigroup[AA], SB: Semigroup[BB]): TheseT[F, AA, BB]
- final def asInstanceOf[T0]: T0
- def b(implicit F: Functor[F]): OptionT[F, B]
- def bimap[C, D](f: (A) => C, g: (B) => D)(implicit F: Functor[F]): TheseT[F, C, D]
- def bitraverse[G[_], C, D](f: (A) => G[C], g: (B) => G[D])(implicit F: Traverse[F], G: Applicative[G]): G[TheseT[F, C, D]]
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def exists(p: (B) => Boolean)(implicit F: Functor[F]): F[Boolean]
- def finalize(): Unit
- def flatMap[AA >: A, C](f: (B) => TheseT[F, AA, C])(implicit M: Monad[F], S: Semigroup[AA]): TheseT[F, AA, C]
- def flatMapF[AA >: A, C](f: (B) => F[\&/[AA, C]])(implicit M: Monad[F], S: Semigroup[AA]): TheseT[F, AA, C]
- def fold[X](s: (A) => X, t: (B) => X, q: (A, B) => X)(implicit F: Functor[F]): F[X]
- def foldRight[Z](z: => Z)(f: (B, => Z) => Z)(implicit F: Foldable[F]): Z
- def forall(p: (B) => Boolean)(implicit F: Functor[F]): F[Boolean]
- final def getClass(): Class[_ <: AnyRef]
- def getOrElse(default: => B)(implicit F: Functor[F]): F[B]
- def isBoth(implicit F: Functor[F]): F[Boolean]
- final def isInstanceOf[T0]: Boolean
- def isThat(implicit F: Functor[F]): F[Boolean]
- def isThis(implicit F: Functor[F]): F[Boolean]
- def leftMap[C](f: (A) => C)(implicit F: Functor[F]): TheseT[F, C, B]
- def map[C](f: (B) => C)(implicit F: Functor[F]): TheseT[F, A, C]
- def mapT[G[_], C, D](f: (F[\&/[A, B]]) => G[\&/[C, D]]): TheseT[G, C, D]
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def onlyBoth(implicit F: Functor[F]): OptionT[F, (A, B)]
- def onlyThat(implicit F: Functor[F]): OptionT[F, B]
- def onlyThis(implicit F: Functor[F]): OptionT[F, A]
- def onlyThisOrThat(implicit F: Functor[F]): OptionT[F, \/[A, B]]
- def pad(implicit F: Functor[F]): F[(Option[A], Option[B])]
- def productElementNames: Iterator[String]
- val run: F[\&/[A, B]]
- def show(implicit SA: Show[A], SB: Show[B], F: Functor[F]): F[Cord]
- def swap(implicit F: Functor[F]): TheseT[F, B, A]
- def swapped[AA, BB](k: (\&/[B, A]) => \&/[BB, AA])(implicit F: Functor[F]): TheseT[F, AA, BB]
- final def synchronized[T0](arg0: => T0): T0
- def toList(implicit F: Functor[F]): ListT[F, B]
- def traverse[G[_], AA >: A, D](g: (B) => G[D])(implicit F: Traverse[F], G: Applicative[G]): G[TheseT[F, AA, D]]
- def unary_~(implicit F: Functor[F]): TheseT[F, B, A]
- def valueOr[BB >: B](x: (A) => BB)(implicit M: Semigroup[BB], F: Functor[F]): F[BB]
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def |(default: => B)(implicit F: Functor[F]): F[B]
- def ~[AA, BB](k: (\&/[B, A]) => \&/[BB, AA])(implicit F: Functor[F]): TheseT[F, AA, BB]