type
ContsT[W[_], M[_], R, A] = IndexedContsT[W, M, R, R, 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, M, E, O, B]
-
def
bmap[X >: R <: O, Z](f: Bijection[X, Z])(implicit M: Functor[M], W: Functor[W]): ContsT[W, M, Z, A]
-
def
clone(): AnyRef
-
def
contramap[I](f: (I) ⇒ O)(implicit M: Functor[M], W: Functor[W]): IndexedContsT[W, M, R, I, A]
-
-
def
finalize(): Unit
-
def
flatMap[E, B](f: (A) ⇒ IndexedContsT[W, M, O, E, B])(implicit W: Cobind[W]): IndexedContsT[W, M, R, E, B]
-
def
flatten[E, B](implicit ev: =:=[A, IndexedContsT[W, M, O, E, B]], W: Cobind[W]): IndexedContsT[W, M, R, E, B]
-
final
def
getClass(): Class[_]
-
def
imap[E](f: (R) ⇒ E)(implicit M: Functor[M]): IndexedContsT[W, M, E, O, A]
-
final
def
isInstanceOf[T0]: Boolean
-
def
map[B](f: (A) ⇒ B)(implicit W: Functor[W]): IndexedContsT[W, M, R, O, B]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
plus(that: IndexedContsT[W, M, R, O, A])(implicit M: Plus[M]): IndexedContsT[W, M, R, O, 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, M, E, I, A]
