scala.tools.nsc.transform.patmat.PatternMatching

# OptimizingMatchTranslator

#### class OptimizingMatchTranslator extends MatchTranslator with MatchOptimizer with MatchAnalyzer with Solver

Source
  PatternMatching.scala

Linear Supertypes
PatternMatching.Solver, PatternMatching.CNF, PatternMatching.MatchAnalyzer, PatternMatching.MatchOptimizer, PatternMatching.CommonSubconditionElimination, PatternMatching.MatchApproximator, PatternMatching.TreesAndTypesDomain, PatternMatching.CheckableTreeAndTypeAnalysis, PatternMatching.PropositionalLogic, PatternMatching.SwitchEmission, PatternMatching.OptimizedCodegen, PatternMatching.MatchTranslator, PatternMatching.TreeMakerWarnings, PatternMatching.TreeMakers, PatternMatching.CodegenCore, PatternMatching.TypedSubstitution, PatternMatching.MatchMonadInterface, AnyRef, Any
Type Hierarchy Learn more about scaladoc diagrams
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. OptimizingMatchTranslator
2. Solver
3. CNF
4. MatchAnalyzer
5. MatchOptimizer
6. CommonSubconditionElimination
7. MatchApproximator
8. TreesAndTypesDomain
9. CheckableTreeAndTypeAnalysis
10. PropositionalLogic
11. SwitchEmission
12. OptimizedCodegen
13. MatchTranslator
14. TreeMakerWarnings
15. TreeMakers
16. CodegenCore
17. TypedSubstitution
18. MatchMonadInterface
19. AnyRef
20. Any

Implicitly

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

1. Hide All
2. Show all

Learn more about member selection
Visibility

1. Public
2. All

### Instance Constructors

1. #### new OptimizingMatchTranslator(typer: (analyzer)#Typer)

### Type Members

1. #### trait AbsCodegen extends AnyRef

   Definition Classes
     CodegenCore

2. #### trait AbsVar extends AnyRef

   Definition Classes
     PropositionalLogic

3. #### case class AlternativesTreeMaker(prevBinder: Global.Symbol, altss: List[List[TreeMaker]], pos: Global.Position) extends TreeMaker with NoNewBinders with Product with Serializable

   Definition Classes
     TreeMakers

4. #### case class And(a: Prop, b: Prop) extends Prop with Product with Serializable

   Definition Classes
     PropositionalLogic

5. #### case class BodyTreeMaker(body: Global.Tree, matchPt: Global.Type) extends TreeMaker with NoNewBinders with Product with Serializable

   Definition Classes
     TreeMakers

6. #### final case class BoundTree(binder: Global.Symbol, tree: Global.Tree) extends Product with Serializable

   Definition Classes
     MatchTranslator

7. #### trait Casegen extends AbsCodegen

   Definition Classes
     CodegenCore

8. #### type Clause = Set[Lit]

   Definition Classes
     CNF

9. #### abstract class CommonCodegen extends AbsCodegen

   Definition Classes
     CodegenCore

10. #### sealed abstract class CondTreeMaker extends FunTreeMaker

    Definition Classes
      TreeMakers

11. #### sealed abstract class Const extends AnyRef

    Definition Classes
      TreesAndTypesDomain

12. #### case class ConstructorExample(cls: Global.Symbol, ctorArgs: List[CounterExample]) extends CounterExample with Product with Serializable

    Definition Classes
      MatchAnalyzer

13. #### class CounterExample extends AnyRef

    Definition Classes
      MatchAnalyzer

14. #### case class Eq(p: Var, q: Const) extends Prop with Product with Serializable

    Definition Classes
      PropositionalLogic

15. #### case class EqualityTestTreeMaker(prevBinder: Global.Symbol, patTree: Global.Tree, pos: Global.Position) extends CondTreeMaker with Product with Serializable

    Definition Classes
      TreeMakers

16. #### abstract class ExtractorCall extends AnyRef

    Definition Classes
      MatchTranslator

