CompositeBitraverse

abstract def F: Bitraverse[F]

abstract def G: Bitraverse[G]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def bifoldLeft[A, B, C](fab: F[G[A, B], G[A, B]], c: C)(f: (C, A) ⇒ C, g: (C, B) ⇒ C): C

Collapse the structure with a left-associative function

def bifoldMap[A, B, C](fab: F[G[A, B], G[A, B]])(f: (A) ⇒ C, g: (B) ⇒ C)(implicit C: Monoid[C]): C

Collapse the structure by mapping each element to an element of a type that has a cats.Monoid

def bifoldRight[A, B, C](fab: F[G[A, B], G[A, B]], c: Eval[C])(f: (A, Eval[C]) ⇒ Eval[C], g: (B, Eval[C]) ⇒ Eval[C]): Eval[C]

Collapse the structure with a right-associative function

def bimap[A, B, C, D](fab: F[G[A, B], G[A, B]])(f: (A) ⇒ C, g: (B) ⇒ D): F[G[C, D], G[C, D]]

The quintessential method of the Bifunctor trait, it applies a function to each "side" of the bifunctor.

def bisequence[G[_], A, B](fab: F[G[G[A], G[B]], G[G[A], G[B]]])(implicit arg0: Applicative[G]): G[F[G[A, B], G[A, B]]]

Sequence each side of the structure with the given functions

def bitraverse[H[_], A, B, C, D](fab: F[G[A, B], G[A, B]])(f: (A) ⇒ H[C], g: (B) ⇒ H[D])(implicit arg0: Applicative[H]): H[F[G[C, D], G[C, D]]]

Traverse each side of the structure with the given functions

def clone(): AnyRef

def compose[G[_, _]](implicit ev: Bitraverse[G]): Bitraverse[[A, B]F[G[G[A, B], G[A, B]], G[G[A, B], G[A, B]]]]

If F and G are both cats.Bitraverse then so is their composition F[G[_, _], G[_, _]]

def compose[G[_, _]](implicit ev: Bifoldable[G]): Bifoldable[[A, B]F[G[G[A, B], G[A, B]], G[G[A, B], G[A, B]]]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def leftMap[A, B, C](fab: F[G[A, B], G[A, B]])(f: (A) ⇒ C): F[G[C, B], G[C, B]]

apply a function to the "left" functor

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def rightMap[A, B, C](fab: F[G[A, B], G[A, B]])(f: (B) ⇒ C): F[G[A, C], G[A, C]]

apply a function ro the "right" functor

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