Coproduct

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def cobind[B](f: (Coproduct[F, G, A]) ⇒ B)(implicit F: Cobind[F], G: Cobind[G]): Coproduct[F, G, B]

def contramap[B](f: (B) ⇒ A)(implicit F: Contravariant[F], G: Contravariant[G]): Coproduct[F, G, B]

def copoint(implicit F: Comonad[F], G: Comonad[G]): A

def duplicate(implicit F: Cobind[F], G: Cobind[G]): Coproduct[F, G, Coproduct[F, G, A]]

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

def foldMap[B](f: (A) ⇒ B)(implicit F: Foldable[F], G: Foldable[G], M: Monoid[B]): B

def foldRight[Z](z: ⇒ Z)(f: (A, ⇒ Z) ⇒ Z)(implicit F: Foldable[F], G: Foldable[G]): Z

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

def isLeft: Boolean

def isRight: Boolean

def map[B](f: (A) ⇒ B)(implicit F: Functor[F], G: Functor[G]): Coproduct[F, G, B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val run: \/[F[A], G[A]]

The underlying scalaz.\/.

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

def traverse[X[_], B](g: (A) ⇒ X[B])(implicit F: Traverse[F], G: Traverse[G], A: Applicative[X]): X[Coproduct[F, G, B]]

def unary_~: Coproduct[G, F, A]

def validation: Validation[F[A], G[A]]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def foreach(f: (A) ⇒ Unit)(implicit F: Each[F], G: Each[G]): Unit