TraverseOps

final
class TraverseOps[F[_], A] extends Ops[F[A]]

Wraps a value self and provides methods related to Traverse

trait Ops[F[A]]
class Object
trait Matchable
class Any

Value members

Concrete methods

final
def indexed: F[(Int, A)]
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 parTraverse[G[_], B](f: A => G[B])(implicit F: Traverse[F], G: Par[G]): G[F[B]]
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

Traverse with the identity function

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

A version of sequence where a monadic join is applied to the inner result

A version of sequence where a monadic join is applied to the inner result

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

A version of sequence that infers the nested type constructor

A version of sequence that infers the nested type constructor

final
def tmap[B](f: A => B): F[B]
final
def traverse[G[_], B](f: A => G[B])(implicit G: Applicative[G]): G[F[B]]
final
def traverseKTrampoline[G[_] : Applicative, S, B](f: A => Kleisli[G, S, B]): Kleisli[G, S, F[B]]

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

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

final
def traverseM[G[_], B](f: A => G[F[B]])(implicit G: Applicative[G], FM: Bind[F]): G[F[B]]

A version of traverse where a subsequent monadic join is applied to the inner result.

A version of traverse where a subsequent monadic join is applied to the inner result.

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

A version of traverse specialized for State

A version of traverse specialized for State

final
def traverseSTrampoline[G[_] : Applicative, S, B](f: A => State[S, G[B]]): State[S, G[F[B]]]

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

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[[F[_]] =>> Applicative[F], GB]): M[F[A]]

A version of traverse that infers the type constructor G

A version of traverse that infers the type constructor G

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]

Concrete fields

val self: F[A]

Implicits

Implicits

implicit
val F: Traverse[F]