MonadTell

abstract def bind[A, B](fa: F[W, A])(f: (A) ⇒ F[W, B]): F[W, B]

Equivalent to join(map(fa)(f)).

abstract def point[A](a: ⇒ A): F[W, A]

abstract def writer[A](w: W, v: A): F[W, A]

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[A, B](fa: ⇒ F[W, A])(f: ⇒ F[W, (A) ⇒ B]): F[W, B]

def ap2[A, B, C](fa: ⇒ F[W, A], fb: ⇒ F[W, B])(f: F[W, (A, B) ⇒ C]): F[W, C]

def ap3[A, B, C, D](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C])(f: F[W, (A, B, C) ⇒ D]): F[W, D]

def ap4[A, B, C, D, E](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D])(f: F[W, (A, B, C, D) ⇒ E]): F[W, E]

def ap5[A, B, C, D, E, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E])(f: F[W, (A, B, C, D, E) ⇒ R]): F[W, R]

def ap6[A, B, C, D, E, FF, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF])(f: F[W, (A, B, C, D, E, FF) ⇒ R]): F[W, R]

def ap7[A, B, C, D, E, FF, G, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF], fg: ⇒ F[W, G])(f: F[W, (A, B, C, D, E, FF, G) ⇒ R]): F[W, R]

def ap8[A, B, C, D, E, FF, G, H, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF], fg: ⇒ F[W, G], fh: ⇒ F[W, H])(f: F[W, (A, B, C, D, E, FF, G, H) ⇒ R]): F[W, R]

def apF[A, B](f: ⇒ F[W, (A) ⇒ B]): (F[W, A]) ⇒ F[W, B]

Flipped variant of ap.

def applicativeLaw: ApplicativeLaw

val applicativeSyntax: ApplicativeSyntax[[α]F[W, α]]

def apply[A, B](fa: F[W, A])(f: (A) ⇒ B): F[W, B]

Alias for map.

def apply10[A, B, C, D, E, FF, G, H, I, J, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF], fg: ⇒ F[W, G], fh: ⇒ F[W, H], fi: ⇒ F[W, I], fj: ⇒ F[W, J])(f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): F[W, R]

def apply11[A, B, C, D, E, FF, G, H, I, J, K, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF], fg: ⇒ F[W, G], fh: ⇒ F[W, H], fi: ⇒ F[W, I], fj: ⇒ F[W, J], fk: ⇒ F[W, K])(f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): F[W, R]

def apply12[A, B, C, D, E, FF, G, H, I, J, K, L, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF], fg: ⇒ F[W, G], fh: ⇒ F[W, H], fi: ⇒ F[W, I], fj: ⇒ F[W, J], fk: ⇒ F[W, K], fl: ⇒ F[W, L])(f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): F[W, R]

def apply2[A, B, C](fa: ⇒ F[W, A], fb: ⇒ F[W, B])(f: (A, B) ⇒ C): F[W, C]

def apply3[A, B, C, D](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C])(f: (A, B, C) ⇒ D): F[W, D]

def apply4[A, B, C, D, E](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D])(f: (A, B, C, D) ⇒ E): F[W, E]

def apply5[A, B, C, D, E, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E])(f: (A, B, C, D, E) ⇒ R): F[W, R]

def apply6[A, B, C, D, E, FF, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF])(f: (A, B, C, D, E, FF) ⇒ R): F[W, R]

def apply7[A, B, C, D, E, FF, G, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF], fg: ⇒ F[W, G])(f: (A, B, C, D, E, FF, G) ⇒ R): F[W, R]

def apply8[A, B, C, D, E, FF, G, H, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF], fg: ⇒ F[W, G], fh: ⇒ F[W, H])(f: (A, B, C, D, E, FF, G, H) ⇒ R): F[W, R]

def apply9[A, B, C, D, E, FF, G, H, I, R](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E], ff: ⇒ F[W, FF], fg: ⇒ F[W, G], fh: ⇒ F[W, H], fi: ⇒ F[W, I])(f: (A, B, C, D, E, FF, G, H, I) ⇒ R): F[W, R]

def applyApplicative: Applicative[[α]\/[F[W, α], α]]

Add a unit to any Apply to form an Applicative.

def applyLaw: ApplyLaw

val applySyntax: ApplySyntax[[α]F[W, α]]

final def asInstanceOf[T0]: T0

def bicompose[G[_, _]](implicit arg0: Bifunctor[G]): Bifunctor[[α, β]F[W, G[α, β]]]

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

def bindLaw: BindLaw

val bindSyntax: BindSyntax[[α]F[W, α]]

def clone(): AnyRef

def compose[G[_]](implicit G0: Applicative[G]): Applicative[[α]F[W, G[α]]]

The composition of Applicatives F and G, [x]F[G[x]], is an Applicative

def compose[G[_]](implicit G0: Apply[G]): Apply[[α]F[W, G[α]]]

The composition of Applys F and G, [x]F[G[x]], is a Apply

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

The composition of Functors F and G, [x]F[G[x]], is a Functor

def counzip[A, B](a: \/[F[W, A], F[W, B]]): F[W, \/[A, B]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def filterM[A](l: List[A])(f: (A) ⇒ F[W, Boolean]): F[W, List[A]]

Filter l according to an applicative predicate.

def finalize(): Unit

def flip: Applicative[[α]F[W, α]]

An Applicative for F in which effects happen in the opposite order.

def forever[A, B](fa: F[W, A]): F[W, B]

Repeats a monadic action infinitely

def fpair[A](fa: F[W, A]): F[W, (A, A)]

Twin all As in fa.

def fproduct[A, B](fa: F[W, A])(f: (A) ⇒ B): F[W, (A, B)]

Pair all As in fa with the result of function application.

def functorLaw: FunctorLaw

val functorSyntax: FunctorSyntax[[α]F[W, α]]

final def getClass(): Class[_]

def hashCode(): Int

def icompose[G[_]](implicit G0: Contravariant[G]): Contravariant[[α]F[W, G[α]]]

The composition of Functor F and Contravariant G, [x]F[G[x]], is contravariant.

def ifM[B](value: F[W, Boolean], ifTrue: ⇒ F[W, B], ifFalse: ⇒ F[W, B]): F[W, B]

if lifted into a binding.

def invariantFunctorLaw: InvariantFunctorLaw

val invariantFunctorSyntax: InvariantFunctorSyntax[[α]F[W, α]]

final def isInstanceOf[T0]: Boolean

def iterateUntil[A](f: F[W, A])(p: (A) ⇒ Boolean): F[W, A]

Execute an action repeatedly until its result satisfies the given predicate and return that result, discarding all others.

def iterateWhile[A](f: F[W, A])(p: (A) ⇒ Boolean): F[W, A]

Execute an action repeatedly until its result fails to satisfy the given predicate and return that result, discarding all others.

def join[A](ffa: F[W, F[W, A]]): F[W, A]

Sequence the inner F of FFA after the outer F, forming a single F[A].

def lift[A, B](f: (A) ⇒ B): (F[W, A]) ⇒ F[W, B]

Lift f into F.

def lift10[A, B, C, D, E, FF, G, H, I, J, R](f: (A, B, C, D, E, FF, G, H, I, J) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H], F[W, I], F[W, J]) ⇒ F[W, R]

def lift11[A, B, C, D, E, FF, G, H, I, J, K, R](f: (A, B, C, D, E, FF, G, H, I, J, K) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H], F[W, I], F[W, J], F[W, K]) ⇒ F[W, R]

def lift12[A, B, C, D, E, FF, G, H, I, J, K, L, R](f: (A, B, C, D, E, FF, G, H, I, J, K, L) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H], F[W, I], F[W, J], F[W, K], F[W, L]) ⇒ F[W, R]

def lift2[A, B, C](f: (A, B) ⇒ C): (F[W, A], F[W, B]) ⇒ F[W, C]

def lift3[A, B, C, D](f: (A, B, C) ⇒ D): (F[W, A], F[W, B], F[W, C]) ⇒ F[W, D]

def lift4[A, B, C, D, E](f: (A, B, C, D) ⇒ E): (F[W, A], F[W, B], F[W, C], F[W, D]) ⇒ F[W, E]

def lift5[A, B, C, D, E, R](f: (A, B, C, D, E) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E]) ⇒ F[W, R]

def lift6[A, B, C, D, E, FF, R](f: (A, B, C, D, E, FF) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF]) ⇒ F[W, R]

def lift7[A, B, C, D, E, FF, G, R](f: (A, B, C, D, E, FF, G) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G]) ⇒ F[W, R]

def lift8[A, B, C, D, E, FF, G, H, R](f: (A, B, C, D, E, FF, G, H) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H]) ⇒ F[W, R]

