Divisible

abstract def conquer[A]: F[A]

Universally quantified instance of F[_]

abstract def divide2[A1, A2, Z](a1: ⇒ F[A1], a2: ⇒ F[A2])(f: (Z) ⇒ (A1, A2)): F[Z]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val applicativeDivisibleSyntax: ApplicativeDivisibleSyntax[F]

val applyDivideSyntax: ApplyDivideSyntax[F]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[G[_]](implicit G0: Contravariant[G]): Functor[[α]F[G[α]]]

The composition of Contravariant F and G, [x]F[G[x]], is covariant.

def contramap[A, B](fa: F[A])(f: (B) ⇒ A): F[B]

Transform A.

def contravariantLaw: ContravariantLaw

val contravariantSyntax: ContravariantSyntax[F]

final def divide[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (C) ⇒ (A, B)): F[C]

final def divide1[A1, Z](a1: F[A1])(f: (Z) ⇒ A1): F[Z]

def divide3[A1, A2, A3, Z](a1: ⇒ F[A1], a2: ⇒ F[A2], a3: ⇒ F[A3])(f: (Z) ⇒ (A1, A2, A3)): F[Z]

def divide4[A1, A2, A3, A4, Z](a1: ⇒ F[A1], a2: ⇒ F[A2], a3: ⇒ F[A3], a4: ⇒ F[A4])(f: (Z) ⇒ (A1, A2, A3, A4)): F[Z]

def divideLaw: DivideLaw

val divideSyntax: DivideSyntax[F]

final def dividing1[A1, Z](f: (Z) ⇒ A1)(implicit a1: F[A1]): F[Z]

final def dividing2[A1, A2, Z](f: (Z) ⇒ (A1, A2))(implicit a1: F[A1], a2: F[A2]): F[Z]

final def dividing3[A1, A2, A3, Z](f: (Z) ⇒ (A1, A2, A3))(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]

final def dividing4[A1, A2, A3, A4, Z](f: (Z) ⇒ (A1, A2, A3, A4))(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]

def divisibleLaw: DivisibleLaw

val divisibleSyntax: DivisibleSyntax[F]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def icompose[G[_]](implicit G0: Functor[G]): Contravariant[[α]F[G[α]]]

The composition of Contravariant F and Functor G, [x]F[G[x]], is contravariant.

def invariantFunctorLaw: InvariantFunctorLaw

val invariantFunctorSyntax: InvariantFunctorSyntax[F]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def product[G[_]](implicit G0: Contravariant[G]): Contravariant[[α](F[α], G[α])]

The product of Contravariant F and G, [x](F[x], G[x]]), is contravariant.

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

def toString(): String

def tuple2[A1, A2](a1: ⇒ F[A1], a2: ⇒ F[A2]): F[(A1, A2)]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def xderiving0[Z](z: Z): F[Z]

final def xderiving1[Z, A1](f: (A1) ⇒ Z, g: (Z) ⇒ A1)(implicit a1: F[A1]): F[Z]

final def xderiving2[Z, A1, A2](f: (A1, A2) ⇒ Z, g: (Z) ⇒ (A1, A2))(implicit a1: F[A1], a2: F[A2]): F[Z]

final def xderiving3[Z, A1, A2, A3](f: (A1, A2, A3) ⇒ Z, g: (Z) ⇒ (A1, A2, A3))(implicit a1: F[A1], a2: F[A2], a3: F[A3]): F[Z]

final def xderiving4[Z, A1, A2, A3, A4](f: (A1, A2, A3, A4) ⇒ Z, g: (Z) ⇒ (A1, A2, A3, A4))(implicit a1: F[A1], a2: F[A2], a3: F[A3], a4: F[A4]): F[Z]

def xmap[A, B](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ A): F[B]

Converts ma to a value of type F[B] using the provided functions f and g.

def xmapb[A, B](ma: F[A])(b: Bijection[A, B]): F[B]

Converts ma to a value of type F[B] using the provided bijection.

def xmapi[A, B](ma: F[A])(iso: Isomorphism.<=>[A, B]): F[B]

Converts ma to a value of type F[B] using the provided isomorphism.

def xproduct0[Z](z: ⇒ Z): F[Z]

def xproduct1[Z, A1](a1: F[A1])(f: (A1) ⇒ Z, g: (Z) ⇒ A1): F[Z]

def xproduct2[Z, A1, A2](a1: ⇒ F[A1], a2: ⇒ F[A2])(f: (A1, A2) ⇒ Z, g: (Z) ⇒ (A1, A2)): F[Z]

def xproduct3[Z, A1, A2, A3](a1: ⇒ F[A1], a2: ⇒ F[A2], a3: ⇒ F[A3])(f: (A1, A2, A3) ⇒ Z, g: (Z) ⇒ (A1, A2, A3)): F[Z]

def xproduct4[Z, A1, A2, A3, A4](a1: ⇒ F[A1], a2: ⇒ F[A2], a3: ⇒ F[A3], a4: ⇒ F[A4])(f: (A1, A2, A3, A4) ⇒ Z, g: (Z) ⇒ (A1, A2, A3, A4)): F[Z]