IndexedStateT

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply[F[_], SA, SB, A](f: (SA) ⇒ F[(SB, A)])(implicit F: Applicative[F]): IndexedStateT[F, SA, SB, A]

def applyF[F[_], SA, SB, A](runF: F[(SA) ⇒ F[(SB, A)]]): IndexedStateT[F, SA, SB, A]

final def asInstanceOf[T0]: T0

implicit def catsDataAlternativeForIndexedStateT[F[_], S](implicit FM: Monad[F], FA: Alternative[F]): Alternative[[δ$3$]IndexedStateT[F, S, S, δ$3$]] with Monad[[δ$4$]IndexedStateT[F, S, S, δ$4$]]

implicit def catsDataBifunctorForIndexedStateT[F[_], SA](implicit F0: Functor[F]): Bifunctor[[γ$15$, δ$16$]IndexedStateT[F, SA, γ$15$, δ$16$]]

implicit def catsDataContravariantForIndexedStateT[F[_], SB, V](implicit F0: Functor[F]): Contravariant[[β$12$]IndexedStateT[F, β$12$, SB, V]]

implicit def catsDataDeferForIndexedStateT[F[_], SA, SB](implicit F: Defer[F]): Defer[[δ$5$]IndexedStateT[F, SA, SB, δ$5$]]

implicit def catsDataFunctorFilterForIndexedStateT[F[_], SA, SB](implicit ev1: Monad[F], ev2: FunctorFilter[F]): FunctorFilter[[δ$7$]IndexedStateT[F, SA, SB, δ$7$]]

implicit def catsDataFunctorForIndexedStateT[F[_], SA, SB](implicit F0: Functor[F]): Functor[[δ$11$]IndexedStateT[F, SA, SB, δ$11$]]

implicit def catsDataMonadErrorForIndexedStateT[F[_], S, E](implicit F0: MonadError[F, E]): MonadError[[δ$8$]IndexedStateT[F, S, S, δ$8$], E]

implicit def catsDataMonadForIndexedStateT[F[_], S](implicit F0: Monad[F]): Monad[[δ$10$]IndexedStateT[F, S, S, δ$10$]]

implicit def catsDataProfunctorForIndexedStateT[F[_], V](implicit F0: Functor[F]): Profunctor[[β$13$, γ$14$]IndexedStateT[F, β$13$, γ$14$, V]]

implicit def catsDataSemigroupKForIndexedStateT[F[_], SA, SB](implicit F0: Monad[F], G0: SemigroupK[F]): SemigroupK[[δ$9$]IndexedStateT[F, SA, SB, δ$9$]]

implicit def catsDataStrongForIndexedStateT[F[_], V](implicit F0: Monad[F]): Strong[[β$17$, γ$18$]IndexedStateT[F, β$17$, γ$18$, V]]

def clone(): AnyRef

def empty[F[_], S, A](implicit A: Monoid[A], F: Applicative[F]): IndexedStateT[F, S, S, A]

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[_], SA, SB](f: (SA) ⇒ SB)(implicit F: Applicative[F]): IndexedStateT[F, SA, SB, Unit]

def modifyF[F[_], SA, SB](f: (SA) ⇒ F[SB])(implicit F: Applicative[F]): IndexedStateT[F, SA, SB, 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[_], SA, SB](sb: SB)(implicit F: Applicative[F]): IndexedStateT[F, SA, SB, Unit]

def setF[F[_], SA, SB](fsb: F[SB])(implicit F: Applicative[F]): IndexedStateT[F, SA, SB, 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]