Packages

type StateT[F[_], S, A] = IndexedStateT[F, S, S, A]

Source
package.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. StateT
  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

    Definition Classes
    IndexedStateT
    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[F, S1, X, B]
    Definition Classes
    IndexedStateT
  7. def bmap[X, S >: S2 <: S1](b: Bijection[S, X])(implicit F: Applicative[F]): StateT[F, X, A]
    Definition Classes
    IndexedStateT
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  9. def contramap[X](g: (X) ⇒ S1)(implicit F: Applicative[F]): IndexedStateT[F, X, S2, A]
    Definition Classes
    IndexedStateT
  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

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

    Definition Classes
    IndexedStateT
  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

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

    Definition Classes
    IndexedStateT
  14. def evalZero[S <: S1](implicit F: Bind[F], S: Monoid[S]): F[A]

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

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

    Definition Classes
    IndexedStateT
  15. def evalZeroRec[S <: S1](implicit F: BindRec[F], S: Monoid[S]): F[A]

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

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

    Definition Classes
    IndexedStateT
  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

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

    Definition Classes
    IndexedStateT
  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

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

    Definition Classes
    IndexedStateT
  18. def execZero[S <: S1](implicit F: Bind[F], S: Monoid[S]): F[S2]

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

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

    Definition Classes
    IndexedStateT
  19. def execZeroRec[S <: S1](implicit F: BindRec[F], S: Monoid[S]): F[S2]

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

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

    Definition Classes
    IndexedStateT
  20. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  21. def flatMap[S3, B](f: (A) ⇒ IndexedStateT[F, S2, S3, B]): IndexedStateT[F, S1, S3, B]
    Definition Classes
    IndexedStateT
  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[F, S1, X, A]
    Definition Classes
    IndexedStateT
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def leftMap[X](f: (S2) ⇒ X)(implicit F: Applicative[F]): IndexedStateT[F, S1, X, A]
    Definition Classes
    IndexedStateT
  27. def lift[M[_]](implicit F: Bind[F], M: Applicative[M]): IndexedStateT[[α]M[F[α]], S1, S2, A]
    Definition Classes
    IndexedStateT
  28. def liftF[S <: S1]: Free[[δ$0$]IndexedStateT[F, S, S2, δ$0$], A]
    Definition Classes
    IndexedStateT
  29. def map[B](f: (A) ⇒ B)(implicit F: Applicative[F]): IndexedStateT[F, S1, S2, B]
    Definition Classes
    IndexedStateT
  30. 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
  31. 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
  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

    An alias for apply

    Definition Classes
    IndexedStateT
  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

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

    Definition Classes
    IndexedStateT
  37. def runZero[S <: S1](implicit S: Monoid[S], F: Bind[F]): F[(S2, A)]

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

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

    Definition Classes
    IndexedStateT
  38. def runZeroRec[S <: S1](implicit S: Monoid[S], F: BindRec[F]): F[(S2, A)]

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

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

    Definition Classes
    IndexedStateT
  39. def rwst[W, R](implicit F: Bind[F], W: Monoid[W]): IndexedReaderWriterStateT[F, R, W, S1, S2, A]
    Definition Classes
    IndexedStateT
  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[[α]M[FF[α]], S, S2, A]]): IndexedStateT[FF, S, S2, A]
    Definition Classes
    IndexedStateT
  43. def unliftId[M[_], S <: S1](implicit M: Comonad[M], F: Bind[M], ev: <~<[IndexedStateT.this.type, IndexedStateT[M, S, S2, A]]): IndexedState[S, S2, A]
    Definition Classes
    IndexedStateT
  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
    @native() @throws( ... )
  47. def xmap[X1, X2](f: (S2) ⇒ X1)(g: (X2) ⇒ S1)(implicit F: Applicative[F]): IndexedStateT[F, X2, X1, A]
    Definition Classes
    IndexedStateT
  48. def zoom[S0, S3, S <: S1](l: LensFamily[S0, S3, S, S2])(implicit F: Applicative[F]): IndexedStateT[F, S0, S3, A]
    Definition Classes
    IndexedStateT

Inherited from AnyRef

Inherited from Any

Ungrouped