ReaderWriterStateT

abstract def getF[S <: S1, RR <: R]: (Monad[F]) ⇒ F[(RR, S) ⇒ F[(W, A, S2)]]

final def !=(arg0: Any): Boolean

final def ##(): Int

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 eval(r: R, s: S1)(implicit F: Monad[F]): F[(W, A)]

Run, discard the final state, and return the final value in the context of F

def evalZero[S <: S1](r: R)(implicit F: Monad[F], S: Monoid[S]): F[(W, A)]

Calls eval using Monoid[S].zero as the initial state

def exec(r: R, s: S1)(implicit F: Monad[F]): F[(W, S2)]

Run, discard the final value, and return the final state in the context of F

def execZero[S <: S1](r: R)(implicit F: Monad[F], S: Monoid[S]): F[(W, S2)]

Calls exec using Monoid[S].zero as the initial state

def finalize(): Unit

def flatMap[B, RR <: R, S3](f: (A) ⇒ IndexedReaderWriterStateT[RR, W, S2, S3, F, B])(implicit F: Bind[F], W: Semigroup[W]): IndexedReaderWriterStateT[RR, W, S1, S3, F, B]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def map[B](f: (A) ⇒ B)(implicit F: Functor[F]): IndexedReaderWriterStateT[R, W, S1, S2, F, B]

def mapT[G[_], B, WU, S2U](f: (F[(W, A, S2)]) ⇒ G[(WU, B, S2U)])(implicit F: Monad[F]): IndexedReaderWriterStateT[R, WU, S1, S2U, G, B]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def run(r: R, s: S1)(implicit F: Monad[F]): F[(W, A, S2)]

def runZero[S <: S1](r: R)(implicit F: Monad[F], S: Monoid[S]): F[(W, A, S2)]

Calls run using Monoid[S].zero as the initial state

def state(r: R)(implicit F: Monad[F]): IndexedStateT[S1, S2, F, A]

Discards the writer component.

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit