class CalcMOps[+F[+_, +_], -R, -SI, +SO, +E, +A] extends AnyRef
Ordering
- Alphabetic
- By Inheritance
Inherited
- CalcMOps
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new CalcMOps()
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def !>>[F1[+x, +y] >: F[x, y], R1 <: R, E1, S3, B](r: ⇒ CalcM[F1, R1, SO, S3, E1, B])(implicit ev: <:<[A, Nothing]): CalcM[F1, R1, SI, S3, E1, B]
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
- def *>>[F1[+x, +y] >: F[x, y], R1 <: R, S, B, E1](r: ⇒ CalcM[F1, R1, SO, S, E1, B])(implicit ev: <:<[E, Nothing]): CalcM[F1, R1, SI, S, E1, B]
- def <<[F1[+x, +y] >: F[x, y], R1 <: R, E1 >: E, SO1 >: SO, B](c: ⇒ CalcM[F1, R1, SO, SO1, E1, B]): CalcM[F1, R1, SI, SO1, E1, A]
- def <<![F1[+x, +y] >: F[x, y], R1 <: R, E1, S3, B](r: ⇒ CalcM[F1, R1, SO, S3, E1, B])(implicit ev: <:<[A, Nothing]): CalcM[F1, R1, SI, S3, E, B]
- def <<*[F1[+x, +y] >: F[x, y], R1 <: R, S, B, E1](r: ⇒ CalcM[F1, R1, SO, S, E1, B])(implicit ev: <:<[E, Nothing]): CalcM[F1, R1, SI, S, E1, A]
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def >>[F1[+x, +y] >: F[x, y], R1 <: R, E1 >: E, SO1 >: SO, B](c: ⇒ CalcM[F1, R1, SO, SO1, E1, B]): CalcM[[+x, +y]F1[x, y], R1, SI, SO1, E1, B]
- def >>=[F1[+x, +y] >: F[x, y], R1 <: R, E1 >: E, SO1 >: SO, B](f: (A) ⇒ CalcM[F1, R1, SO, SO1, E1, B]): CalcM[[+x, +y]F1[x, y], R1, SI, SO1, E1, B]
- def as[B](b: ⇒ B): CalcM[F, R, SI, SO, E, B]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- def as_[B](b: B): CalcM[F, R, SI, SO, E, B]
- def biflatten[F1[+x, +y] >: F[x, y], R1 <: R, S, X, B](implicit evA: <:<[A, CalcM[F1, R1, SO, S, X, B]], evE: <:<[E, CalcM[F1, R1, SO, S, X, B]]): CalcM[F1, R1, SI, S, X, B]
- def bind[F1[+x, +y] >: F[x, y], R1 <: R, X, S, B](continue: Continue[A, E, SO, CalcM[F1, R1, SO, S, X, B]]): CalcM[F1, R1, SI, S, X, B]
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
- def contramapState[SI1](f: (SI1) ⇒ SI): CalcM[F, R, SI1, SO, E, A]
- def dimapState[SI1, SO1](f: (SI1) ⇒ SI, g: (SO) ⇒ SO1): CalcM[F, R, SI1, SO1, E, A]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def errorAs[X](e: ⇒ X): CalcM[F, R, SI, SO, X, A]
- def errorAs_[X](b: X): CalcM[F, R, SI, SO, X, A]
- def flatMap[F1[+x, +y] >: F[x, y], R1 <: R, SO1 >: SO, E1 >: E, B](f: (A) ⇒ CalcM[F1, R1, SO, SO1, E1, B]): CalcM[F1, R1, SI, SO1, E1, B]
- final def flatMapS[F1[+x, +y] >: F[x, y], R1 <: R, S, E1, B](f: (A) ⇒ CalcM[F1, R1, SO, S, E1, B])(implicit ev: <:<[E, Nothing]): CalcM[F1, R1, SI, S, E1, B]
- def flatTap[F1[+x, +y] >: F[x, y], R1 <: R, SO1 >: SO, E1 >: E, B](f: (A) ⇒ CalcM[F1, R1, SO, SO1, E1, B]): CalcM[F1, R1, SI, SO1, E1, A]
- final def flatTapS[F1[+x, +y] >: F[x, y], R1 <: R, S, E1, B](f: (A) ⇒ CalcM[F1, R1, SO, S, E1, B])(implicit ev: <:<[E, Nothing]): CalcM[F1, R1, SI, S, E1, A]
- def focus[S3, S4](lens: PContains[S3, S4, SI, SO]): CalcM[F, R, S3, S4, E, A]
- def focusFirst[S]: CalcM[F, R, (SI, S), (SO, S), E, A]
- def focusSecond[S]: CalcM[F, R, (S, SI), (S, SO), E, A]
- def foldWith[F1[+x, +y] >: F[x, y], R1 <: R, X, S, B](f: (A) ⇒ CalcM[F1, R1, SO, S, X, B], h: (E) ⇒ CalcM[F1, R1, SO, S, X, B]): CalcM[F1, R1, SI, S, X, B]
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- def handle[A1 >: A](f: (E) ⇒ A1): CalcM[F, R, SI, SO, E, A1]
- def handleWith[F1[+x, +y] >: F[x, y], E1, R1 <: R, SO1 >: SO, A1 >: A](f: (E) ⇒ CalcM[F1, R1, SO, SO1, E1, A1]): CalcM[F1, R1, SI, SO1, E1, A1]
- def handleWithU[F1[+x, +y] >: F[x, y], R1 <: R, E1, S3, B](f: (E) ⇒ CalcM[F1, R1, SO, S3, E1, B])(implicit ev: <:<[A, Nothing]): CalcM[F1, R1, SI, S3, E1, B]
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def local[R1](f: (R1) ⇒ R): CalcM[F, R1, SI, SO, E, A]
- def map[B](f: (A) ⇒ B): CalcM[F, R, SI, SO, E, B]
- def mapError[E1](f: (E) ⇒ E1): CalcM[F, R, SI, SO, E1, A]
- def mapK[G[+_, +_]](fk: FunBK[F, G]): CalcM[G, R, SI, SO, E, A]
- def mapState[SO1](f: (SO) ⇒ SO1): CalcM[F, R, SI, SO1, E, A]
- def narrowRead[R1 <: R]: CalcM[F, R1, SI, SO, E, A]
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def onErrorU[F1[+x, +y] >: F[x, y], R1 <: R, E1, S3, B](f: (E) ⇒ CalcM[F1, R1, SO, S3, E1, B])(implicit ev: <:<[A, Nothing]): CalcM[F1, R1, SI, S3, E, B]
- final def productLS[F1[+x, +y] >: F[x, y], R1 <: R, S, B, E1](r: ⇒ CalcM[F1, R1, SO, S, E1, B])(implicit ev: <:<[E, Nothing]): CalcM[F1, R1, SI, S, E1, A]
- final def productRS[F1[+x, +y] >: F[x, y], R1 <: R, S, B, E1](r: ⇒ CalcM[F1, R1, SO, S, E1, B])(implicit ev: <:<[E, Nothing]): CalcM[F1, R1, SI, S, E1, B]
- def provide(r: R): CalcM[F, Any, SI, SO, E, A]
- def provideSet(r: R, s: SI): CalcM[F, Any, Any, SO, E, A]
- def provideSome[R1](f: (R1) ⇒ R): CalcM[F, R1, SI, SO, E, A]
- def result(implicit runner: CalcRunner[F], evr: <:<[Unit, R], evs: <:<[Unit, SI]): Either[E, A]
- def results(implicit runner: CalcRunner[F], evr: <:<[Unit, R], evs: <:<[Unit, SI]): (SO, Either[E, A])
- def run(r: R, init: SI)(implicit runner: CalcRunner[F]): (SO, Either[E, A])
- def runSuccess(r: R, init: SI)(implicit runner: CalcRunner[F], ev: <:<[E, Nothing]): (SO, A)
- def runSuccessUnit(init: SI)(implicit runner: CalcRunner[F], ev: <:<[E, Nothing], evr: <:<[Unit, R]): (SO, A)
- def runTailRec[F1[+x, +y] >: F[x, y]](r: R, init: SI)(implicit F: Bind[F1]): F1[(SO, E), (SO, A)]
- def runTailRecSingle[F1[+y] >: F[Any, y], E1 >: E](r: R, init: SI)(implicit F: Monad[F1], ev: <:<[E1, Nothing]): F1[(SO, A)]
- def runUnit(init: SI)(implicit runner: CalcRunner[F], evr: <:<[Unit, R]): (SO, Either[E, A])
- def step(r: R, init: SI): StepResult[F, SO, E, A]
- def stepUnit(init: SI)(implicit ev: <:<[Unit, R]): StepResult[F, SO, E, A]
- def supply(si: ⇒ SI): CalcM[F, R, Any, SO, E, A]
- def swap: CalcM[F, R, SI, SO, A, E]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- def tailrecEither[F1[+y] >: F[Any, y]](r: R, init: SI)(implicit F: Monad[F1]): F1[(SO, Either[E, A])]
- def toState[SI1 <: SI, SO1 >: SO, A1 >: A](implicit runner: CalcRunner[F], ev: <:<[E, Nothing], evr: <:<[Unit, R]): IndexedState[SI1, SO1, A1]
-
def
toString(): String
- Definition Classes
- AnyRef → Any
- def trans: TranslatePack[F, R, SI, SO, E, A]
- def translateForget[G[+_, +_], ST, R1](translator: Translator[F, G, ST, R, R1])(implicit evs: <:<[Unit, SI]): CalcM[G, R1, ST, ST, E, A]
- def value(implicit runner: CalcRunner[F], evr: <:<[Unit, R], evs: <:<[Unit, SI], ev: <:<[E, Nothing]): A
- def values(implicit runner: CalcRunner[F], evr: <:<[Unit, R], evs: <:<[Unit, SI], ev: <:<[E, Nothing]): (SO, A)
- def void: CalcM[F, R, SI, SO, E, Unit]
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def when[S >: SO <: SI](b: Boolean): CalcM[F, R, S, S, E, Any]
- def widenF[F1[+x, +y] >: F[x, y]]: CalcM[F1, R, SI, SO, E, A]
Deprecated Value Members
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated
- Deprecated