StateT

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply[F[_], S, A](f: (S) ⇒ F[(S, A)])(implicit F: Applicative[F]): StateT[F, S, A]

def applyF[F[_], S, A](runF: F[(S) ⇒ F[(S, A)]]): StateT[F, S, A]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def get[F[_], S](implicit F: Applicative[F]): IndexedStateT[F, S, S, S]

final def getClass(): Class[_]

def hashCode(): Int

def inspect[F[_], S, A](f: (S) ⇒ A)(implicit F: Applicative[F]): IndexedStateT[F, S, S, A]

def inspectF[F[_], S, A](f: (S) ⇒ F[A])(implicit F: Applicative[F]): IndexedStateT[F, S, S, A]

final def isInstanceOf[T0]: Boolean

def liftF[F[_], S, A](fa: F[A])(implicit F: Applicative[F]): IndexedStateT[F, S, S, A]

def liftK[F[_], S](implicit F: Applicative[F]): ~>[F, [δ$0$]IndexedStateT[F, S, S, δ$0$]]

Same as liftF, but expressed as a FunctionK for use with mapK

scala> import cats._, data._, implicits._
scala> val a: OptionT[Eval, Int] = 1.pure[OptionT[Eval, ?]]
scala> val b: OptionT[StateT[Eval, String, ?], Int] = a.mapK(StateT.liftK)
scala> b.value.runEmpty.value
res0: (String, Option[Int]) = ("",Some(1))

def modify[F[_], S](f: (S) ⇒ S)(implicit F: Applicative[F]): StateT[F, S, Unit]

def modifyF[F[_], S](f: (S) ⇒ F[S])(implicit F: Applicative[F]): StateT[F, S, Unit]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pure[F[_], S, A](a: A)(implicit F: Applicative[F]): IndexedStateT[F, S, S, A]

def set[F[_], S](s: S)(implicit F: Applicative[F]): StateT[F, S, Unit]

def setF[F[_], S](fs: F[S])(implicit F: Applicative[F]): StateT[F, S, Unit]

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

def lift[F[_], S, A](fa: F[A])(implicit F: Applicative[F]): IndexedStateT[F, S, S, A]