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[_], 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]): ~>[[ε$4$]IndexedContsT[W, M, R, O, ε$4$], [ε$5$]IndexedContsT[V, M, R, O, ε$5$]]
-
def
empty[W[_], M[_], R, A](implicit M: PlusEmpty[M]): ContsT[W, M, R, A]
-
-
-
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$]]