17. #### class ExtractorCallProd extends ExtractorCall

    Definition Classes
      MatchTranslator

18. #### class ExtractorCallRegular extends ExtractorCall

    Definition Classes
      MatchTranslator

19. #### case class ExtractorTreeMaker(extractor: Global.Tree, extraCond: Option[Global.Tree], nextBinder: Global.Symbol)(subPatBinders: List[Global.Symbol], subPatRefs: List[Global.Tree], 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).

    Definition Classes
      TreeMakers

20. #### type Formula = ArrayBuffer[Clause]

    Definition Classes
      CNF → PropositionalLogic

21. #### type FormulaBuilder = ArrayBuffer[Clause]

    Definition Classes
      CNF → PropositionalLogic

22. #### sealed abstract class FunTreeMaker extends TreeMaker

    Definition Classes
      TreeMakers

23. #### case class GuardTreeMaker(guardTree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable

    Definition Classes
      TreeMakers

24. #### case class ListExample(ctorArgs: List[CounterExample]) extends CounterExample with Product with Serializable

    Definition Classes
      MatchAnalyzer

25. #### class Lit extends AnyRef

    Definition Classes
      Solver

26. #### type Model = Map[Sym, Boolean]

    Definition Classes
      PropositionalLogic

27. #### case class NegativeExample(eqTo: MatchAnalyzer.Const, nonTrivialNonEqualTo: List[MatchAnalyzer.Const]) extends CounterExample with Product with Serializable

    Definition Classes
      MatchAnalyzer

28. #### sealed trait NoNewBinders extends TreeMaker

    Definition Classes
      TreeMakers

29. #### case class Not(a: Prop) extends Prop with Product with Serializable

    Definition Classes
      PropositionalLogic

30. #### case class Or(a: Prop, b: Prop) extends Prop with Product with Serializable

    Definition Classes
      PropositionalLogic

31. #### sealed trait PreserveSubPatBinders extends TreeMaker

    Definition Classes
      TreeMakers

32. #### 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.

    Definition Classes
      TreeMakers

33. #### class Prop extends AnyRef

    Definition Classes
      PropositionalLogic

34. #### trait PropMap extends AnyRef

    Definition Classes
      PropositionalLogic

35. #### trait PropTraverser extends AnyRef

    Definition Classes
      PropositionalLogic

36. #### class RegularSwitchMaker extends SwitchMaker

    Definition Classes
      SwitchEmission

37. #### class ReusedCondTreeMaker extends TreeMaker

    Definition Classes
      CommonSubconditionElimination

38. #### case class ReusingCondTreeMaker(sharedPrefix: List[CommonSubconditionElimination.Test], toReused: (CommonSubconditionElimination.TreeMaker) ⇒ CommonSubconditionElimination.TreeMaker) extends TreeMaker with Product with Serializable

    Definition Classes
      CommonSubconditionElimination

39. #### case class SubstOnlyTreeMaker(prevBinder: Global.Symbol, nextBinder: Global.Symbol) extends TreeMaker with Product with Serializable

    Definition Classes
      TreeMakers

40. #### class Substitution extends AnyRef

    Definition Classes
      TypedSubstitution

41. #### abstract class SwitchMaker extends AnyRef

    Definition Classes
      SwitchEmission

42. #### abstract case class Sym(variable: Var, const: Const) extends Prop with Product with Serializable

    Definition Classes
      PropositionalLogic

43. #### case class Test(prop: MatchApproximator.Prop, treeMaker: MatchApproximator.TreeMaker) extends Product with Serializable

    Definition Classes
      MatchApproximator

44. #### final case class TranslationStep(makers: List[MatchTranslator.TreeMaker], subpatterns: List[BoundTree]) extends Product with Serializable

    Definition Classes
      MatchTranslator

45. #### type Tree = Global.Tree

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

46. #### abstract class TreeMaker extends AnyRef

    Definition Classes
      TreeMakers

47. #### class TreeMakersToProps extends AnyRef

    Definition Classes
      MatchApproximator

