ProductExtractorTreeMaker

An optimized version of ExtractorTreeMaker for Products. For now, this is hard-coded to case classes, and we simply extract the case class fields.

The values for the subpatterns, as specified by the case class fields at the time of extraction, are stored in local variables that re-use the symbols in subPatBinders. This makes extractor patterns more debuggable (SI-5739) as well as avoiding mutation after the pattern has been matched (SI-5158, SI-6070)

TODO: make this user-definable as follows When a companion object defines a method def unapply_1(x: T): U_1, but no def unapply or def unapplySeq, the extractor is considered to match any non-null value of type T the pattern is expected to have as many sub-patterns as there are def unapply_I(x: T): U_I methods, and the type of the I'th sub-pattern is U_I. The same exception for Seq patterns applies: if the last extractor is of type Seq[U_N], the pattern must have at least N arguments (exactly N if the last argument is annotated with : _*). The arguments starting at N (and beyond) are taken from the sequence returned by apply_N, and it is checked that the sequence has enough elements to provide values for all expected sub-patterns.

For a case class C, the implementation is assumed to be def unapply_I(x: C) = x._I, and the extractor call is inlined under that assumption.

Linear Supertypes

Serializable, Serializable, Product, Equals, PreserveSubPatBinders, FunTreeMaker, TreeMaker, AnyRef, Any

Instance Constructors

new ProductExtractorTreeMaker(prevBinder: Symbol, extraCond: Option[ast.tpd.Tree])(subPatBinders: List[Symbol], subPatRefs: List[ast.tpd.Tree], mutableBinders: List[Symbol], binderKnownNonNull: Boolean, ignoredSubPatBinders: Set[Symbol])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def bindSubPats(in: ast.tpd.Tree): ast.tpd.Tree

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

Definition Classes
ProductExtractorTreeMaker → TreeMaker
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def emitVars: Boolean

Definition Classes
PreserveSubPatBinders
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
val extraCond: Option[ast.tpd.Tree]
def extraStoredBinders: Set[Symbol]

Definition Classes
ProductExtractorTreeMaker → PreserveSubPatBinders
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
val ignoredSubPatBinders: Set[Symbol]

Definition Classes
ProductExtractorTreeMaker → PreserveSubPatBinders
lazy val introducedRebindings: Rebindings

Attributes
protected
Definition Classes
PreserveSubPatBinders → TreeMaker
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val mutableBinders: List[Symbol]
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
val nextBinder: Symbol

Definition Classes
ProductExtractorTreeMaker → FunTreeMaker
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def pos: Position

Definition Classes
FunTreeMaker → TreeMaker
val prevBinder: Symbol
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)
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)

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

Definition Classes
PreserveSubPatBinders
lazy val storedBinders: Set[Symbol]

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

Definition Classes
PreserveSubPatBinders
val subPatBinders: List[Symbol]

Definition Classes
ProductExtractorTreeMaker → PreserveSubPatBinders
val subPatRefs: List[ast.tpd.Tree]

Definition Classes
ProductExtractorTreeMaker → PreserveSubPatBinders
def subPatternsAsRebindings: Rebindings

The substitution that specifies the trees that compute the values of the subpattern binders.
The substitution that specifies the trees that compute the values of the subpattern binders.
We pretend to replace the subpattern binders by subpattern refs (Even though we don't do so anymore -- see SI-5158, SI-5739 and SI-6070.)

Definition Classes
PreserveSubPatBinders → TreeMaker
def substed: Traversable[(Symbol, ast.tpd.Tree)]

Definition Classes
PreserveSubPatBinders
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
ProductExtractorTreeMaker → AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package TreeMakers

Instance Constructors

new ProductExtractorTreeMaker(prevBinder: Symbol, extraCond: Option[ast.tpd.Tree])(subPatBinders: List[Symbol], subPatRefs: List[ast.tpd.Tree], mutableBinders: List[Symbol], binderKnownNonNull: Boolean, ignoredSubPatBinders: Set[Symbol])

Value Members

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 chainBefore(next: ast.tpd.Tree)(casegen: TreeMakers.Casegen): ast.tpd.Tree

def clone(): AnyRef

def emitVars: Boolean

final def eq(arg0: AnyRef): Boolean

val extraCond: Option[ast.tpd.Tree]

def extraStoredBinders: Set[Symbol]

def finalize(): Unit

final def getClass(): Class[_]

val ignoredSubPatBinders: Set[Symbol]

lazy val introducedRebindings: Rebindings

final def isInstanceOf[T0]: Boolean

val mutableBinders: List[Symbol]

final def ne(arg0: AnyRef): Boolean

val nextBinder: Symbol

final def notify(): Unit

final def notifyAll(): Unit

def pos: Position

val prevBinder: Symbol

def rebindings: Rebindings

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)])

val subPatBinders: List[Symbol]

val subPatRefs: List[ast.tpd.Tree]

def subPatternsAsRebindings: Rebindings

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

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from PreserveSubPatBinders

Inherited from FunTreeMaker

Inherited from TreeMaker

Inherited from AnyRef

Inherited from Any

Ungrouped