trait TreeMakers extends TypedSubstitution with CodegenCore
- Alphabetic
- By Inheritance
- TreeMakers
- CodegenCore
- TypedSubstitution
- MatchMonadInterface
- AnyRef
- Any
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- All
Type Members
-
class
Substitution extends AnyRef
- Definition Classes
- TypedSubstitution
-
trait
AbsCodegen extends AnyRef
- Definition Classes
- CodegenCore
-
trait
Casegen extends AbsCodegen
- Definition Classes
- CodegenCore
-
abstract
class
CommonCodegen extends AbsCodegen
- Definition Classes
- CodegenCore
- case class AlternativesTreeMaker(prevBinder: Global.Symbol, altss: List[List[TreeMaker]], pos: Global.Position) extends TreeMaker with NoNewBinders with Product with Serializable
- case class BodyTreeMaker(body: Global.Tree, matchPt: Global.Type) extends TreeMaker with NoNewBinders with Product with Serializable
- sealed abstract class CondTreeMaker extends FunTreeMaker
- case class EqualityTestTreeMaker(prevBinder: Global.Symbol, patTree: Global.Tree, pos: Global.Position) extends CondTreeMaker with Product with Serializable
-
case class
ExtractorTreeMaker(extractor: Global.Tree, extraCond: Option[Global.Tree], nextBinder: Global.Symbol)(subPatBinders: List[Global.Symbol], subPatRefs: List[Global.Tree], potentiallyMutableBinders: Set[Global.Symbol], extractorReturnsBoolean: Boolean, checkedLength: Option[Int], prevBinder: Global.Symbol, ignoredSubPatBinders: Set[Global.Symbol]) extends FunTreeMaker with PreserveSubPatBinders with Product with Serializable
Make a TreeMaker that will result in an extractor call specified by
extractor
the next TreeMaker (here, we don't know which it'll be) is chained after this one by flatMap'ing a function with bindernextBinder
over our extractor's result the function's body is determined by the next TreeMaker (furthermore, the interpretation offlatMap
depends on the codegen instance we're using).Make a TreeMaker that will result in an extractor call specified by
extractor
the next TreeMaker (here, we don't know which it'll be) is chained after this one by flatMap'ing a function with bindernextBinder
over our extractor's result the function's body is determined by the next TreeMaker (furthermore, the interpretation offlatMap
depends on the codegen instance we're using).The values for the subpatterns, as computed by the extractor call in
extractor
, are stored in local variables that re-use the symbols insubPatBinders
. This makes extractor patterns more debuggable (scala/bug#5739). - sealed abstract class FunTreeMaker extends TreeMaker
- case class GuardTreeMaker(guardTree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable
- sealed trait NoNewBinders extends TreeMaker
- sealed trait PreserveSubPatBinders extends TreeMaker
-
case class
ProductExtractorTreeMaker(prevBinder: Global.Symbol, extraCond: Option[Global.Tree])(subPatBinders: List[Global.Symbol], subPatRefs: List[Global.Tree], mutableBinders: List[Global.Symbol], binderKnownNonNull: Boolean, ignoredSubPatBinders: Set[Global.Symbol]) extends FunTreeMaker with PreserveSubPatBinders with Product with Serializable
An optimized version of ExtractorTreeMaker for Products.
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 (scala/bug#5739) as well as avoiding mutation after the pattern has been matched (scala/bug#5158, scala/bug#6070)TODO: make this user-definable as follows When a companion object defines a method
def unapply_1(x: T): U_1
, but nodef unapply
ordef 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 aredef unapply_I(x: T): U_I
methods, and the type of the I'th sub-pattern isU_I
. The same exception for Seq patterns applies: if the last extractor is of typeSeq[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 that 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. - case class SubstOnlyTreeMaker(prevBinder: Global.Symbol, nextBinder: Global.Symbol) extends TreeMaker with Product with Serializable
- abstract class TreeMaker extends AnyRef
- case class TrivialTreeMaker(tree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable
-
case class
TypeTestTreeMaker(prevBinder: Global.Symbol, testedBinder: Global.Symbol, expectedTp: Global.Type, nextBinderTp: Global.Type)(pos: Global.Position, extractorArgTypeTest: Boolean = false) extends CondTreeMaker with Product with Serializable
implements the run-time aspects of (§8.2) (typedPattern has already done the necessary type transformations)
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://github.com/scala/bug/issues/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.
Abstract Value Members
- abstract def analyzeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type, suppression: Suppression): Unit
-
abstract
def
codegen: AbsCodegen
- Definition Classes
- CodegenCore
- abstract def optimizeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type): (List[List[TreeMaker]], List[Global.Tree])
-
abstract
val
typer: (analyzer)#Typer
- Definition Classes
- MatchMonadInterface
Concrete Value Members
-
object
EmptySubstitution extends Substitution
- Definition Classes
- TypedSubstitution
-
object
Substitution
- Definition Classes
- TypedSubstitution
- def combineCases(scrut: Global.Tree, scrutSym: Global.Symbol, casesRaw: List[List[TreeMaker]], pt: Global.Type, owner: Global.Symbol, matchFailGenOverride: Option[(Global.Tree) ⇒ Global.Tree]): Global.Tree
- def combineCasesNoSubstOnly(scrut: Global.Tree, scrutSym: Global.Symbol, casesNoSubstOnly: List[List[TreeMaker]], pt: Global.Type, owner: Global.Symbol, matchFailGenOverride: Option[(Global.Tree) ⇒ Global.Tree]): Global.Tree
- def combineExtractors(treeMakers: List[TreeMaker])(casegen: Casegen): Global.Tree
- def emitSwitch(scrut: Global.Tree, scrutSym: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type, matchFailGenOverride: Option[(Global.Tree) ⇒ Global.Tree], unchecked: Boolean): Option[Global.Tree]
- def emitTypeSwitch(bindersAndCases: List[(Global.Symbol, List[TreeMaker])], pt: Global.Type): Option[List[Global.CaseDef]]
-
def
freshName(prefix: String): Global.TermName
- Definition Classes
- CodegenCore
-
def
freshSym(pos: Global.Position, tp: Global.Type = NoType, prefix: String = "x"): Global.TermSymbol
- Definition Classes
- CodegenCore
-
val
matchOwner: Global.Symbol
- Definition Classes
- MatchMonadInterface
-
def
newSynthCaseLabel(name: String): Global.MethodSymbol
- Definition Classes
- CodegenCore
- def propagateSubstitution(treeMakers: List[TreeMaker], initial: Substitution): List[TreeMaker]
-
def
pureType(tp: Global.Type): Global.Type
- Definition Classes
- MatchMonadInterface
- def removeSubstOnly(makers: List[TreeMaker]): collection.immutable.List[TreeMaker]
-
def
reportMissingCases(pos: Global.Position, counterExamples: List[String]): Unit
- Definition Classes
- MatchMonadInterface
-
def
reportUnreachable(pos: Global.Position): Unit
- Definition Classes
- MatchMonadInterface
- object IrrefutableExtractorTreeMaker
- object TypeTestTreeMaker extends Serializable
The Scala compiler and reflection APIs.