PIndexedStateT

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
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()
final def asInstanceOf[T0]: T0

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

Definition Classes
IndexedStateT
def bmap[X, S](b: Bijection[S, X])(implicit F: Applicative[F], S1: <~<[S, S1], S2: >~>[S, S2]): StateT[X, F, A]

Definition Classes
IndexedStateT
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def contramap[X](g: (X) ⇒ S1)(implicit F: Applicative[F]): IndexedStateT[X, S2, F, 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: 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
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
def evalZero(implicit F: Bind[F], S1: Monoid[S1]): 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
def evalZeroRec(implicit F: BindRec[F], S1: Monoid[S1]): 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
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
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
def execZero(implicit F: Bind[F], S1: Monoid[S1]): 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
def execZeroRec(implicit F: BindRec[F], S1: Monoid[S1]): 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
def finalize(): Unit

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

Definition Classes
IndexedStateT
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

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

Definition Classes
IndexedStateT
final def isInstanceOf[T0]: Boolean

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

Definition Classes
IndexedStateT
def lift[M[_]](implicit F: Bind[F], M: Applicative[M]): IndexedStateT[S1, S2, [α]M[F[α]], A]

Definition Classes
IndexedStateT
def liftF: Free[[δ$0$]IndexedStateT[S1, S2, F, δ$0$], A]

Definition Classes
IndexedStateT
def map[B](f: (A) ⇒ B)(implicit F: Applicative[F]): IndexedStateT[S1, S2, F, B]

Definition Classes
IndexedStateT
def mapK[G[_], B, S](f: (F[(S2, A)]) ⇒ G[(S, B)])(implicit M: Monad[F]): IndexedStateT[S1, S, G, 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[S1, S, G, 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
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def run(initial: S1)(implicit F: Bind[F]): F[(S2, A)]

An alias for apply
An alias for apply

Definition Classes
IndexedStateT
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
def runZero(implicit S1: Monoid[S1], 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
def runZeroRec(implicit S1: Monoid[S1], 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
def rwst[W, R](implicit F: Bind[F], W: Monoid[W]): IndexedReaderWriterStateT[R, W, S1, S2, F, 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: Bind[[α]M[FF[α]]], ev: <~<[IndexedStateT.this.type, IndexedStateT[S, S2, [α]M[FF[α]], A]]): IndexedStateT[S, S2, FF, A]

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

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
@throws( ... )
def xmap[X1, X2](f: (S2) ⇒ X1)(g: (X2) ⇒ S1)(implicit F: Applicative[F]): IndexedStateT[X2, X1, F, A]

Definition Classes
IndexedStateT
def zoom[S0, S3, S <: S1](l: LensFamily[S0, S3, S, S2])(implicit F: Applicative[F]): IndexedStateT[S0, S3, F, A]

Definition Classes
IndexedStateT

Related Doc: package scalaz

type PIndexedStateT[F[_], S1, S2, A] = IndexedStateT[S1, S2, F, Option[A]]

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def apply(initial: S1)(implicit F: Bind[F]): F[(S2, A)]

final def asInstanceOf[T0]: T0

def bimap[X, B](f: (S2) ⇒ X)(g: (A) ⇒ B)(implicit F: Applicative[F]): IndexedStateT[S1, X, F, B]

def bmap[X, S](b: Bijection[S, X])(implicit F: Applicative[F], S1: <~<[S, S1], S2: >~>[S, S2]): StateT[X, F, A]

def clone(): AnyRef

def contramap[X](g: (X) ⇒ S1)(implicit F: Applicative[F]): IndexedStateT[X, S2, F, A]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def eval(initial: S1)(implicit F: Bind[F]): F[A]

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

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

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

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

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

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

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

def finalize(): Unit

def flatMap[S3, B](f: (A) ⇒ IndexedStateT[S2, S3, F, B]): IndexedStateT[S1, S3, F, B]

final def getClass(): Class[_]

def hashCode(): Int

def imap[X](f: (S2) ⇒ X)(implicit F: Applicative[F]): IndexedStateT[S1, X, F, A]

final def isInstanceOf[T0]: Boolean

def leftMap[X](f: (S2) ⇒ X)(implicit F: Applicative[F]): IndexedStateT[S1, X, F, A]

def lift[M[_]](implicit F: Bind[F], M: Applicative[M]): IndexedStateT[S1, S2, [α]M[F[α]], A]

def liftF: Free[[δ$0$]IndexedStateT[S1, S2, F, δ$0$], A]

def map[B](f: (A) ⇒ B)(implicit F: Applicative[F]): IndexedStateT[S1, S2, F, B]

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

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def run(initial: S1)(implicit F: Bind[F]): F[(S2, A)]

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

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

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

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

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

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]

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]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def xmap[X1, X2](f: (S2) ⇒ X1)(g: (X2) ⇒ S1)(implicit F: Applicative[F]): IndexedStateT[X2, X1, F, A]

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