IsomorphismChoice

implicit abstract def G: Choice[G]

abstract def iso: Isomorphism.<~~>[F, G]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def categoryLaw: CategoryLaw

val categorySyntax: CategorySyntax[F]

def choice[A, B, C](f: ⇒ F[A, C], g: ⇒ F[B, C]): F[\/[A, B], C]

val choiceSyntax: ChoiceSyntax[F]

def clone(): AnyRef

def codiagonal[A]: F[\/[A, A], A]

def compose[A, B, C](f: F[B, C], g: F[A, B]): F[A, C]

Associative =>: binary operator.

def composeLaw: ComposeLaw

val composeSyntax: ComposeSyntax[F]

def empty: PlusEmpty[[α]F[α, α]]

monoid, but universally quantified.

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def id[A]: F[A, A]

The left and right identity over compose.

final def isInstanceOf[T0]: Boolean

def monoid[A]: Monoid[F[A, A]]

The endomorphism monoid, where zero=id and append=compose.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def plus: Plus[[α]F[α, α]]

semigroup, but universally quantified.

def semigroup[A]: Semigroup[F[A, A]]

The endomorphism semigroup, where append=compose.

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