CallbackTo

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply[A](f: ⇒ A): CallbackTo[A]

final def asInstanceOf[T0]: T0

def byName[A](f: ⇒ CallbackTo[A]): CallbackTo[A]

Callback that is recreated each time it is used.

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def future[A](f: ⇒ Future[CallbackTo[A]])(implicit ec: ExecutionContext): CallbackTo[Future[A]]

Wraps a Future so that it is repeatable, and so that its inner callback is run when the future completes.

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lazily[A](f: ⇒ CallbackTo[A]): CallbackTo[A]

Callback that isn't created until the first time it is used, after which it is reused.

def lift[A](f: () ⇒ A): CallbackTo[A]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pure[A](a: A): CallbackTo[A]

def sequence[T[X] <: TraversableOnce[X], A](tca: ⇒ T[CallbackTo[A]])(implicit cbf: CanBuildFrom[T[CallbackTo[A]], A, T[A]]): CallbackTo[T[A]]

def sequenceO[A](oca: ⇒ Option[CallbackTo[A]]): CallbackTo[Option[A]]

final def synchronized[T0](arg0: ⇒ T0): T0

def tailrec[A, B](a: A)(f: (A) ⇒ CallbackTo[Either[A, B]]): CallbackTo[B]

Tail-recursive callback.

def toString(): String

def traverse[T[X] <: TraversableOnce[X], A, B](ta: ⇒ T[A])(f: (A) ⇒ CallbackTo[B])(implicit cbf: CanBuildFrom[T[A], B, T[B]]): CallbackTo[T[B]]

def traverseO[A, B](oa: ⇒ Option[A])(f: (A) ⇒ CallbackTo[B]): CallbackTo[Option[B]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def TODO[A](result: ⇒ A, reason: ⇒ String): CallbackTo[A]

Serves as a temporary placeholder for a callback until you supply a real implementation.

def TODO[A](result: ⇒ A): CallbackTo[A]

Serves as a temporary placeholder for a callback until you supply a real implementation.