InlineMacros

abstract val c: Context

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def inlineAndReset[A](tree: scala.reflect.macros.Universe.Tree): scala.reflect.macros.whitebox.Context.Expr[A]

def inlineAndResetTree(tree: scala.reflect.macros.Universe.Tree): scala.reflect.macros.Universe.Tree

def inlineApplyRecursive(tree: scala.reflect.macros.Universe.Tree): scala.reflect.macros.Universe.Tree

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def resetTree(tree: scala.reflect.macros.Universe.Tree): scala.reflect.macros.Universe.Tree

def stripUnApplyNodes(): scala.reflect.macros.Universe.Transformer

Creates a macro transformer than gets rid of implicit unapply in case statements.

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