CondTreeMaker

abstract val cond: ast.tpd.Tree

abstract val nextBinder: Symbol

abstract val nextBinderTp: Type

abstract val prevBinder: Symbol

abstract val res: ast.tpd.Tree

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

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

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

lazy val introducedRebindings: NoRebindings.type

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pos: Position

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 subPatternsAsRebindings: Rebindings

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

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