sealed abstract class \&/[A, B] extends Product with Serializable
Abstract Value Members
- abstract def canEqual(that: Any): Boolean
- abstract def productArity: Int
- abstract def productElement(n: Int): Any
Concrete Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- def &&&[C](t: \&/[A, C])(implicit M: Semigroup[A]): \&/[A, (B, C)]
- final def ==(arg0: Any): Boolean
- def ===[AA >: A, BB >: B](x: \&/[AA, BB])(implicit EA: Equal[AA], EB: Equal[BB]): Boolean
- def a: Option[A]
- def append[AA >: A, BB >: B](that: ⇒ \&/[AA, BB])(implicit SA: Semigroup[AA], SB: Semigroup[BB]): \&/[AA, BB]
- final def asInstanceOf[T0]: T0
- def b: Option[B]
- def bifoldMap[M](f: (A) ⇒ M)(g: (B) ⇒ M)(implicit M: Semigroup[M]): M
- def bifoldRight[Z](z: ⇒ Z)(f: (A, ⇒ Z) ⇒ Z)(g: (B, ⇒ Z) ⇒ Z): Z
- def bimap[C, D](f: (A) ⇒ C, g: (B) ⇒ D): \&/[C, D]
- def bitraverse[F[_], C, D](f: (A) ⇒ F[C], g: (B) ⇒ F[D])(implicit arg0: Apply[F]): F[\&/[C, D]]
- def clone(): AnyRef
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: Any): Boolean
- def exists(p: (B) ⇒ Boolean): Boolean
- def finalize(): Unit
- def flatMap[D](g: (B) ⇒ \&/[A, D])(implicit M: Semigroup[A]): \&/[A, D]
- def fold[X](s: (A) ⇒ X, t: (B) ⇒ X, q: (A, B) ⇒ X): X
- def foldMap[C](f: (B) ⇒ C)(implicit M: Monoid[C]): C
- def foldRight[Z](z: ⇒ Z)(f: (B, ⇒ Z) ⇒ Z): Z
- def forall(p: (B) ⇒ Boolean): Boolean
- def foreach(g: (B) ⇒ Unit): Unit
- final def getClass(): Class[_]
- def getOrElse[BB >: B](bb: ⇒ BB): BB
- def hashCode(): Int
- def isBoth: Boolean
- final def isInstanceOf[T0]: Boolean
- def isThat: Boolean
- def isThis: Boolean
- def leftMap[C](f: (A) ⇒ C): \&/[C, B]
- def map[D](g: (B) ⇒ D): \&/[A, D]
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def onlyBoth: Option[(A, B)]
- def onlyThat: Option[B]
- def onlyThis: Option[A]
- def onlyThisOrThat: Option[\/[A, B]]
- def pad: (Option[A], Option[B])
- def productIterator: Iterator[Any]
- def productPrefix: String
- def swap: \&/[B, A]
- def swapped[AA, BB](k: (\&/[B, A]) ⇒ \&/[BB, AA]): \&/[AA, BB]
- final def synchronized[T0](arg0: ⇒ T0): T0
- def toIList[BB >: B]: IList[BB]
- def toList: List[B]
- def toString(): String
- def traverse[F[_], D](g: (B) ⇒ F[D])(implicit arg0: Applicative[F]): F[\&/[A, D]]
- def unary_~: \&/[B, A]
- def valueOr[BB >: B](x: (A) ⇒ BB)(implicit M: Semigroup[BB]): BB
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def |[BB >: B](bb: ⇒ BB): BB
- def ~[AA, BB](k: (\&/[B, A]) ⇒ \&/[BB, AA]): \&/[AA, BB]