Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
implicit
def
ContsTBind[W[_], M[_], R](implicit W0: Cobind[W]): Bind[[δ$11$]IndexedContsT[W, M, R, R, δ$11$]]
-
implicit
def
ContsTMonad[W[_], M[_], R](implicit W0: Comonad[W]): Monad[[δ$12$]IndexedContsT[W, M, R, R, δ$12$]]
-
implicit
def
ContsTMonadPlus[W[_], M[_], R](implicit W0: Comonad[W], M0: PlusEmpty[M]): MonadPlus[[δ$17$]IndexedContsT[W, M, R, R, δ$17$]]
-
implicit
def
IndexedContsTBifunctor[W[_], M[_], O](implicit W0: Functor[W], M0: Functor[M]): Bifunctor[[γ$15$, ε$16$]IndexedContsT[W, M, γ$15$, O, ε$16$]]
-
implicit
def
IndexedContsTContravariant[W[_], M[_], R, A](implicit W0: Functor[W], M0: Functor[M]): Contravariant[[δ$14$]IndexedContsT[W, M, R, δ$14$, A]]
-
implicit
def
IndexedContsTFunctorLeft[W[_], M[_], O, A](implicit M0: Functor[M]): Functor[[γ$13$]IndexedContsT[W, M, γ$13$, O, A]]
-
implicit
def
IndexedContsTFunctorRight[W[_], M[_], R, O](implicit W0: Functor[W]): Functor[[ε$10$]IndexedContsT[W, M, R, O, ε$10$]]
-
def
apply[W[_], R, O, A](f: (W[(A) ⇒ O]) ⇒ R): IndexedConts[W, R, O, A]
-
final
def
asInstanceOf[T0]: T0
-
def
callCC[W[_], M[_], R, O, A, B](f: ((A) ⇒ IndexedContsT[W, M, O, O, B]) ⇒ IndexedContsT[W, M, R, O, A])(implicit W: Comonad[W]): IndexedContsT[W, M, R, O, A]
-
def
clone(): AnyRef
-
def
contracohoist[W[_], V[_], M[_], R, O](f: ~>[V, W]): ~>[[ε$5$]IndexedContsT[W, M, R, O, ε$5$], [ε$6$]IndexedContsT[V, M, R, O, ε$6$]]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
liftM[W[_], M[_], R, A](a: ⇒ M[A])(implicit W: Comonad[W], M: Bind[M]): ContsT[W, M, R, A]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
point[W[_], M[_], R, A](a: ⇒ A)(implicit W: Comonad[W]): ContsT[W, M, R, A]
-
def
reset[W[_], M[_], R, O, A](v: IndexedContsT[W, M, A, O, O])(implicit W: Comonad[W], WA: Applicative[W], M: Monad[M]): IndexedContsT[W, M, R, R, A]
-
def
shift[W[_], M[_], I, R, J, O, A](f: ((A) ⇒ IndexedContsT[W, M, I, I, O]) ⇒ IndexedContsT[W, M, R, J, J])(implicit W: Comonad[W], WA: Applicative[W], M: Monad[M]): IndexedContsT[W, M, R, O, A]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
xhoist[W[_], M[_], N[_], R, O](f: ~>[M, N], g: ~>[N, M])(implicit W: Functor[W]): ~>[[ε$0$]IndexedContsT[W, M, R, O, ε$0$], [ε$1$]IndexedContsT[W, N, R, O, ε$1$]]
