Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
implicit
def
StateMonadTrans[S]: Hoist[[g[_$1], a]IndexedStateT[g, S, S, a]]
-
def
apply[F[_], S, A](f: (S) ⇒ F[(S, A)]): StateT[F, S, A]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
constantIndexedStateT[F[_], S1, S2, A](a: A)(s: ⇒ S2)(implicit F: Applicative[F]): IndexedStateT[F, S1, S2, A]
-
def
constantStateT[F[_], S, A](a: A)(s: ⇒ S)(implicit F: Applicative[F]): StateT[F, S, A]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
implicit
def
indexedStateTBifunctor[S1, F[_]](implicit F0: Functor[F]): Bifunctor[[X_kp2, X_kp3]IndexedStateT[F, S1, X_kp2, X_kp3]]
-
implicit
def
indexedStateTContravariant[S2, A0, F[_]]: Contravariant[[X_kp1]IndexedStateT[F, X_kp1, S2, A0]]
-
implicit
def
indexedStateTFunctorLeft[S1, A0, F[_]](implicit F0: Functor[F]): Functor[[X_kp2]IndexedStateT[F, S1, X_kp2, A0]]
-
implicit
def
indexedStateTFunctorRight[S1, S2, F[_]](implicit F0: Functor[F]): Functor[[X_kp3]IndexedStateT[F, S1, S2, X_kp3]]
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
implicit
def
stateMonad[S]: MonadState[[X_kp0, X_kp1]IndexedStateT[[+X]X, X_kp0, X_kp0, X_kp1], S]
-
def
stateT[F[_], S, A](a: A)(implicit F: Applicative[F]): StateT[F, S, A]
-
implicit
def
stateTMonadPlus[S, F[_]](implicit F0: MonadPlus[F]): MonadPlus[[X_kp2]IndexedStateT[F, S, S, X_kp2]]
-
implicit
def
stateTMonadState[S, F[_]](implicit F0: Monad[F]): MonadState[[X_kp1, X_kp2]IndexedStateT[F, X_kp1, X_kp1, X_kp2], 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
Inherited from AnyRef
Inherited from Any