48. #### class TreeMakersToPropsIgnoreNullChecks extends TreeMakersToProps

    Definition Classes
      MatchApproximator

49. #### case class TrivialTreeMaker(tree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable

    Definition Classes
      TreeMakers

50. #### case class TupleExample(ctorArgs: List[CounterExample]) extends CounterExample with Product with Serializable

    Definition Classes
      MatchAnalyzer

51. #### type Type = Global.Type

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

52. #### sealed class TypeConst extends Const

    Definition Classes
      TreesAndTypesDomain

53. #### trait TypeConstExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

54. #### case class TypeExample(c: MatchAnalyzer.Const) extends CounterExample with Product with Serializable

    Definition Classes
      MatchAnalyzer

55. #### 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.
    Definition Classes
      TreeMakers

56. #### class UniqueSym extends Sym

    Definition Classes
      PropositionalLogic

57. #### sealed class ValueConst extends Const

    Definition Classes
      TreesAndTypesDomain

58. #### trait ValueConstExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

59. #### case class ValueExample(c: MatchAnalyzer.ValueConst) extends CounterExample with Product with Serializable

    Definition Classes
      MatchAnalyzer

60. #### class Var extends AbsVar

    Definition Classes
      TreesAndTypesDomain

61. #### trait VarExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

### Value Members

1. #### final def !=(arg0: Any): Boolean

   Definition Classes
     AnyRef → Any

2. #### final def ##(): Int

   Definition Classes
     AnyRef → Any

3. #### def +(other: String): String

   Implicit information
     This member is added by an implicit conversion from OptimizingMatchTranslator to any2stringadd[OptimizingMatchTranslator] performed by method any2stringadd in scala.Predef.
   Definition Classes
     any2stringadd

4. #### def ->[B](y: B): (OptimizingMatchTranslator, B)

   Implicit information
     This member is added by an implicit conversion from OptimizingMatchTranslator to ArrowAssoc[OptimizingMatchTranslator] performed by method ArrowAssoc in scala.Predef.
   Definition Classes
     ArrowAssoc
   Annotations
     @inline()

5. #### def /\(props: Iterable[Prop]): Prop

   Definition Classes
     PropositionalLogic

6. #### final def ==(arg0: Any): Boolean

   Definition Classes
     AnyRef → Any

7. #### object AnalysisBudget

   Definition Classes
     PropositionalLogic

8. #### object Const

   Definition Classes
     TreesAndTypesDomain

9. #### object CounterExample

   Definition Classes
     MatchAnalyzer

10. #### val EmptyModel: Map[Sym, Boolean]

    Definition Classes
      Solver → PropositionalLogic

11. #### object EmptySubstitution extends Substitution

    Definition Classes
      TypedSubstitution

12. #### object ExtractorCall

    Definition Classes
      MatchTranslator

13. #### object False extends Prop with Product with Serializable

    Definition Classes
      PropositionalLogic

14. #### object IrrefutableExtractorTreeMaker

    Definition Classes
      TreeMakers

15. #### def Lit(sym: Sym, pos: Boolean = true): Lit

    Definition Classes
      Solver → CNF

16. #### object NoExample extends CounterExample with Product with Serializable

    Definition Classes
      MatchAnalyzer

17. #### val NoModel: Model

    Definition Classes
      Solver → PropositionalLogic

18. #### object NullConst extends Const with Product with Serializable

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

19. #### object PatternBoundToUnderscore

    Definition Classes
      MatchTranslator

20. #### object ReusedCondTreeMaker

    Definition Classes
      CommonSubconditionElimination

21. #### object Substitution

    Definition Classes
      TypedSubstitution

22. #### object Sym extends Serializable

    Definition Classes
      PropositionalLogic

23. #### object SymbolBound

    Definition Classes
      MatchTranslator

24. #### object Test extends Serializable

    Definition Classes
      MatchApproximator

25. #### object True extends Prop with Product with Serializable

    Definition Classes
      PropositionalLogic

