Packages

sealed abstract class IndexedStateT[S1, S2, F[_], A] extends AnyRef

Self Type
IndexedStateT[S1, S2, F, A]
Source
StateT.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexedStateT
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def apply(initial: S1)(implicit F: Bind[F]): F[(S2, A)]

    Run and return the final value and state in the context of F

    Run and return the final value and state in the context of F

    Annotations
    @tailrec()
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def bimap[X, B](f: (S2) ⇒ X)(g: (A) ⇒ B)(implicit F: Applicative[F]): IndexedStateT[S1, X, F, B]
  7. def bmap[X, S](b: Bijection[S, X])(implicit F: Applicative[F], S1: <~<[S, S1], S2: >~>[S, S2]): StateT[X, F, A]
  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  9. def contramap[X](g: (X) ⇒ S1)(implicit F: Applicative[F]): IndexedStateT[X, S2, F, A]
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def eval(initial: S1)(implicit F: Bind[F]): F[A]

    Run, discard the final state, and return the final value in the context of F

  13. def evalRec(initial: S1)(implicit F: BindRec[F]): F[A]

    Run, discard the final state, and return the final value in the context of F

  14. def evalZero(implicit F: Bind[F], S1: Monoid[S1]): F[A]

    Calls eval using Monoid[S].zero as the initial state

  15. def evalZeroRec(implicit F: BindRec[F], S1: Monoid[S1]): F[A]

    Calls eval using Monoid[S].zero as the initial state

  16. def exec(initial: S1)(implicit F: Bind[F]): F[S2]

    Run, discard the final value, and return the final state in the context of F

  17. def execRec(initial: S1)(implicit F: BindRec[F]): F[S2]

    Run, discard the final value, and return the final state in the context of F

  18. def execZero(implicit F: Bind[F], S1: Monoid[S1]): F[S2]

    Calls exec using Monoid[S].zero as the initial state

  19. def execZeroRec(implicit F: BindRec[F], S1: Monoid[S1]): F[S2]

    Calls exec using Monoid[S].zero as the initial state

  20. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. def flatMap[S3, B](f: (A) ⇒ IndexedStateT[S2, S3, F, B]): IndexedStateT[S1, S3, F, B]
  22. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  23. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. def imap[X](f: (S2) ⇒ X)(implicit F: Applicative[F]): IndexedStateT[S1, X, F, A]
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def leftMap[X](f: (S2) ⇒ X)(implicit F: Applicative[F]): IndexedStateT[S1, X, F, A]
  27. def lift[M[_]](implicit F: Bind[F], M: Applicative[M]): IndexedStateT[S1, S2, [α]M[F[α]], A]
  28. def liftF: Free[[δ$0$]IndexedStateT[S1, S2, F, δ$0$], A]
  29. def map[B](f: (A) ⇒ B)(implicit F: Applicative[F]): IndexedStateT[S1, S2, F, B]
  30. def mapK[G[_], B, S](f: (F[(S2, A)]) ⇒ G[(S, B)])(implicit M: Monad[F]): IndexedStateT[S1, S, G, B]

    Alias for mapT

  31. def mapT[G[_], B, S](f: (F[(S2, A)]) ⇒ G[(S, B)])(implicit M: Monad[F]): IndexedStateT[S1, S, G, B]

    Map both the return value and final state using the given function.

  32. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  33. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  34. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  35. def run(initial: S1)(implicit F: Bind[F]): F[(S2, A)]

    An alias for apply

  36. def runRec(initial: S1)(implicit F: BindRec[F]): F[(S2, A)]

    Run and return the final value and state in the context of F

  37. def runZero(implicit S1: Monoid[S1], F: Bind[F]): F[(S2, A)]

    Calls run using Monoid[S].zero as the initial state

  38. def runZeroRec(implicit S1: Monoid[S1], F: BindRec[F]): F[(S2, A)]

    Calls run using Monoid[S].zero as the initial state

  39. def rwst[W, R](implicit F: Bind[F], W: Monoid[W]): IndexedReaderWriterStateT[R, W, S1, S2, F, A]
  40. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  41. def toString(): String
    Definition Classes
    AnyRef → Any
  42. def unlift[M[_], FF[_], S <: S1](implicit M: Comonad[M], F: Bind[[α]M[FF[α]]], ev: <~<[IndexedStateT.this.type, IndexedStateT[S, S2, [α]M[FF[α]], A]]): IndexedStateT[S, S2, FF, A]
  43. def unliftId[M[_], S <: S1](implicit M: Comonad[M], F: Bind[M], ev: <~<[IndexedStateT.this.type, IndexedStateT[S, S2, M, A]]): IndexedState[S, S2, A]
  44. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  45. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  46. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  47. def xmap[X1, X2](f: (S2) ⇒ X1)(g: (X2) ⇒ S1)(implicit F: Applicative[F]): IndexedStateT[X2, X1, F, A]
  48. def zoom[S0, S3, S <: S1](l: LensFamily[S0, S3, S, S2])(implicit F: Applicative[F]): IndexedStateT[S0, S3, F, A]

Inherited from AnyRef

Inherited from Any

Ungrouped