type StateT[F[_], S, A] = IndexedStateT[F, S, S, A]
- Source
- package.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- StateT
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Abstract Value Members
-
abstract
def
getF[S <: S1]: (Monad[F]) ⇒ F[(S) ⇒ F[(S2, A)]]
- Definition Classes
- IndexedStateT
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
apply(initial: S1)(implicit F: Monad[F]): F[(S2, A)]
Run and return the final value and state in the context of
FRun and return the final value and state in the context of
F- Definition Classes
- IndexedStateT
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
bimap[X, B](f: (S2) ⇒ X)(g: (A) ⇒ B)(implicit F: Functor[F]): IndexedStateT[F, S1, X, B]
- Definition Classes
- IndexedStateT
-
def
bmap[X, S >: S2 <: S1](b: Bijection[S, X]): StateT[F, X, A]
- Definition Classes
- IndexedStateT
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
contramap[X](g: (X) ⇒ S1): IndexedStateT[F, X, S2, A]
- Definition Classes
- IndexedStateT
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
eval(initial: S1)(implicit F: Monad[F]): F[A]
Run, discard the final state, and return the final value in the context of
FRun, discard the final state, and return the final value in the context of
F- Definition Classes
- IndexedStateT
-
def
evalZero[S <: S1](implicit F: Monad[F], S: Monoid[S]): F[A]
Calls
evalusingMonoid[S].zeroas the initial stateCalls
evalusingMonoid[S].zeroas the initial state- Definition Classes
- IndexedStateT
-
def
exec(initial: S1)(implicit F: Monad[F]): F[S2]
Run, discard the final value, and return the final state in the context of
FRun, discard the final value, and return the final state in the context of
F- Definition Classes
- IndexedStateT
-
def
execZero[S <: S1](implicit F: Monad[F], S: Monoid[S]): F[S2]
Calls
execusingMonoid[S].zeroas the initial stateCalls
execusingMonoid[S].zeroas the initial state- Definition Classes
- IndexedStateT
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
flatMap[S3, B](f: (A) ⇒ IndexedStateT[F, S2, S3, B])(implicit F: Monad[F]): IndexedStateT[F, S1, S3, B]
- Definition Classes
- IndexedStateT
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
imap[X](f: (S2) ⇒ X)(implicit F: Functor[F]): IndexedStateT[F, S1, X, A]
- Definition Classes
- IndexedStateT
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
leftMap[X](f: (S2) ⇒ X)(implicit F: Functor[F]): IndexedStateT[F, S1, X, A]
- Definition Classes
- IndexedStateT
-
def
lift[M[_]](implicit F: Monad[F], M: Applicative[M]): IndexedStateT[[α]M[F[α]], S1, S2, A]
- Definition Classes
- IndexedStateT
-
def
liftF[S <: S1]: Free[[δ$0$]IndexedStateT[F, S, S2, δ$0$], A]
- Definition Classes
- IndexedStateT
-
def
map[B](f: (A) ⇒ B)(implicit F: Functor[F]): IndexedStateT[F, S1, S2, B]
- Definition Classes
- IndexedStateT
-
def
mapK[G[_], B, S](f: (F[(S2, A)]) ⇒ G[(S, B)])(implicit M: Monad[F]): IndexedStateT[G, S1, S, B]
Alias for mapT
Alias for mapT
- Definition Classes
- IndexedStateT
-
def
mapT[G[_], B, S](f: (F[(S2, A)]) ⇒ G[(S, B)])(implicit M: Monad[F]): IndexedStateT[G, S1, S, B]
Map both the return value and final state using the given function.
Map both the return value and final state using the given function.
- Definition Classes
- IndexedStateT
-
def
mapsf[X1, X2, B](f: ((S1) ⇒ F[(S2, A)]) ⇒ (X1) ⇒ F[(X2, B)]): IndexedStateT[F, X1, X2, B]
- Definition Classes
- IndexedStateT
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
run(initial: S1)(implicit F: Monad[F]): F[(S2, A)]
An alias for
applyAn alias for
apply- Definition Classes
- IndexedStateT
-
def
runZero[S <: S1](implicit S: Monoid[S], F: Monad[F]): F[(S2, A)]
Calls
runusingMonoid[S].zeroas the initial stateCalls
runusingMonoid[S].zeroas the initial state- Definition Classes
- IndexedStateT
-
def
rwst[W, R](implicit F: Monad[F], W: Monoid[W]): IndexedReaderWriterStateT[F, R, W, S1, S2, A]
- Definition Classes
- IndexedStateT
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
unlift[M[_], FF[_], S <: S1](implicit M: Comonad[M], F: Monad[[α]M[FF[α]]], ev: <~<[IndexedStateT.this.type, IndexedStateT[[α]M[FF[α]], S, S2, A]]): IndexedStateT[FF, S, S2, A]
- Definition Classes
- IndexedStateT
-
def
unliftId[M[_], S <: S1](implicit M: Comonad[M], F: Monad[M], ev: <~<[IndexedStateT.this.type, IndexedStateT[M, S, S2, A]]): IndexedState[S, S2, A]
- Definition Classes
- IndexedStateT
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
xmap[X1, X2](f: (S2) ⇒ X1)(g: (X2) ⇒ S1): IndexedStateT[F, X2, X1, A]
- Definition Classes
- IndexedStateT
-
def
zoom[S0, S3, S <: S1](l: LensFamily[S0, S3, S, S2])(implicit F: Functor[F]): IndexedStateT[F, S0, S3, A]
- Definition Classes
- IndexedStateT