trait IndexedContsTFunctions extends AnyRef
Value Members
- final def !=(arg0: Any): Boolean
- final def ##: Int
- final def ==(arg0: Any): Boolean
- final def asInstanceOf[T0]: T0
- def callCC[W[_], R, O, M[_], A, B](f: ((A) => IndexedContsT[W, O, O, M, B]) => IndexedContsT[W, R, O, M, A])(implicit W: Comonad[W]): IndexedContsT[W, R, O, M, A]
- def clone(): AnyRef
- def contracohoist[W[_], V[_], R, O, M[_]](f: ~>[V, W]): ~>[[ε$4$]IndexedContsT[W, R, O, M, ε$4$], [ε$5$]IndexedContsT[V, R, O, M, ε$5$]]
- def empty[W[_], R, M[_], A](implicit M: PlusEmpty[M]): ContsT[W, R, M, A]
- final def eq(arg0: AnyRef): Boolean
- def equals(arg0: AnyRef): Boolean
- def finalize(): Unit
- final def getClass(): Class[_ <: AnyRef]
- def hashCode(): Int
- final def isInstanceOf[T0]: Boolean
- def liftM[W[_], R, M[_], A](a: => M[A])(implicit W: Comonad[W], M: Bind[M]): ContsT[W, R, M, A]
- final def ne(arg0: AnyRef): Boolean
- final def notify(): Unit
- final def notifyAll(): Unit
- def point[W[_], R, M[_], A](a: => A)(implicit W: Comonad[W]): ContsT[W, R, M, A]
- def reset[W[_], R, O, M[_], A](v: IndexedContsT[W, A, O, M, O])(implicit W: Comonad[W], WA: Applicative[W], M: Monad[M]): IndexedContsT[W, R, R, M, A]
- def shift[W[_], I, R, J, O, M[_], A](f: ((A) => IndexedContsT[W, I, I, M, O]) => IndexedContsT[W, R, J, M, J])(implicit W: Comonad[W], WA: Applicative[W], M: Monad[M]): IndexedContsT[W, R, O, M, 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[_], R, O, M[_], N[_]](f: ~>[M, N], g: ~>[N, M])(implicit W: Functor[W]): ~>[[ε$0$]IndexedContsT[W, R, O, M, ε$0$], [ε$1$]IndexedContsT[W, R, O, N, ε$1$]]