Bitraverse

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

Collect Gs while applying f and g in some order.

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

final def bifoldL[A, B, C](fa: F[A, B], z: C)(f: (C) ⇒ (A) ⇒ C)(g: (C) ⇒ (B) ⇒ C): C

Curried version of bifoldLeft

def bifoldLShape[A, B, C](fa: F[A, B], z: C)(f: (C, A) ⇒ C)(g: (C, B) ⇒ C): (C, F[Unit, Unit])

def bifoldLeft[A, B, C](fa: F[A, B], z: C)(f: (C, A) ⇒ C)(g: (C, B) ⇒ C): C

bifoldRight, but defined to run in the opposite direction.

def bifoldMap[A, B, M](fa: F[A, B])(f: (A) ⇒ M)(g: (B) ⇒ M)(implicit F: Monoid[M]): M

Accumulate As and Bs in some unspecified order.

def bifoldMap1[A, B, M](fa: F[A, B])(f: (A) ⇒ M)(g: (B) ⇒ M)(implicit F: Semigroup[M]): Option[M]

final def bifoldR[A, B, C](fa: F[A, B], z: ⇒ C)(f: (A) ⇒ (⇒ C) ⇒ C)(g: (B) ⇒ (⇒ C) ⇒ C): C

Curried version of bifoldRight

def bifoldRight[A, B, C](fa: F[A, B], z: ⇒ C)(f: (A, ⇒ C) ⇒ C)(g: (B, ⇒ C) ⇒ C): C

Accumulate to C starting at the "right".

val bifoldableSyntax: BifoldableSyntax[F]

val bifunctorSyntax: BifunctorSyntax[F]

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

map over both type parameters.

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

def bitraversal[G[_]](implicit arg0: Applicative[G]): Bitraversal[G]

def bitraversalS[S]: Bitraversal[[x]IndexedStateT[[+X]X, S, S, x]]

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

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

Flipped bitraverse.

def bitraverseKTrampoline[S, G[+_], A, B, C, D](fa: F[A, B])(f: (A) ⇒ Kleisli[G, S, C])(g: (B) ⇒ Kleisli[G, S, D])(implicit arg0: Applicative[G]): Kleisli[G, S, F[C, D]]

Bitraverse fa with a Kleisli[G, S, C] and Kleisli[G, S, D], internally using a Trampoline to avoid stack overflow.

def bitraverseS[S, A, B, C, D](fa: F[A, B])(f: (A) ⇒ State[S, C])(g: (B) ⇒ State[S, D]): State[S, F[C, D]]

val bitraverseSyntax: BitraverseSyntax[F]

def clone(): AnyRef

def compose[G[_, _]](implicit G0: Bitraverse[G]): Bitraverse[[α, β]F[G[α, β], G[α, β]]]

The composition of Bitraverses F and G, [x,y]F[G[x,y],G[x,y]], is a Bitraverse

def compose[G[_, _]](implicit G0: Bifoldable[G]): Bifoldable[[α, β]F[G[α, β], G[α, β]]]

The composition of Bifoldables F and G, [x,y]F[G[x,y],G[x,y]], is a Bifoldable

def compose[G[_, _]](implicit G0: Bifunctor[G]): Bifunctor[[α, β]F[G[α, β], G[α, β]]]

The composition of Bifunctors F and G, [x,y]F[G[x,y],G[x,y]], is a Bifunctor

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 leftFoldable[X]: Foldable[[α]F[α, X]]

Extract the Foldable on the first parameter.

def leftFunctor[X]: Functor[[α]F[α, X]]

Extract the Functor on the first param.

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

def leftTraverse[X]: Traverse[[α]F[α, X]]

Extract the Traverse on the first param.

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

The product of Bitraverses F and G, [x,y](F[x,y], G[x,y]), is a Bitraverse

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

The product of Bifoldables F and G, [x,y](F[x,y], G[x,y]), is a Bifoldable

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

The product of Bifunctors F and G, [x,y](F[x,y], G[x,y]), is a Bifunctor

def rightFoldable[X]: Foldable[[α]F[X, α]]

Extract the Foldable on the second parameter.

def rightFunctor[X]: Functor[[α]F[X, α]]

Extract the Functor on the second param.

def rightMap[A, B, D](fab: F[A, B])(g: (B) ⇒ D): F[A, D]

def rightTraverse[X]: Traverse[[α]F[X, α]]

Extract the Traverse on the second param.

def runBitraverseS[S, A, B, C, D](fa: F[A, B], s: S)(f: (A) ⇒ State[S, C])(g: (B) ⇒ State[S, D]): (S, F[C, D])

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

def toString(): String

def traverseSTrampoline[S, G[_], A, B, C, D](fa: F[A, B])(f: (A) ⇒ State[S, G[C]])(g: (B) ⇒ State[S, G[D]])(implicit arg0: Applicative[G]): State[S, G[F[C, D]]]

Bitraverse fa with a State[S, G[C]] and State[S, G[D]], internally using a Trampoline to avoid stack overflow.

def umap[A, B](faa: F[A, A])(f: (A) ⇒ B): F[B, B]

final def wait(): Unit

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

final def wait(arg0: Long): Unit