Derives

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

abstract def xcoproduct2[Z, A1, A2](a1: ⇒ F[A1], a2: ⇒ F[A2])(f: (\/[A1, A2]) ⇒ Z, g: (Z) ⇒ \/[A1, A2]): F[Z]

abstract def xcoproduct3[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]

abstract def xcoproduct4[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]

abstract def xmap[A, B](ma: 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.

abstract def xproduct0[Z](f: ⇒ Z): F[Z]

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

abstract 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]

abstract 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]

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

val coapplicativeCodivideSyntax: CoapplicativeCodivideSyntax[F]

val derivesSyntax: DerivesSyntax[F]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

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

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

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

def xcoderiving2[Z, A1, A2](f: (\/[A1, A2]) ⇒ Z, g: (Z) ⇒ \/[A1, A2])(implicit a1: F[A1], a2: F[A2]): F[Z]

def xcoderiving3[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]

def xcoderiving4[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]

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 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 xproduct1[Z, A1](a1: F[A1])(f: (A1) ⇒ Z, g: (Z) ⇒ A1): F[Z]