Class/Object

scalaz

IndexedStateT

Related Docs: object IndexedStateT | package scalaz

Permalink

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

Self Type
IndexedStateT[F, S1, S2, 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

Abstract Value Members

  1. abstract def getF[S <: S1]: (Monad[F]) ⇒ F[(S) ⇒ F[(S2, A)]]

    Permalink

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. def apply(initial: S1)(implicit F: Monad[F]): F[(S2, A)]

    Permalink

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

  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def bimap[X, B](f: (S2) ⇒ X)(g: (A) ⇒ B)(implicit F: Functor[F]): IndexedStateT[F, S1, X, B]

    Permalink
  7. def bmap[X, S >: S2 <: S1](b: Bijection[S, X]): StateT[F, X, A]

    Permalink
  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def contramap[X](g: (X) ⇒ S1): IndexedStateT[F, X, S2, A]

    Permalink
  10. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  12. def eval(initial: S1)(implicit F: Monad[F]): F[A]

    Permalink

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

  13. def evalZero[S <: S1](implicit F: Monad[F], S: Monoid[S]): F[A]

    Permalink

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

  14. def exec(initial: S1)(implicit F: Monad[F]): F[S2]

    Permalink

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

  15. def execZero[S <: S1](implicit F: Monad[F], S: Monoid[S]): F[S2]

    Permalink

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

  16. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def flatMap[S3, B](f: (A) ⇒ IndexedStateT[F, S2, S3, B])(implicit F: Monad[F]): IndexedStateT[F, S1, S3, B]

    Permalink
  18. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  19. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  20. def imap[X](f: (S2) ⇒ X)(implicit F: Functor[F]): IndexedStateT[F, S1, X, A]

    Permalink
  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  22. def leftMap[X](f: (S2) ⇒ X)(implicit F: Functor[F]): IndexedStateT[F, S1, X, A]

    Permalink
  23. def lift[M[_]](implicit F: Monad[F], M: Applicative[M]): IndexedStateT[[α]M[F[α]], S1, S2, A]

    Permalink
  24. def liftF[S <: S1](implicit F: Functor[[δ$0$]IndexedStateT[F, S, S2, δ$0$]]): Free[[δ$1$]IndexedStateT[F, S, S2, δ$1$], A]

    Permalink
  25. def map[B](f: (A) ⇒ B)(implicit F: Functor[F]): IndexedStateT[F, S1, S2, B]

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

    Permalink

    Alias for mapT

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

    Permalink

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

  28. def mapsf[X1, X2, B](f: ((S1) ⇒ F[(S2, A)]) ⇒ (X1) ⇒ F[(X2, B)]): IndexedStateT[F, X1, X2, B]

    Permalink
  29. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  30. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  31. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  32. def run(initial: S1)(implicit F: Monad[F]): F[(S2, A)]

    Permalink

    An alias for apply

  33. def runZero[S <: S1](implicit S: Monoid[S], F: Monad[F]): F[(S2, A)]

    Permalink

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

  34. def rwst[W, R](implicit F: Monad[F], W: Monoid[W]): IndexedReaderWriterStateT[F, R, W, S1, S2, A]

    Permalink
  35. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  36. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  37. 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]

    Permalink
  38. 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]

    Permalink
  39. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. def xmap[X1, X2](f: (S2) ⇒ X1)(g: (X2) ⇒ S1): IndexedStateT[F, X2, X1, A]

    Permalink
  43. def zoom[S0, S3, S <: S1](l: LensFamily[S0, S3, S, S2])(implicit F: Functor[F]): IndexedStateT[F, S0, S3, A]

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped