Scala Compiler2.12.2-20170504-135222-21d12e9 < Back
 

# Packages

-  package root

  The Scala compiler and reflection APIs.

  The Scala compiler and reflection APIs.

  Definition Classes
    root
-  package scala
  Definition Classes
    root
-  package tools
  Definition Classes
    scala
-  package nsc
  Definition Classes
    tools
-  package transform
  Definition Classes
    nsc
-  package patmat
  Definition Classes
    transform
-  trait MatchTreeMaking extends MatchCodeGen with Debugging

  Translate our IR (TreeMakers) into actual Scala Trees using the factory methods in MatchCodeGen.

  Translate our IR (TreeMakers) into actual Scala Trees using the factory methods in MatchCodeGen.

  The IR is mostly concerned with sequencing, substitution, and rendering all necessary conditions, mostly agnostic to whether we're in optimized/pure (virtualized) mode.

  Definition Classes
    patmat
- CODE
- CodegenCore
- MatchMonadInterface
- OptimizedCodegen
- PureCodegen
- PureMatchMonadInterface
- Suppression
- TreeMakers
- TypedSubstitution
- debug
- vpmName

t

scala.tools.nsc.transform.patmat.MatchTreeMaking

# TreeMakers 

###

#### trait TreeMakers extends TypedSubstitution with CodegenCore

Source
  MatchTreeMaking.scala

Linear Supertypes
MatchTreeMaking.CodegenCore, MatchTreeMaking.TypedSubstitution, MatchTreeMaking.MatchMonadInterface, AnyRef, Any
Known Subclasses
MatchAnalyzer, MatchApproximator, CommonSubconditionElimination, MatchOptimizer, SwitchEmission, MatchTranslator, OptimizingMatchTranslator, PureMatchTranslator
Type Hierarchy
 
Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. TreeMakers
2. CodegenCore
3. TypedSubstitution
4. MatchMonadInterface
5. AnyRef
6. Any

Implicitly

1. by any2stringadd
2. by StringFormat
3. by Ensuring
4. by ArrowAssoc

1. Hide All
2. Show All

Visibility

1. Public
2. All

### Type Members

1.  class Substitution extends AnyRef
   Definition Classes
     TypedSubstitution
2.  trait AbsCodegen extends AnyRef
   Definition Classes
     CodegenCore
3.  trait Casegen extends AbsCodegen
   Definition Classes
     CodegenCore
4.  abstract class CommonCodegen extends AbsCodegen
   Definition Classes
     CodegenCore
