ProChoice

abstract def left[A, B, C](fa: =>:[A, B]): =>:[\/[A, C], \/[B, C]]

abstract def mapfst[A, B, C](fab: =>:[A, B])(f: (C) ⇒ A): =>:[C, B]

Contramap on A.

abstract def mapsnd[A, B, C](fab: =>:[A, B])(f: (B) ⇒ C): =>:[A, C]

Functor map on B.

abstract def right[A, B, C](fa: =>:[A, B]): =>:[\/[C, A], \/[C, B]]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contravariantInstance[C]: Contravariant[[α$2$]=>:[α$2$, C]]

def covariantInstance[C]: Functor[[β$1$]=>:[C, β$1$]]

def dimap[A, B, C, D](fab: =>:[A, B])(f: (C) ⇒ A)(g: (B) ⇒ D): =>:[C, D]

Functor map on A and B.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def invariantFunctor: InvariantFunctor[[α]=>:[α, α]]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val proChoiceSyntax: ProChoiceSyntax[=>:]

def profunctorLaw: ProfunctorLaw

val profunctorSyntax: ProfunctorSyntax[=>:]

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit