WriterT

abstract val run: F[(W, A)]

final def !=(arg0: Any): Boolean

final def ##(): Int

def :++>[WW >: W](w: ⇒ WW)(implicit F: Functor[F], W: Semigroup[WW]): WriterT[F, WW, A]

def :++>>[WW >: W](f: (A) ⇒ WW)(implicit F: Functor[F], W: Semigroup[WW]): WriterT[F, WW, A]

def <++:[WW >: W](w: ⇒ WW)(implicit F: Functor[F], W: Semigroup[WW]): WriterT[F, WW, A]

def <<++:[WW >: W](f: (A) ⇒ WW)(implicit F: Functor[F], s: Semigroup[WW]): WriterT[F, WW, A]

final def ==(arg0: Any): Boolean

def ap[B, WW >: W](f: ⇒ WriterT[F, WW, (A) ⇒ B])(implicit F: Apply[F], W: Semigroup[WW]): WriterT[F, WW, B]

final def asInstanceOf[T0]: T0

def bimap[C, D](f: (W) ⇒ C, g: (A) ⇒ D)(implicit F: Functor[F]): WriterT[F, C, D]

def bitraverse[G[_], C, D](f: (W) ⇒ G[C], g: (A) ⇒ G[D])(implicit G: Applicative[G], F: Traverse[F]): G[WriterT[F, C, D]]

def clone(): AnyRef

def colocal[X](f: (W) ⇒ X)(implicit F: Functor[F]): WriterT[F, X, A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def flatMap[B, WW >: W](f: (A) ⇒ WriterT[F, WW, B])(implicit F: Bind[F], s: Semigroup[WW]): WriterT[F, WW, B]

def foldRight[B](z: ⇒ B)(f: (A, ⇒ B) ⇒ B)(implicit F: Foldable[F]): B

def foreach[B](f: (A) ⇒ Unit)(implicit E: Each[F]): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def leftMap[C](f: (W) ⇒ C)(implicit F: Functor[F]): WriterT[F, C, A]

def map[B](f: (A) ⇒ B)(implicit F: Functor[F]): WriterT[F, W, B]

def mapValue[X, B](f: ((W, A)) ⇒ (X, B))(implicit F: Functor[F]): WriterT[F, X, B]

def mapWritten[X](f: (W) ⇒ X)(implicit F: Functor[F]): WriterT[F, X, A]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def off: UnwriterT[F, W, A]

def reset[WW >: W](implicit Z: Monoid[WW], F: Functor[F]): WriterT[F, WW, A]

def rwst[R, S](implicit F: Functor[F]): ReaderWriterStateT[F, R, W, S, A]

def swap(implicit F: Functor[F]): WriterT[F, A, W]

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

def toString(): String

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

def unary_-: UnwriterT[F, W, A]

alias for off

def value(implicit F: Functor[F]): F[A]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def wpoint[G[+_]](implicit F: Functor[F], P: Applicative[G]): WriterT[F, G[W], A]

def written(implicit F: Functor[F]): F[W]