26. #### object TypeConst extends TypeConstExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

27. #### object TypeTestTreeMaker extends Serializable

    Definition Classes
      TreeMakers

28. #### object ValueConst extends ValueConstExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

29. #### object Var extends VarExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

30. #### object WildcardExample extends CounterExample with Product with Serializable

    Definition Classes
      MatchAnalyzer

31. #### object WildcardPattern

    A conservative approximation of which patterns do not discern anything.

    A conservative approximation of which patterns do not discern anything. They are discarded during the translation.

    Definition Classes
      MatchTranslator

32. #### def \/(props: Iterable[Prop]): Prop

    Definition Classes
      PropositionalLogic

33. #### def addFormula(buff: FormulaBuilder, f: Formula): Unit

    Definition Classes
      CNF → PropositionalLogic

34. #### def analyzeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type, suppression: PatternMatching.Suppression): Unit

    Definition Classes
      MatchAnalyzer → TreeMakers

35. #### def andFormula(a: Formula, b: Formula): Formula

    Definition Classes
      CNF → PropositionalLogic

36. #### def approximateMatchConservative(root: Global.Symbol, cases: List[List[TreeMaker]]): List[List[Test]]

    Definition Classes
      MatchApproximator

37. #### final def asInstanceOf[T0]: T0

    Definition Classes
      Any

38. #### final def caseWithoutBodyToProp(tests: List[Test]): Prop

    Attributes
      protected
    Definition Classes
      MatchApproximator

39. #### def checkMatchVariablePatterns(cases: List[Global.CaseDef]): Unit

    Definition Classes
      TreeMakerWarnings

40. #### def checkableType(tp: Global.Type): Global.Type

    Definition Classes
      CheckableTreeAndTypeAnalysis

41. #### def clause(l: Lit*): Clause

    Definition Classes
      CNF

42. #### def clone(): AnyRef

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

43. #### def cnfString(f: Formula): String

    Definition Classes
      Solver → PropositionalLogic

44. #### def codegen: AbsCodegen

    Definition Classes
      OptimizedCodegen → CodegenCore

45. #### 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

    Definition Classes
      TreeMakers

46. #### 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

    Definition Classes
      TreeMakers

47. #### def combineExtractors(treeMakers: List[TreeMaker])(casegen: Casegen): Global.Tree

    Definition Classes
      TreeMakers

48. #### val debugInfoEmitVars: Boolean

    Attributes
      protected
    Definition Classes
      TreeMakers

49. #### def doCSE(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type): List[List[TreeMaker]]

    a flow-sensitive, generalised, common sub-expression elimination reuse knowledge from performed tests the only sub-expressions we consider are the conditions and results of the three tests (type, type&equality, equality) when a sub-expression is shared, it is stored in a mutable variable the variable is floated up so that its scope includes all of the program that shares it we generalize sharing to implication, where b reuses a if a => b and priors(a) => priors(b) (the priors of a sub expression form the path through the decision tree)

    a flow-sensitive, generalised, common sub-expression elimination reuse knowledge from performed tests the only sub-expressions we consider are the conditions and results of the three tests (type, type&equality, equality) when a sub-expression is shared, it is stored in a mutable variable the variable is floated up so that its scope includes all of the program that shares it we generalize sharing to implication, where b reuses a if a => b and priors(a) => priors(b) (the priors of a sub expression form the path through the decision tree)

    Definition Classes
      CommonSubconditionElimination

50. #### 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]

    Definition Classes
      SwitchEmission → TreeMakers

51. #### def emitTypeSwitch(bindersAndCases: List[(Global.Symbol, List[TreeMaker])], pt: Global.Type): Option[List[Global.CaseDef]]

    Definition Classes
      SwitchEmission → TreeMakers

52. #### def ensuring(cond: (OptimizingMatchTranslator) ⇒ Boolean, msg: ⇒ Any): OptimizingMatchTranslator

    Implicit information
      This member is added by an implicit conversion from OptimizingMatchTranslator to Ensuring[OptimizingMatchTranslator] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring

