PreserveSubPatBinders

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

abstract def extraStoredBinders: Set[Symbol]

abstract val ignoredSubPatBinders: Set[Symbol]

abstract def pos: Position

abstract val subPatBinders: List[Symbol]

abstract val subPatRefs: List[ast.tpd.Tree]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def bindSubPats(in: ast.tpd.Tree): ast.tpd.Tree

def clone(): AnyRef

def emitVars: Boolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

lazy val introducedRebindings: Rebindings

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def rebindings: Rebindings

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)

def stored: Traversable[(Symbol, ast.tpd.Tree)]

lazy val storedBinders: Set[Symbol]

lazy val storedSubsted: (Traversable[(Symbol, ast.tpd.Tree)], Traversable[(Symbol, ast.tpd.Tree)])

def subPatternsAsRebindings: Rebindings

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

def substed: Traversable[(Symbol, ast.tpd.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