CondTreeMaker

abstract val cond: Tree

abstract val nextBinderTp: Type

abstract val pos: Position

abstract val prevBinder: Symbol

abstract val res: Tree

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def chainBefore(next: Tree, pt: Type): 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

final def isInstanceOf[T0]: Boolean

lazy val localSubstitution: Substitution

final def ne(arg0: AnyRef): Boolean

lazy val nextBinder: TermSymbol

final def notify(): Unit

final def notifyAll(): Unit

def substitution: 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