NoNewBinders

abstract def chainBefore(next: Global.Tree)(casegen: TreeMakers.Casegen): Global.Tree

abstract def pos: Global.Position

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (NoNewBinders, B)

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def ensuring(cond: (NoNewBinders) ⇒ Boolean, msg: ⇒ Any): NoNewBinders

def ensuring(cond: (NoNewBinders) ⇒ Boolean): NoNewBinders

def ensuring(cond: Boolean, msg: ⇒ Any): NoNewBinders

def ensuring(cond: Boolean): NoNewBinders

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val localSubstitution: TreeMakers.Substitution

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def subPatternsAsSubstitution: TreeMakers.Substitution

The substitution that specifies the trees that compute the values of the subpattern binders.

def substitution: TreeMakers.Substitution

captures the scope and the value of the bindings in patterns important *when* the substitution happens (can't accumulate and do at once after the full matcher has been constructed)

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 →[B](y: B): (NoNewBinders, B)