def lift9[A, B, C, D, E, FF, G, H, I, R](f: (A, B, C, D, E, FF, G, H, I) ⇒ R): (F[W, A], F[W, B], F[W, C], F[W, D], F[W, E], F[W, FF], F[W, G], F[W, H], F[W, I]) ⇒ F[W, R]

def map[A, B](fa: F[W, A])(f: (A) ⇒ B): F[W, B]

Lift f into F and apply to F[A].

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

Lift apply(a), and apply the result to f.

def monadLaw: MonadLaw

val monadSyntax: MonadSyntax[[α]F[W, α]]

val monadTellSyntax: MonadTellSyntax[F, W]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

The product of Applicatives F and G, [x](F[x], G[x]]), is an Applicative

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

The product of Applys F and G, [x](F[x], G[x]]), is a Apply

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

The product of Functors F and G, [x](F[x], G[x]]), is a Functor

final def pure[A](a: ⇒ A): F[W, A]

def replicateM[A](n: Int, fa: F[W, A]): F[W, List[A]]

Performs the action n times, returning the list of results.

def replicateM_[A](n: Int, fa: F[W, A]): F[W, Unit]

Performs the action n times, returning nothing.

def sequence[A, G[_]](as: G[F[W, A]])(implicit arg0: Traverse[G]): F[W, G[A]]

def sequence1[A, G[_]](as: G[F[W, A]])(implicit arg0: Traverse1[G]): F[W, G[A]]

def strengthL[A, B](a: A, f: F[W, B]): F[W, (A, B)]

Inject a to the left of Bs in f.

def strengthR[A, B](f: F[W, A], b: B): F[W, (A, B)]

Inject b to the right of As in f.

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

def tell(w: W): F[W, Unit]

def toString(): String

def traverse[A, G[_], B](value: G[A])(f: (A) ⇒ F[W, B])(implicit G: Traverse[G]): F[W, G[B]]

def traverse1[A, G[_], B](value: G[A])(f: (A) ⇒ F[W, B])(implicit G: Traverse1[G]): F[W, G[B]]

def tuple2[A, B](fa: ⇒ F[W, A], fb: ⇒ F[W, B]): F[W, (A, B)]

def tuple3[A, B, C](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C]): F[W, (A, B, C)]

def tuple4[A, B, C, D](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D]): F[W, (A, B, C, D)]

def tuple5[A, B, C, D, E](fa: ⇒ F[W, A], fb: ⇒ F[W, B], fc: ⇒ F[W, C], fd: ⇒ F[W, D], fe: ⇒ F[W, E]): F[W, (A, B, C, D, E)]

def unlessM[A](cond: Boolean)(f: ⇒ F[W, A]): F[W, Unit]

Returns the given argument if cond is false, otherwise, unit lifted into F.

def untilM[G[_], A](f: F[W, A], cond: ⇒ F[W, Boolean])(implicit G: MonadPlus[G]): F[W, G[A]]

Execute an action repeatedly until the Boolean condition returns true.

def untilM_[A](f: F[W, A], cond: ⇒ F[W, Boolean]): F[W, Unit]

Execute an action repeatedly until the Boolean condition returns true.

def void[A](fa: F[W, A]): F[W, Unit]

Empty fa of meaningful pure values, preserving its structure.

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def whenM[A](cond: Boolean)(f: ⇒ F[W, A]): F[W, Unit]

Returns the given argument if cond is true, otherwise, unit lifted into F.

def whileM[G[_], A](p: F[W, Boolean], body: ⇒ F[W, A])(implicit G: MonadPlus[G]): F[W, G[A]]

Execute an action repeatedly as long as the given Boolean expression returns true.

def whileM_[A](p: F[W, Boolean], body: ⇒ F[W, A]): F[W, Unit]

Execute an action repeatedly as long as the given Boolean expression returns true.

def xmap[A, B](fa: F[W, A], f: (A) ⇒ B, g: (B) ⇒ A): F[W, B]

Converts ma to a value of type F[B] using the provided functions f and g.

def xmapb[A, B](ma: F[W, A])(b: BijectionT.Bijection[A, B]): F[W, B]

Converts ma to a value of type F[B] using the provided bijection.

def xmapi[A, B](ma: F[W, A])(iso: Isomorphism.<=>[A, B]): F[W, B]

Converts ma to a value of type F[B] using the provided isomorphism.

def zip: Zip[[α]F[W, α]]

scalaz.Zip derived from tuple2.