Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
implicit
def
StateMonadTrans[S]: Hoist[[a[_], b]IndexedStateT[S, S, a, b]]
-
def
apply[S, F[_], A](f: (S) ⇒ F[(S, A)]): StateT[S, F, A]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
constantIndexedStateT[S1, S2, F[_], A](a: A)(s: ⇒ S2)(implicit F: Applicative[F]): IndexedStateT[S1, S2, F, A]
-
def
constantStateT[S, F[_], A](a: A)(s: ⇒ S)(implicit F: Applicative[F]): StateT[S, F, A]
-
implicit
def
contravariantS1[S2, F[_], A]: IsContravariant[[α$21$]IndexedStateT[α$21$, S2, F, A]]
-
-
-
def
finalize(): Unit
-
def
get[F[_], S](implicit arg0: Monad[F]): StateT[S, F, S]
-
final
def
getClass(): Class[_]
-
def
gets[F[_], S, A](f: (S) ⇒ A)(implicit arg0: Monad[F]): StateT[S, F, A]
-
def
hashCode(): Int
-
def
hoist[F[_], G[_], S, A](nat: ~>[F, G])(implicit arg0: Monad[F], arg1: Monad[G]): ~>[[γ$0$]IndexedStateT[S, S, F, γ$0$], [γ$1$]IndexedStateT[S, S, G, γ$1$]]
-
implicit
def
indexedStateProfunctor[S2, F[_]](implicit F0: Applicative[F]): Profunctor[[α$2$, δ$3$]IndexedStateT[α$2$, S2, F, δ$3$]]
-
implicit
def
indexedStateTBifunctor[S1, F[_]](implicit F0: Applicative[F]): Bifunctor[[β$8$, δ$9$]IndexedStateT[S1, β$8$, F, δ$9$]]
-
implicit
def
indexedStateTContravariant[S2, A0, F[_]](implicit F0: Applicative[F]): Contravariant[[α$6$]IndexedStateT[α$6$, S2, F, A0]]
-
implicit
def
indexedStateTFunctorLeft[S1, A0, F[_]](implicit F0: Applicative[F]): Functor[[β$7$]IndexedStateT[S1, β$7$, F, A0]]
-
implicit
def
indexedStateTFunctorRight[S1, S2, F[_]](implicit F0: Applicative[F]): Functor[[δ$10$]IndexedStateT[S1, S2, F, δ$10$]]
-
implicit
def
indexedStateTPlus[F[_], S1, S2](implicit arg0: Bind[F], arg1: Plus[F]): Plus[[δ$11$]IndexedStateT[S1, S2, F, δ$11$]]
-
final
def
isInstanceOf[T0]: Boolean
-
def
liftM[F[_], S, A](fa: F[A])(implicit arg0: Monad[F]): StateT[S, F, A]
-
def
modify[F[_], S](f: (S) ⇒ S)(implicit arg0: Monad[F]): StateT[S, F, Unit]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
put[F[_], S](s: S)(implicit arg0: Monad[F]): StateT[S, F, Unit]
-
implicit
def
stateComonad[S](implicit S: Monoid[S]): Comonad[[β$18$]IndexedStateT[S, S, [X]X, β$18$]]
-
implicit
def
stateMonad[S]: MonadState[[β$20$]IndexedStateT[S, S, [X]X, β$20$], S]
-
def
stateT[S, F[_], A](a: A)(implicit F: Applicative[F]): StateT[S, F, A]
-
implicit
def
stateTBindRec[S, F[_]](implicit F0: Applicative[F]): BindRec[[γ$13$]IndexedStateT[S, S, F, γ$13$]]
-
implicit
def
stateTDecidable[S, F[_]](implicit F0: Decidable[F], F1: Bind[F]): Decidable[[γ$15$]IndexedStateT[S, S, F, γ$15$]]
-
implicit
def
stateTDivisible[S, F[_]](implicit F0: Divisible[F], F1: Bind[F]): Divisible[[γ$12$]IndexedStateT[S, S, F, γ$12$]]
-
implicit
def
stateTMonadError[S, F[_], E](implicit F0: MonadError[F, E]): MonadError[[γ$14$]IndexedStateT[S, S, F, γ$14$], E]
-
implicit
def
stateTMonadPlus[S, F[_]](implicit F0: MonadPlus[F]): MonadPlus[[γ$17$]IndexedStateT[S, S, F, γ$17$]]
-
implicit
def
stateTMonadState[S, F[_]](implicit F0: Applicative[F]): MonadState[[γ$16$]IndexedStateT[S, S, F, γ$16$], S]
-
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
