type ContsT[W[_], R, M[_], A] = IndexedContsT[W, R, R, M, A]
Value Members
- final def !=(arg0: Any): Boolean
- final def ##(): Int
- final def ==(arg0: Any): Boolean
- val _run: (W[(A) ⇒ M[O]]) ⇒ M[R]
- def apply(wamo: W[(A) ⇒ M[O]]): M[R]
- final def asInstanceOf[T0]: T0
- def bimap[E, B](f: (R) ⇒ E, g: (A) ⇒ B)(implicit M: Functor[M], W: Functor[W]): IndexedContsT[W, E, O, M, B]
- def bmap[X >: R <: O, Z](f: Bijection[X, Z])(implicit M: Functor[M], W: Functor[W]): ContsT[W, Z, M, A]
- def clone(): AnyRef
- def contramap[I](f: (I) ⇒ O)(implicit M: Functor[M], W: Functor[W]): IndexedContsT[W, R, I, M, A]
- final def eq(arg0: AnyRef): Boolean
- def finalize(): Unit
- def flatMap[E, B](f: (A) ⇒ IndexedContsT[W, O, E, M, B])(implicit W: Cobind[W]): IndexedContsT[W, R, E, M, B]
- def flatten[E, B](implicit ev: ===[A, IndexedContsT[W, O, E, M, B]], W: Cobind[W]): IndexedContsT[W, R, E, M, B]
- final def getClass(): Class[_]
- def imap[E](f: (R) ⇒ E)(implicit M: Functor[M]): IndexedContsT[W, E, O, M, A]
- final def isInstanceOf[T0]: Boolean
- def map[B](f: (A) ⇒ B)(implicit W: Functor[W]): IndexedContsT[W, R, O, M, B]
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def plus(that: IndexedContsT[W, R, O, M, A])(implicit M: Plus[M]): IndexedContsT[W, R, O, M, A]
- def run(wamo: W[(A) ⇒ M[O]]): M[R]
- def run_(implicit W: Applicative[W], M: Applicative[M], ev: ===[A, O]): M[R]
- final def synchronized[T0](arg0: ⇒ T0): T0
- final def wait(): Unit
- final def wait(arg0: Long, arg1: Int): Unit
- final def wait(arg0: Long): Unit
- def xmap[E, I](f: (R) ⇒ E, g: (I) ⇒ O)(implicit M: Functor[M], W: Functor[W]): IndexedContsT[W, E, I, M, A]