53. #### def ensuring(cond: (OptimizingMatchTranslator) ⇒ Boolean): OptimizingMatchTranslator

    Implicit information
      This member is added by an implicit conversion from OptimizingMatchTranslator to Ensuring[OptimizingMatchTranslator] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring

54. #### def ensuring(cond: Boolean, msg: ⇒ Any): OptimizingMatchTranslator

    Implicit information
      This member is added by an implicit conversion from OptimizingMatchTranslator to Ensuring[OptimizingMatchTranslator] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring

55. #### def ensuring(cond: Boolean): OptimizingMatchTranslator

    Implicit information
      This member is added by an implicit conversion from OptimizingMatchTranslator to Ensuring[OptimizingMatchTranslator] performed by method Ensuring in scala.Predef.
    Definition Classes
      Ensuring

56. #### def enumerateSubtypes(tp: Global.Type): Option[List[Global.Type]]

    Definition Classes
      CheckableTreeAndTypeAnalysis

57. #### final def eq(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

58. #### def eqFreePropToSolvable(p: Prop): Formula

    Definition Classes
      CNF → PropositionalLogic

59. #### def equals(arg0: Any): Boolean

    Definition Classes
      AnyRef → Any

60. #### def exhaustive(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type): List[String]

    Definition Classes
      MatchAnalyzer

61. #### def finalize(): Unit

    Attributes
      protected[java.lang]
    Definition Classes
      AnyRef
    Annotations
      @throws( classOf[java.lang.Throwable] )

62. #### def findAllModelsFor(f: Formula): List[Model]

    Definition Classes
      Solver → PropositionalLogic

63. #### def findModelFor(f: Formula): Model

    Definition Classes
      Solver → PropositionalLogic

64. #### def fixerUpper(origOwner: Global.Symbol, pos: Global.Position): Global.Traverser

    Attributes
      protected
    Definition Classes
      TreeMakers

65. #### def formatted(fmtstr: String): String

    Implicit information
      This member is added by an implicit conversion from OptimizingMatchTranslator to StringFormat[OptimizingMatchTranslator] performed by method StringFormat in scala.Predef.
    Definition Classes
      StringFormat
    Annotations
      @inline()

66. #### def formula(c: Clause*): Formula

    Definition Classes
      CNF

67. #### def formulaBuilder: ArrayBuffer[Set[Lit]]

    Definition Classes
      CNF → PropositionalLogic

68. #### def formulaBuilderSized(init: Int): ArrayBuffer[Clause]

    Definition Classes
      CNF

69. #### def freshName(prefix: String): Global.TermName

    Definition Classes
      CodegenCore

70. #### def freshSym(pos: Global.Position, tp: Global.Type = NoType, prefix: String = "x"): Global.TermSymbol

    Definition Classes
      CodegenCore

71. #### def gatherVariables(p: Prop): Set[Var]

    Definition Classes
      PropositionalLogic

72. #### final def getClass(): Class[_]

    Definition Classes
      AnyRef → Any

73. #### def hashCode(): Int

    Definition Classes
      AnyRef → Any

74. #### final def isInstanceOf[T0]: Boolean

    Definition Classes
      Any

75. #### val matchOwner: Global.Symbol

    Definition Classes
      MatchMonadInterface

76. #### def modelToCounterExample(scrutVar: Var)(model: Model): Option[CounterExample]

    Definition Classes
      MatchAnalyzer

77. #### def modelToVarAssignment(model: Model): Map[Var, (Seq[Const], Seq[Const])]

    Definition Classes
      MatchAnalyzer

78. #### final def ne(arg0: AnyRef): Boolean

    Definition Classes
      AnyRef

79. #### def newBoundTree(tree: Global.Tree, pt: Global.Type): BoundTree

    Definition Classes
      MatchTranslator

80. #### def newSynthCaseLabel(name: String): Global.MethodSymbol

    Definition Classes
      CodegenCore

