TheseT

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. def &&&[AA >: A, C](t: TheseT[F, AA, C])(implicit M: Semigroup[AA], F: Apply[F]): TheseT[F, AA, (B, C)]

   

4. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

5. def a(implicit F: Functor[F]): OptionT[F, A]

   

6. 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]

   

7. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

8. def b(implicit F: Functor[F]): OptionT[F, B]

   

9. def bimap[C, D](f: (A) ⇒ C, g: (B) ⇒ D)(implicit F: Functor[F]): TheseT[F, C, D]

   

10. 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]]

    

11. def clone(): AnyRef

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

12. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

13. def exists(p: (B) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]

    

14. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

15. def flatMap[AA >: A, C](f: (B) ⇒ TheseT[F, AA, C])(implicit M: Monad[F], S: Semigroup[AA]): TheseT[F, AA, C]

    

16. def flatMapF[AA >: A, C](f: (B) ⇒ F[\&/[AA, C]])(implicit M: Monad[F], S: Semigroup[AA]): TheseT[F, AA, C]

    

17. def fold[X](s: (A) ⇒ X, t: (B) ⇒ X, q: (A, B) ⇒ X)(implicit F: Functor[F]): F[X]

    

18. def foldRight[Z](z: ⇒ Z)(f: (B, ⇒ Z) ⇒ Z)(implicit F: Foldable[F]): Z

    

19. def forall(p: (B) ⇒ Boolean)(implicit F: Functor[F]): F[Boolean]

    

20. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

21. def getOrElse(default: ⇒ B)(implicit F: Functor[F]): F[B]

    

22. def isBoth(implicit F: Functor[F]): F[Boolean]

    

23. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

24. def isThat(implicit F: Functor[F]): F[Boolean]

    

25. def isThis(implicit F: Functor[F]): F[Boolean]

    

26. def leftMap[C](f: (A) ⇒ C)(implicit F: Functor[F]): TheseT[F, C, B]

    

27. def map[C](f: (B) ⇒ C)(implicit F: Functor[F]): TheseT[F, A, C]

    

28. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

29. final def notify(): Unit

    

    Definition Classes

    AnyRef

30. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

31. def onlyBoth(implicit F: Functor[F]): OptionT[F, (A, B)]

    

32. def onlyThat(implicit F: Functor[F]): OptionT[F, B]

    

33. def onlyThis(implicit F: Functor[F]): OptionT[F, A]

    

34. def onlyThisOrThat(implicit F: Functor[F]): OptionT[F, \/[A, B]]

    

35. def pad(implicit F: Functor[F]): F[(Option[A], Option[B])]

    

36. val run: F[\&/[A, B]]

    

37. def show(implicit SA: Show[A], SB: Show[B], F: Functor[F]): F[Cord]

    

38. def swap(implicit F: Functor[F]): TheseT[F, B, A]

    

39. def swapped[AA, BB](k: (\&/[B, A]) ⇒ \&/[BB, AA])(implicit F: Functor[F]): TheseT[F, AA, BB]

    

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

    

    Definition Classes

    AnyRef

41. def toList(implicit F: Functor[F]): ListT[F, B]

    

42. def traverse[G[_], AA >: A, D](g: (B) ⇒ G[D])(implicit F: Traverse[F], G: Applicative[G]): G[TheseT[F, AA, D]]

    

43. def unary_~(implicit F: Functor[F]): TheseT[F, B, A]

    

44. def valueOr[BB >: B](x: (A) ⇒ BB)(implicit M: Semigroup[BB], F: Functor[F]): F[BB]

    

45. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

47. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

48. def |(default: ⇒ B)(implicit F: Functor[F]): F[B]

    

49. def ~[AA, BB](k: (\&/[B, A]) ⇒ \&/[BB, AA])(implicit F: Functor[F]): TheseT[F, AA, BB]