TraverseOps

implicit abstract def F: Traverse[F]

abstract def self: F[A]

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

def clone(): AnyRef

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 mapAccumL[S, B](z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])

final def mapAccumR[S, B](z: S)(f: (S, A) ⇒ (S, B)): (S, F[B])

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def reverse: F[A]

final def runTraverseS[S, B](s: S)(f: (A) ⇒ State[S, B]): (S, F[B])

final def sequence[G[_], B](implicit ev: ===[A, G[B]], G: Applicative[G]): G[F[B]]

Traverse with the identity function

final def sequenceU(implicit G: Unapply[Applicative, A]): M[F[A]]

A version of sequence that infers the nested type constructor

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

final def tmap[B](f: (A) ⇒ B): F[B]

def toString(): String

final def traverse[G[_], B](f: (A) ⇒ G[B])(implicit G: Applicative[G]): G[F[B]]

final def traverseKTrampoline[G[+_], S, B](f: (A) ⇒ Kleisli[G, S, B])(implicit arg0: Applicative[G]): Kleisli[G, S, F[B]]

A version of traverse specialized for Kleisli[G, S, B] that internally uses a Trampoline to avoid stack-overflow.

final def traverseS[S, B](f: (A) ⇒ State[S, B]): State[S, F[B]]

A version of traverse specialized for State

final def traverseSTrampoline[G[+_], S, B](f: (A) ⇒ State[S, G[B]])(implicit arg0: Applicative[G]): State[S, G[F[B]]]

A version of traverse specialized for State[S, G[B]] that internally uses a Trampoline to avoid stack-overflow.

final def traverseU[GB](f: (A) ⇒ GB)(implicit G: Unapply[Applicative, GB]): M[F[A]]

A version of traverse that infers the type constructor G

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def zipL[B](fb: F[B]): F[(A, Option[B])]

final def zipR[B](fb: F[B]): F[(Option[A], B)]

final def zipWith[B, C](fb: F[B])(f: (A, Option[B]) ⇒ C): (List[B], F[C])

final def zipWithL[B, C](fb: F[B])(f: (A, Option[B]) ⇒ C): F[C]

final def zipWithR[B, C](fb: F[B])(f: (Option[A], B) ⇒ C): F[C]