5.  case class AlternativesTreeMaker (prevBinder: Global.Symbol, altss: List[List[TreeMaker]], pos: Global.Position) extends TreeMaker with NoNewBinders with Product with Serializable
6.  case class BodyTreeMaker (body: Global.Tree, matchPt: Global.Type) extends TreeMaker with NoNewBinders with Product with Serializable
7.  sealed abstract class CondTreeMaker extends FunTreeMaker
8.  case class EqualityTestTreeMaker (prevBinder: Global.Symbol, patTree: Global.Tree, pos: Global.Position) extends CondTreeMaker with Product with Serializable
9.  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 binder `nextBinder` over our extractor's result the function's body is determined by the next TreeMaker (furthermore, the interpretation of `flatMap` 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 binder `nextBinder` over our extractor's result the function's body is determined by the next TreeMaker (furthermore, the interpretation of `flatMap` 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 in `subPatBinders`. This makes extractor patterns more debuggable (SI-5739).

10.  sealed abstract class FunTreeMaker extends TreeMaker
11.  case class GuardTreeMaker (guardTree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable
12.  sealed trait NoNewBinders extends TreeMaker
13.  sealed trait PreserveSubPatBinders extends TreeMaker
14.  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 (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 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.

15.  case class SubstOnlyTreeMaker (prevBinder: Global.Symbol, nextBinder: Global.Symbol) extends TreeMaker with Product with Serializable
16.  abstract class TreeMaker extends AnyRef
17.  case class TrivialTreeMaker (tree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable
18.  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://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.

### Abstract Value Members

1.  abstract def analyzeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type, suppression: Suppression): Unit
2.  abstract def codegen: AbsCodegen
   Definition Classes
     CodegenCore
3.  abstract def optimizeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type): (List[List[TreeMaker]], List[Global.Tree])
4.  abstract val typer: (analyzer)#Typer
   Definition Classes
     MatchMonadInterface

### Concrete Value Members

1.  object EmptySubstitution extends Substitution
   Definition Classes
     TypedSubstitution
2.  object Substitution
   Definition Classes
     TypedSubstitution
3.  final def !=(arg0: Any): Boolean
   Definition Classes
     AnyRef → Any
4.  final def ##(): Int
   Definition Classes
     AnyRef → Any
5.  def +(other: String): String
   Implicit
     This member is added by an implicit conversion from TreeMakers to any2stringadd[TreeMakers] performed by method any2stringadd in scala.Predef.
   Definition Classes
     any2stringadd
6.  def ->[B](y: B): (TreeMakers, B)
   Implicit
     This member is added by an implicit conversion from TreeMakers to ArrowAssoc[TreeMakers] performed by method ArrowAssoc in scala.Predef.
   Definition Classes
     ArrowAssoc
   Annotations
     @inline()
7.  final def ==(arg0: Any): Boolean
   Definition Classes
     AnyRef → Any
8.  final def asInstanceOf[T0]: T0
   Definition Classes
     Any
9.  def clone(): AnyRef
   Attributes
     protected[java.lang]
   Definition Classes
     AnyRef
   Annotations
     @throws( ... )
10.  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
11.  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
12.  def combineExtractors(treeMakers: List[TreeMaker])(casegen: Casegen): Global.Tree
13.  val debugInfoEmitVars: Boolean
    Attributes
      protected
14.  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]
15.  def emitTypeSwitch(bindersAndCases: List[(Global.Symbol, List[TreeMaker])], pt: Global.Type): Option[List[Global.CaseDef]]
16.  def ensuring(cond: (TreeMakers) ⇒ Boolean, msg: ⇒ Any): TreeMakers
    Implicit
      This member is added by an implicit conversion from TreeMakers to Ensuring[TreeMakers] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
17.  def ensuring(cond: (TreeMakers) ⇒ Boolean): TreeMakers
    Implicit
      This member is added by an implicit conversion from TreeMakers to Ensuring[TreeMakers] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
18.  def ensuring(cond: Boolean, msg: ⇒ Any): TreeMakers
    Implicit
      This member is added by an implicit conversion from TreeMakers to Ensuring[TreeMakers] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
19.  def ensuring(cond: Boolean): TreeMakers
    Implicit
      This member is added by an implicit conversion from TreeMakers to Ensuring[TreeMakers] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring
20.  final def eq(arg0: AnyRef): Boolean
    Definition Classes
      AnyRef
21.  def equals(arg0: Any): Boolean
    Definition Classes
      AnyRef → Any
22.  def finalize(): Unit
    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )
23.  def fixerUpper(origOwner: Global.Symbol, pos: Global.Position): Global.Traverser
    Attributes
      protected
24.  def formatted(fmtstr: String): String
    Implicit
      This member is added by an implicit conversion from TreeMakers to StringFormat[TreeMakers] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @inline()
25.  def freshName(prefix: String): Global.TermName
    Definition Classes
      CodegenCore
26.  def freshSym(pos: Global.Position, tp: Global.Type = NoType, prefix: String = "x"): Global.TermSymbol
    Definition Classes
      CodegenCore
27.  final def getClass(): Class[_]
    Definition Classes
      AnyRef → Any
28.  def hashCode(): Int
    Definition Classes
      AnyRef → Any
29.  final def isInstanceOf[T0]: Boolean
    Definition Classes
      Any
30.  val matchOwner: Global.Symbol
    Definition Classes
      MatchMonadInterface
31.  final def ne(arg0: AnyRef): Boolean
    Definition Classes
      AnyRef
32.  def newSynthCaseLabel(name: String): Global.MethodSymbol
    Definition Classes
      CodegenCore
33.  final def notify(): Unit
    Definition Classes
      AnyRef
34.  final def notifyAll(): Unit
    Definition Classes
      AnyRef
35.  def propagateSubstitution(treeMakers: List[TreeMaker], initial: Substitution): List[TreeMaker]
36.  def pureType(tp: Global.Type): Global.Type
    Definition Classes
      MatchMonadInterface
37.  def removeSubstOnly(makers: List[TreeMaker]): collection.immutable.List[TreeMaker]
38.  def reportMissingCases(pos: Global.Position, counterExamples: List[String]): Unit
    Definition Classes
      MatchMonadInterface
39.  def reportUnreachable(pos: Global.Position): Unit
    Definition Classes
      MatchMonadInterface
40.  final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
      AnyRef
41.  def toString(): String
    Definition Classes
      AnyRef → Any
42.  final def wait(): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
43.  final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
44.  final def wait(arg0: Long): Unit
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )
45.  def →[B](y: B): (TreeMakers, B)
    Implicit
      This member is added by an implicit conversion from TreeMakers to ArrowAssoc[TreeMakers] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
      ArrowAssoc
46.  object IrrefutableExtractorTreeMaker
47.  object TypeTestTreeMaker extends Serializable

### Inherited from MatchTreeMaking.CodegenCore

### Inherited from MatchTreeMaking.TypedSubstitution

### Inherited from MatchTreeMaking.MatchMonadInterface

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion any2stringadd from TreeMakers to any2stringadd[TreeMakers]

### Inherited by implicit conversion StringFormat from TreeMakers to StringFormat[TreeMakers]

### Inherited by implicit conversion Ensuring from TreeMakers to Ensuring[TreeMakers]

### Inherited by implicit conversion ArrowAssoc from TreeMakers to ArrowAssoc[TreeMakers]

### Ungrouped