Value Members

1.  final def !=(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

2.  final def ##: Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  implicit val F: Traverse[F]
5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.CloneNotSupportedException]) @native()

7.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

8.  def equals(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef → Any

9.  def finalize(): Unit

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws(classOf[java.lang.Throwable])

10.  final def getClass(): Class[_ <: AnyRef]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

11.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  final def indexed: F[(Int, A)]
13.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

14.  final def mapAccumL[S, B](z: S)(f: (S, A) => (S, B)): (S, F[B])
15.  final def mapAccumR[S, B](z: S)(f: (S, A) => (S, B)): (S, F[B])
16.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

17.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

18.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

19.  final def parTraverse[G[_], B](f: (A) => G[B])(implicit F: Traverse[F], G: Par[G]): G[F[B]]
20.  final def reverse: F[A]
21.  final def runTraverseS[S, B](s: S)(f: (A) => State[S, B]): (S, F[B])
22.  val self: F[A]

    Definition Classes

    TraverseOps → Ops

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

    Traverse with the identity function

24.  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

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

    A version of sequence that infers the nested type constructor

26.  final def synchronized[T0](arg0: => T0): T0

    Definition Classes

    AnyRef

27.  final def tmap[B](f: (A) => B): F[B]
28.  def toString(): String

    Definition Classes

    AnyRef → Any

29.  final def traverse[G[_], B](f: (A) => G[B])(implicit G: Applicative[G]): G[F[B]]
30.  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.

31.  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.

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

    A version of traverse specialized for State

33.  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.

34.  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

35.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

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

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException])

37.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws(classOf[java.lang.InterruptedException]) @native()

38.  final def zipL[B](fb: F[B]): F[(A, Option[B])]
39.  final def zipR[B](fb: F[B]): F[(Option[A], B)]
40.  final def zipWith[B, C](fb: F[B])(f: (A, Option[B]) => C): (List[B], F[C])
41.  final def zipWithL[B, C](fb: F[B])(f: (A, Option[B]) => C): F[C]
42.  final def zipWithR[B, C](fb: F[B])(f: (Option[A], B) => C): F[C]