81. #### final def notify(): Unit

    Definition Classes
      AnyRef

82. #### final def notifyAll(): Unit

    Definition Classes
      AnyRef

83. #### def optimizeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type): (List[List[TreeMaker]], List[Tree])

    Definition Classes
      MatchOptimizer → TreeMakers

84. #### object optimizedCodegen extends CommonCodegen

    Definition Classes
      OptimizedCodegen

85. #### def prepareNewAnalysis(): Unit

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

86. #### def propToSolvable(p: Prop): Formula

    Definition Classes
      PropositionalLogic

87. #### def propagateSubstitution(treeMakers: List[TreeMaker], initial: Substitution): List[TreeMaker]

    Definition Classes
      TreeMakers

88. #### def pureType(tp: Global.Type): Global.Type

    Definition Classes
      MatchMonadInterface

89. #### def removeSubstOnly(makers: List[TreeMaker]): collection.immutable.List[TreeMaker]

    Definition Classes
      TreeMakers

90. #### def removeVarEq(props: List[Prop], modelNull: Boolean = false): (Formula, List[Formula])

    Definition Classes
      PropositionalLogic

91. #### def reportMissingCases(pos: Global.Position, counterExamples: List[String]): Unit

    Definition Classes
      MatchMonadInterface

92. #### def reportUnreachable(pos: Global.Position): Unit

    Definition Classes
      MatchMonadInterface

93. #### def reportWarning(message: String): Unit

    Definition Classes
      MatchAnalyzer → PropositionalLogic

94. #### def showTreeMakers(cases: List[List[TreeMaker]]): Unit

    Definition Classes
      MatchApproximator

95. #### def simplifyFormula(a: Formula): Formula

    Definition Classes
      CNF → PropositionalLogic

96. #### final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
      AnyRef

97. #### def toFormula(buff: FormulaBuilder): Formula

    Definition Classes
      CNF → PropositionalLogic

98. #### def toString(): String

    Definition Classes
      AnyRef → Any

99. #### def translateBody(body: Global.Tree, matchPt: Global.Type): TreeMaker

    Definition Classes
      MatchTranslator

100. #### def translateCase(scrutSym: Global.Symbol, pt: Global.Type)(caseDef: Global.CaseDef): collection.immutable.List[TreeMaker]

     The translation of `pat if guard => body` has two aspects: 1) the substitution due to the variables bound by patterns 2) the combination of the extractor calls using `flatMap`.

     The translation of `pat if guard => body` has two aspects: 1) the substitution due to the variables bound by patterns 2) the combination of the extractor calls using `flatMap`.

     2) is easy -- it looks like: `translatePattern_1.flatMap(translatePattern_2....flatMap(translatePattern_N.flatMap(translateGuard.flatMap((x_i) => success(Xbody(x_i)))))...)` this must be right-leaning tree, as can be seen intuitively by considering the scope of bound variables: variables bound by pat_1 must be visible from the function inside the left-most flatMap right up to Xbody all the way on the right 1) is tricky because translatePattern_i determines the shape of translatePattern_i+1: zoom in on `translatePattern_1.flatMap(translatePattern_2)` for example -- it actually looks more like: `translatePattern_1(x_scrut).flatMap((x_1) => {y_i -> x_1._i}translatePattern_2)`

     `x_1` references the result (inside the monad) of the extractor corresponding to `pat_1`, this result holds the values for the constructor arguments, which translatePattern_1 has extracted from the object pointed to by `x_scrut`. The `y_i` are the symbols bound by `pat_1` (in order) in the scope of the remainder of the pattern, and they must thus be replaced by:

     - (for 1-ary unapply) x_1
     - (for n-ary unapply, n > 1) selection of the i'th tuple component of `x_1`
     - (for unapplySeq) x_1.apply(i)

     in the treemakers,

     Thus, the result type of `translatePattern_i`'s extractor must conform to `M[(T_1,..., T_n)]`.

     Operationally, phase 1) is a foldLeft, since we must consider the depth-first-flattening of the transformed patterns from left to right. For every pattern ast node, it produces a transformed ast and a function that will take care of binding and substitution of the next ast (to the right).

     Definition Classes
       MatchTranslator

