Class

scalaz.\&/

Both

Related Doc: package \&/

Permalink

final case class Both[A, B](aa: A, bb: B) extends \&/[A, B] with Product with Serializable

Source
These.scala
Linear Supertypes
\&/[A, B], Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Both
  2. \&/
  3. Serializable
  4. Serializable
  5. Product
  6. Equals
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Both(aa: A, bb: B)

    Permalink

Value Members

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

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def &&&[AA >: A, C](t: \&/[AA, C])(implicit M: Semigroup[AA]): \&/[AA, (B, C)]

    Permalink
    Definition Classes
    \&/

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

    Permalink
    Definition Classes
    AnyRef → Any

  5. def ===[AA >: A, BB >: B](x: \&/[AA, BB])(implicit EA: Equal[AA], EB: Equal[BB]): Boolean

    Permalink
    Definition Classes
    \&/

  6. def a: Option[A]

    Permalink
    Definition Classes
    \&/

  7. val aa: A

    Permalink

  8. def append[AA >: A, BB >: B](that: ⇒ \&/[AA, BB])(implicit SA: Semigroup[AA], SB: Semigroup[BB]): \&/[AA, BB]

    Permalink
    Definition Classes
    \&/

  9. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  10. def b: Option[B]

    Permalink
    Definition Classes
    \&/

  11. val bb: B

    Permalink

  12. def bifoldMap[M](f: (A) ⇒ M)(g: (B) ⇒ M)(implicit M: Semigroup[M]): M

    Permalink
    Definition Classes
    \&/

  13. def bifoldRight[Z](z: ⇒ Z)(f: (A, ⇒ Z) ⇒ Z)(g: (B, ⇒ Z) ⇒ Z): Z

    Permalink
    Definition Classes
    \&/

  14. def bimap[C, D](f: (A) ⇒ C, g: (B) ⇒ D): \&/[C, D]

    Permalink
    Definition Classes
    \&/

  15. def bitraverse[F[_], C, D](f: (A) ⇒ F[C], g: (B) ⇒ F[D])(implicit arg0: Apply[F]): F[\&/[C, D]]

    Permalink
    Definition Classes
    \&/

  16. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef

  18. def exists(p: (B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    \&/

  19. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  20. def flatMap[AA >: A, D](g: (B) ⇒ \&/[AA, D])(implicit M: Semigroup[AA]): \&/[AA, D]

    Permalink
    Definition Classes
    \&/

  21. def fold[X](s: (A) ⇒ X, t: (B) ⇒ X, q: (A, B) ⇒ X): X

    Permalink
    Definition Classes
    \&/

  22. def foldMap[C](f: (B) ⇒ C)(implicit M: Monoid[C]): C

    Permalink
    Definition Classes
    \&/

  23. def foldRight[Z](z: ⇒ Z)(f: (B, ⇒ Z) ⇒ Z): Z

    Permalink
    Definition Classes
    \&/

  24. def forall(p: (B) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    \&/

  25. def foreach(g: (B) ⇒ Unit): Unit

    Permalink
    Definition Classes
    \&/

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

    Permalink
    Definition Classes
    AnyRef → Any

  27. def getOrElse[BB >: B](bb: ⇒ BB): BB

    Permalink
    Definition Classes
    \&/

  28. def isBoth: Boolean

    Permalink
    Definition Classes
    \&/

  29. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  30. def isThat: Boolean

    Permalink
    Definition Classes
    \&/

  31. def isThis: Boolean

    Permalink
    Definition Classes
    \&/

  32. def leftMap[C](f: (A) ⇒ C): \&/[C, B]

    Permalink
    Definition Classes
    \&/

  33. def map[D](g: (B) ⇒ D): \&/[A, D]

    Permalink
    Definition Classes
    \&/

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

    Permalink
    Definition Classes
    AnyRef

  35. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  36. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  37. def onlyBoth: Option[(A, B)]

    Permalink
    Definition Classes
    \&/

  38. def onlyThat: Option[B]

    Permalink
    Definition Classes
    \&/

  39. def onlyThis: Option[A]

    Permalink
    Definition Classes
    \&/

  40. def onlyThisOrThat: Option[\/[A, B]]

    Permalink
    Definition Classes
    \&/

  41. def pad: (Option[A], Option[B])

    Permalink
    Definition Classes
    \&/

  42. def show[AA >: A, BB >: B](implicit SA: Show[AA], SB: Show[BB]): Cord

    Permalink
    Definition Classes
    \&/

  43. def swap: \&/[B, A]

    Permalink
    Definition Classes
    \&/

  44. def swapped[AA, BB](k: (\&/[B, A]) ⇒ \&/[BB, AA]): \&/[AA, BB]

    Permalink
    Definition Classes
    \&/

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

    Permalink
    Definition Classes
    AnyRef

  46. def toList: List[B]

    Permalink
    Definition Classes
    \&/

  47. def traverse[F[_], AA >: A, D](g: (B) ⇒ F[D])(implicit arg0: Applicative[F]): F[\&/[AA, D]]

    Permalink
    Definition Classes
    \&/

  48. def unary_~: \&/[B, A]

    Permalink
    Definition Classes
    \&/

  49. def valueOr[BB >: B](x: (A) ⇒ BB)(implicit M: Semigroup[BB]): BB

    Permalink
    Definition Classes
    \&/

  50. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  53. def |[BB >: B](bb: ⇒ BB): BB

    Permalink
    Definition Classes
    \&/

  54. def ~[AA, BB](k: (\&/[B, A]) ⇒ \&/[BB, AA]): \&/[AA, BB]

    Permalink
    Definition Classes
    \&/

Inherited from \&/[A, B]

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped