Instance Constructors
-
new
Macros(c: Context)
Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
val
c: Context
-
def
clone(): AnyRef
-
-
-
def
executeAsync(cb: Tree): Tree
-
def
executeLocal(cb: Tree): Tree
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
inlineAndReset[T](tree: Tree): macrocompat.CompatContext.Expr[T]
-
def
inlineAndResetTree(tree: Tree): macrocompat.CompatContext.Tree
-
def
inlineApplyRecursive(tree: Tree): Tree
-
final
def
isInstanceOf[T0]: Boolean
-
def
isSynchronous[Self <: Future[Ack]](implicit arg0: macrocompat.CompatContext.WeakTypeTag[Self]): macrocompat.CompatContext.Expr[Boolean]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
syncFlatMap[Self <: Future[Ack]](f: macrocompat.CompatContext.Expr[(Ack) ⇒ Future[Ack]])(s: macrocompat.CompatContext.Expr[Scheduler])(implicit arg0: macrocompat.CompatContext.WeakTypeTag[Self]): macrocompat.CompatContext.Expr[Future[Ack]]
-
def
syncMap[Self <: Future[Ack]](f: macrocompat.CompatContext.Expr[(Ack) ⇒ Ack])(s: macrocompat.CompatContext.Expr[Scheduler])(implicit arg0: macrocompat.CompatContext.WeakTypeTag[Self]): macrocompat.CompatContext.Expr[Future[Ack]]
-
def
syncOnComplete[Self <: Future[Ack]](f: macrocompat.CompatContext.Expr[(Try[Ack]) ⇒ Unit])(s: macrocompat.CompatContext.Expr[Scheduler])(implicit arg0: macrocompat.CompatContext.WeakTypeTag[Self]): macrocompat.CompatContext.Expr[Unit]
-
def
syncOnContinue[Self <: Future[Ack]](callback: Tree)(s: Tree)(implicit arg0: macrocompat.CompatContext.WeakTypeTag[Self]): Tree
-
def
syncOnStopOrFailure[Self <: Future[Ack]](callback: Tree)(s: Tree)(implicit arg0: macrocompat.CompatContext.WeakTypeTag[Self]): Tree
-
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
Various implementations for AckExtensions and Scheduler.