Packages

class ReusedCondTreeMaker extends TreeMaker

Source
MatchOptimization.scala
Linear Supertypes
CommonSubconditionElimination.TreeMaker, AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReusedCondTreeMaker
  2. TreeMaker
  3. AnyRef
  4. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new ReusedCondTreeMaker(prevBinder: Global.Symbol, nextBinder: Global.Symbol, cond: CommonSubconditionElimination.Tree, res: CommonSubconditionElimination.Tree, selectorPos: Global.Position, pos: Global.Position)

Value Members

  1. def chainBefore(next: CommonSubconditionElimination.Tree)(casegen: CommonSubconditionElimination.Casegen): CommonSubconditionElimination.Tree
    Definition Classes
    ReusedCondTreeMaker → TreeMaker
  2. lazy val localSubstitution: CommonSubconditionElimination.Substitution
    Definition Classes
    ReusedCondTreeMaker → TreeMaker
  3. val nextBinder: Global.Symbol
  4. val pos: Global.Position
    Definition Classes
    ReusedCondTreeMaker → TreeMaker
  5. lazy val storedCond: Global.TermSymbol
  6. def subPatternsAsSubstitution: CommonSubconditionElimination.Substitution

    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 scala/bug#5158, scala/bug#5739 and scala/bug#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
  7. def substitution: CommonSubconditionElimination.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)

    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
  8. def toString(): String
    Definition Classes
    ReusedCondTreeMaker → AnyRef → Any
  9. lazy val treesToHoist: List[CommonSubconditionElimination.Tree]