TypeTestTreeMaker

implements the run-time aspects of (§8.2) (typedPattern has already done the necessary type transformations)

Type patterns consist of types, type variables, and wildcards. A type pattern T is of one of the following forms:

A reference to a class C, p.C, or T#C. This type pattern matches any non-null instance of the given class. Note that the prefix of the class, if it is given, is relevant for determining class instances. For instance, the pattern p.C matches only instances of classes C which were created with the path p as prefix. The bottom types scala.Nothing and scala.Null cannot be used as type patterns, because they would match nothing in any case.
A singleton type p.type. This type pattern matches only the value denoted by the path p (that is, a pattern match involved a comparison of the matched value with p using method eq in class AnyRef). // TODO: the actual pattern matcher uses ==, so that's what I'm using for now // https://issues.scala-lang.org/browse/SI-4577 "pattern matcher, still disappointing us at equality time"
A compound type pattern T1 with ... with Tn where each Ti is a type pat- tern. This type pattern matches all values that are matched by each of the type patterns Ti.
A parameterized type pattern T[a1,...,an], where the ai are type variable patterns or wildcards _. This type pattern matches all values which match T for some arbitrary instantiation of the type variables and wildcards. The bounds or alias type of these type variable are determined as described in (§8.3).
A parameterized type pattern scala.Array[T1], where T1 is a type pattern. // TODO This type pattern matches any non-null instance of type scala.Array[U1], where U1 is a type matched by T1.

Linear Supertypes

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

Instance Constructors

new TypeTestTreeMaker(afterTest: Symbol, testedBinder: Symbol, expectedTp: Type, nextBinderTp: Type)(pos: Position, extractorArgTypeTest: Boolean = false)

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
val afterTest: Symbol
final def asInstanceOf[T0]: T0

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

Definition Classes
CondTreeMaker → TreeMaker
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val cond: Result

Definition Classes
TypeTestTreeMaker → CondTreeMaker
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
val expectedTp: Type
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def impliesBinderNonNull(binder: Symbol): Boolean
lazy val introducedRebindings: NoRebindings.type

Definition Classes
TypeTestTreeMaker → CondTreeMaker → TreeMaker
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def needsOuterTest(patType: Type, selType: Type, currentOwner: Symbol): Boolean
val nextBinder: TermSymbol

Definition Classes
TypeTestTreeMaker → CondTreeMaker → FunTreeMaker
val nextBinderTp: Type

Definition Classes
TypeTestTreeMaker → CondTreeMaker
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def outerTestNeeded: Boolean
val pos: Position

Definition Classes
TypeTestTreeMaker → FunTreeMaker → TreeMaker
val prevBinder: Symbol

Definition Classes
TypeTestTreeMaker → CondTreeMaker
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 renderCondition(cs: TypeTestCondStrategy): Result
val res: ast.tpd.Tree

Definition Classes
TypeTestTreeMaker → CondTreeMaker
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.
Should not be used to perform actual substitution! Only used to reason symbolically about the values the subpattern binders are bound to. See TreeMakerToCond#updateSubstitution.
Overridden in PreserveSubPatBinders to pretend it replaces the subpattern binders by subpattern refs (Even though we don't do so anymore -- see SI-5158, SI-5739 and SI-6070.)
TODO: clean this up, would be nicer to have some higher-level way to compute the binders bound by this tree maker and the symbolic values that correspond to them

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

Definition Classes
AnyRef
val testedBinder: Symbol
def toString(): String

Definition Classes
TypeTestTreeMaker → 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 Docs: object TypeTestTreeMaker | package TreeMakers

case class TypeTestTreeMaker(afterTest: Symbol, testedBinder: Symbol, expectedTp: Type, nextBinderTp: Type)(pos: Position, extractorArgTypeTest: Boolean = false) extends CondTreeMaker with Product with Serializable

Instance Constructors

new TypeTestTreeMaker(afterTest: Symbol, testedBinder: Symbol, expectedTp: Type, nextBinderTp: Type)(pos: Position, extractorArgTypeTest: Boolean = false)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val afterTest: Symbol

final def asInstanceOf[T0]: T0

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

def clone(): AnyRef

val cond: Result

final def eq(arg0: AnyRef): Boolean

val expectedTp: Type

def finalize(): Unit

final def getClass(): Class[_]

def impliesBinderNonNull(binder: Symbol): Boolean

lazy val introducedRebindings: NoRebindings.type

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

def needsOuterTest(patType: Type, selType: Type, currentOwner: Symbol): Boolean

val nextBinder: TermSymbol

val nextBinderTp: Type

final def notify(): Unit

final def notifyAll(): Unit

def outerTestNeeded: Boolean

val pos: Position

val prevBinder: Symbol

def rebindings: Rebindings

def renderCondition(cs: TypeTestCondStrategy): Result

val res: ast.tpd.Tree

def subPatternsAsRebindings: Rebindings

final def synchronized[T0](arg0: ⇒ T0): T0

val testedBinder: Symbol

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 CondTreeMaker

Inherited from FunTreeMaker

Inherited from TreeMaker

Inherited from AnyRef

Inherited from Any

Ungrouped