Zip

abstract def zip[A, B](a: ⇒ F[A], b: ⇒ F[B]): F[(A, B)]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def ap(implicit F: Functor[F]): Apply[F]

def apzip[A, B](f: ⇒ (F[A]) ⇒ F[B], a: ⇒ F[A]): F[(A, B)]

def apzipPL[A, B](f: ⇒ @?>[F[A], F[B]], a: ⇒ F[A])(implicit M: Monoid[F[B]]): F[(A, B)]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def compose[G[_]](implicit T0: Functor[F], G0: Zip[G]): Zip[[α]F[G[α]]]

The composition of Zip F and G, [x]F[G[x]], is a Zip (if F is a Functor)

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

The product of Zips F and G, [x](F[x], G[x]]), is a Zip

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 zipLaw: ZipLaw

val zipSyntax: ZipSyntax[F]

def zipWith[A, B, C](fa: ⇒ F[A], fb: ⇒ F[B])(f: (A, B) ⇒ C)(implicit F: Functor[F]): F[C]