101. #### def translateGuard(guard: Global.Tree): List[TreeMaker]

     Definition Classes
       MatchTranslator

102. #### def translateMatch(match_: Global.Match): Global.Tree

     Implement a pattern match by turning its cases (including the implicit failure case) into the corresponding (monadic) extractors, and combining them with the `orElse` combinator.

     Implement a pattern match by turning its cases (including the implicit failure case) into the corresponding (monadic) extractors, and combining them with the `orElse` combinator.

     For `scrutinee match { case1 ... caseN }`, the resulting tree has the shape `runOrElse(scrutinee)(x => translateCase1(x).orElse(translateCase2(x)).....orElse(zero))`

     NOTE: the resulting tree is not type checked, nor are nested pattern matches transformed thus, you must typecheck the result (and that will in turn translate nested matches) this could probably optimized... (but note that the matchStrategy must be solved for each nested patternmatch)

     Definition Classes
       MatchTranslator

103. #### def translatePattern(bound: BoundTree): List[TreeMaker]

     Definition Classes
       MatchTranslator

104. #### def translateTry(caseDefs: List[Global.CaseDef], pt: Global.Type, pos: Global.Position): List[Global.CaseDef]

     Definition Classes
       MatchTranslator

105. #### val typer: (analyzer)#Typer

     Definition Classes
       OptimizingMatchTranslator → CheckableTreeAndTypeAnalysis → MatchMonadInterface

106. #### def uncheckableType(tp: Global.Type): Boolean

     Definition Classes
       CheckableTreeAndTypeAnalysis

107. #### def uncheckedWarning(pos: Global.Position, msg: String): Unit

     Definition Classes
       MatchAnalyzer

108. #### def unreachableCase(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type): Option[Int]

     Definition Classes
       MatchAnalyzer

109. #### def varAssignmentString(varAssignment: Map[Var, (Seq[Const], Seq[Const])]): String

     Definition Classes
       MatchAnalyzer

110. #### final def wait(): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

111. #### final def wait(arg0: Long, arg1: Int): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

112. #### final def wait(arg0: Long): Unit

     Definition Classes
       AnyRef
     Annotations
       @throws( ... )

113. #### def warn(pos: Global.Position, ex: Logic.PropositionalLogic.AnalysisBudget.Exception, kind: String): Unit

     Definition Classes
       MatchAnalyzer

114. #### def →[B](y: B): (OptimizingMatchTranslator, B)

     Implicit information
       This member is added by an implicit conversion from OptimizingMatchTranslator to ArrowAssoc[OptimizingMatchTranslator] performed by method ArrowAssoc in scala.Predef.
     Definition Classes
       ArrowAssoc

### Inherited from PatternMatching.Solver

### Inherited from PatternMatching.CNF

### Inherited from PatternMatching.MatchAnalyzer

### Inherited from PatternMatching.MatchOptimizer

### Inherited from PatternMatching.CommonSubconditionElimination

### Inherited from PatternMatching.MatchApproximator

### Inherited from PatternMatching.TreesAndTypesDomain

### Inherited from PatternMatching.CheckableTreeAndTypeAnalysis

### Inherited from PatternMatching.PropositionalLogic

### Inherited from PatternMatching.SwitchEmission

### Inherited from PatternMatching.OptimizedCodegen

### Inherited from PatternMatching.MatchTranslator

### Inherited from PatternMatching.TreeMakerWarnings

### Inherited from PatternMatching.TreeMakers

### Inherited from PatternMatching.CodegenCore

### Inherited from PatternMatching.TypedSubstitution

### Inherited from PatternMatching.MatchMonadInterface

### Inherited from AnyRef

### Inherited from Any

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

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

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

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

### Ungrouped