scala.tools.nsc.transform.patmat.PatternMatching

# OptimizingMatchTranslator

###
Related Doc: package PatternMatching

#### 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
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. #### class AlreadyInCNF extends AnyRef

   Definition Classes
     CNF

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

   Definition Classes
     TreeMakers

5. #### final case class And(ops: Set[Prop]) extends Prop with Product with Serializable

   Definition Classes
     PropositionalLogic

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

   Definition Classes
     TreeMakers

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

   Definition Classes
     MatchTranslator

8. #### trait Casegen extends AbsCodegen

   Definition Classes
     CodegenCore

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

   Definition Classes
     CNF

10. #### type Cnf = Array[Clause]

    Conjunctive normal form (of a Boolean formula).

    Conjunctive normal form (of a Boolean formula). A formula in this form is amenable to a SAT solver (i.e., solver that decides satisfiability of a formula).

    Definition Classes
      CNF

11. #### trait CnfBuilder extends AnyRef

    Definition Classes
      CNF

12. #### abstract class CommonCodegen extends AbsCodegen

    Definition Classes
      CodegenCore

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreesAndTypesDomain

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

    Definition Classes
      MatchAnalyzer

16. #### class CounterExample extends AnyRef

    Definition Classes
      MatchAnalyzer

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      TreeMakers

19. #### abstract class ExtractorCall extends AnyRef

    Definition Classes
      MatchTranslator

20. #### class ExtractorCallProd extends ExtractorCall

    Definition Classes
      MatchTranslator

21. #### class ExtractorCallRegular extends ExtractorCall

    Definition Classes
      MatchTranslator

22. #### 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).

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      MatchAnalyzer

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. #### final case class Not(a: Prop) extends Prop with Product with Serializable

    Definition Classes
      PropositionalLogic

30. #### final case class Or(ops: Set[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. #### final case class Solution(model: Model, unassigned: List[Sym]) extends Product with Serializable

    Definition Classes
      PropositionalLogic

40. #### case class Solvable(cnf: Cnf, symbolMapping: SymbolMapping) extends Product with Serializable

    Definition Classes
      CNF

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

    Definition Classes
      TreeMakers

42. #### class Substitution extends AnyRef

    Definition Classes
      TypedSubstitution

43. #### abstract class SwitchMaker extends AnyRef

    Definition Classes
      SwitchEmission

44. #### final class Sym extends Prop

    Definition Classes
      PropositionalLogic

45. #### class SymbolMapping extends AnyRef

    Definition Classes
      CNF

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

    Definition Classes
      MatchApproximator

47. #### class TransformToCnf extends CnfBuilder

    Plaisted transformation: used for conversion of a propositional formula into conjunctive normal form (CNF) (input format for SAT solver).

    Plaisted transformation: used for conversion of a propositional formula into conjunctive normal form (CNF) (input format for SAT solver). A simple conversion into CNF via Shannon expansion would also be possible but it's worst-case complexity is exponential (in the number of variables) and thus even simple problems could become untractable. The Plaisted transformation results in an _equisatisfiable_ CNF-formula (it generates auxiliary variables) but runs with linear complexity. The common known Tseitin transformation uses bi-implication, whereas the Plaisted transformation uses implication only, thus the resulting CNF formula has (on average) only half of the clauses of a Tseitin transformation. The Plaisted transformation uses the polarities of sub-expressions to figure out which part of the bi-implication can be omitted. However, if all sub-expressions have positive polarity (e.g., after transformation into negation normal form) then the conversion is rather simple and the pseudo-normalization via NNF increases chances only one side of the bi-implication is needed.

    Definition Classes
      CNF

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

    Definition Classes
      MatchTranslator

49. #### type Tree = Global.Tree

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

50. #### abstract class TreeMaker extends AnyRef

    Definition Classes
      TreeMakers

51. #### class TreeMakersToProps extends AnyRef

    Definition Classes
      MatchApproximator

52. #### class TreeMakersToPropsIgnoreNullChecks extends TreeMakersToProps

    Definition Classes
      MatchApproximator

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

    Definition Classes
      TreeMakers

54. #### type TseitinModel = Set[Lit]

    Definition Classes
      Solver

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

    Definition Classes
      MatchAnalyzer

56. #### type Type = Global.Type

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

57. #### sealed class TypeConst extends Const

    Definition Classes
      TreesAndTypesDomain

58. #### trait TypeConstExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      MatchAnalyzer

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

61. #### sealed class ValueConst extends Const

    Definition Classes
      TreesAndTypesDomain

62. #### trait ValueConstExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      MatchAnalyzer

64. #### class Var extends AbsVar

    Definition Classes
      TreesAndTypesDomain

65. #### trait VarExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

### Value Members

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

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     AnyRef → Any

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

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   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]): Product with Serializable with Prop

   Definition Classes
     PropositionalLogic

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

   The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

   The expression `x == that` is equivalent to `if (x eq null) that eq null else x.equals(that)`.

   arg0

     the object to compare against this object for equality.

   returns

     `true` if the receiver object is equivalent to the argument; `false` otherwise.

   Definition Classes
     AnyRef → Any

7. #### object And extends Serializable

   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. #### val EmptyTseitinModel: Set[Lit]

    Definition Classes
      Solver

13. #### object ExtractorCall

    Definition Classes
      MatchTranslator

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

    Definition Classes
      PropositionalLogic

15. #### object IrrefutableExtractorTreeMaker

    Definition Classes
      TreeMakers

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

    Definition Classes
      MatchAnalyzer

17. #### val NoModel: Model

    Definition Classes
      Solver → PropositionalLogic

18. #### val NoTseitinModel: TseitinModel

    Definition Classes
      Solver

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

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

20. #### object Or extends Serializable

    Definition Classes
      PropositionalLogic

21. #### object PatternBoundToUnderscore

    Definition Classes
      MatchTranslator

22. #### object ReusedCondTreeMaker

    Definition Classes
      CommonSubconditionElimination

23. #### object Substitution

    Definition Classes
      TypedSubstitution

24. #### object Sym

    Definition Classes
      PropositionalLogic

25. #### object SymbolBound

    Definition Classes
      MatchTranslator

26. #### object Test extends Serializable

    Definition Classes
      MatchApproximator

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

    Definition Classes
      PropositionalLogic

28. #### object TypeConst extends TypeConstExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

29. #### object TypeTestTreeMaker extends Serializable

    Definition Classes
      TreeMakers

30. #### object ValueConst extends ValueConstExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

31. #### object Var extends VarExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

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

    Definition Classes
      MatchAnalyzer

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

34. #### def \/(props: Iterable[Prop]): Product with Serializable with Prop

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      MatchAnalyzer → TreeMakers

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

    Definition Classes
      MatchApproximator

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

    Cast the receiver object to be of type `T0`.

    Cast the receiver object to be of type `T0`.

    Note that the success of a cast at runtime is modulo Scala's erasure semantics. Therefore the expression `1.asInstanceOf[String]` will throw a `ClassCastException` at runtime, while the expression `List(1).asInstanceOf[List[String]]` will not. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the requested type.

    returns

      the receiver object.

    Definition Classes
      Any
    Exceptions thrown

      `ClassCastException` if the receiver object is not an instance of the erasure of type `T0`.

38. #### val budgetProp: sys.Prop[String]

    Definition Classes
      PropositionalLogic

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

    Attributes
      protected
    Definition Classes
      MatchApproximator

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

    Definition Classes
      TreeMakerWarnings

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

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

    Definition Classes
      CNF

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

    Create a copy of the receiver object.

    Create a copy of the receiver object.

    The default implementation of the `clone` method is platform dependent.

    returns

      a copy of the receiver object.

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

      not specified by SLS as a member of AnyRef

44. #### def cnfString(f: Array[Clause]): String

    Definition Classes
      Solver

45. #### def codegen: AbsCodegen

    Definition Classes
      OptimizedCodegen → CodegenCore

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

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

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

    Definition Classes
      TreeMakers

49. #### val debugInfoEmitVars: Boolean

    Attributes
      protected
    Definition Classes
      TreeMakers

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

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

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

    Definition Classes
      SwitchEmission → TreeMakers

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

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

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

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

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

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

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    Tests whether the argument (`arg0`) is a reference to the receiver object (`this`).

    The `eq` method implements an equivalence relation on non-null instances of `AnyRef`, and has three additional properties:

    - It is consistent: for any non-null instances `x` and `y` of type `AnyRef`, multiple invocations of `x.eq(y)` consistently returns `true` or consistently returns `false`.
    - For any non-null instance `x` of type `AnyRef`, `x.eq(null)` and `null.eq(x)` returns `false`.
    - `null.eq(null)` returns `true`.

    When overriding the `equals` or `hashCode` methods, it is important to ensure that their behavior is consistent with reference equality. Therefore, if two objects are references to each other (`o1 eq o2`), they should be equal to each other (`o1 == o2`) and they should hash to the same value (`o1.hashCode == o2.hashCode`).

    returns

      `true` if the argument is a reference to the receiver object; `false` otherwise.

    Definition Classes
      AnyRef

59. #### def eqFreePropToSolvable(p: Prop): Solvable

    Definition Classes
      CNF → PropositionalLogic

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

    The equality method for reference types.

    The equality method for reference types. Default implementation delegates to `eq`.

    See also `equals` in scala.Any.

    returns

      `true` if the receiver object is equivalent to the argument; `false` otherwise.

    Definition Classes
      AnyRef → Any

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

    Definition Classes
      MatchAnalyzer

62. #### def expandModel(solution: Solution): List[Map[Var, (Seq[Const], Seq[Const])]]

    The models we get from the DPLL solver need to be mapped back to counter examples.

    The models we get from the DPLL solver need to be mapped back to counter examples. However there's no precalculated mapping model -> counter example. Even worse, not every valid model corresponds to a valid counter example. The reason is that restricting the valid models further would for example require a quadratic number of additional clauses. So to keep the optimistic case fast (i.e., all cases are covered in a pattern match), the infeasible counter examples are filtered later.

    The DPLL procedure keeps the literals that do not contribute to the solution unassigned, e.g., for `(a \/ b)` only {a = true} or {b = true} is required and the other variable can have any value.

    This function does a smart expansion of the model and avoids models that have conflicting mappings.

    For example for in case of the given set of symbols (taken from `t7020.scala`): "V2=2#16" "V2=6#19" "V2=5#18" "V2=4#17" "V2=7#20"

    One possibility would be to group the symbols by domain but this would only work for equality tests and would not be compatible with type tests. Another observation leads to a much simpler algorithm: Only one of these symbols can be set to true, since `V2` can at most be equal to one of {2,6,5,4,7}.

    Definition Classes
      MatchAnalyzer

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

    Called by the garbage collector on the receiver object when there are no more references to the object.

    Called by the garbage collector on the receiver object when there are no more references to the object.

    The details of when and if the `finalize` method is invoked, as well as the interaction between `finalize` and non-local returns and exceptions, are all platform dependent.

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

      not specified by SLS as a member of AnyRef

64. #### def findAllModelsFor(solvable: Solvable): List[Solution]

    Definition Classes
      Solver → PropositionalLogic

65. #### def findModelFor(solvable: Solvable): Model

    Definition Classes
      Solver → PropositionalLogic

66. #### def findTseitinModelFor(clauses: Array[Clause]): TseitinModel

    Definition Classes
      Solver

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

    Attributes
      protected
    Definition Classes
      TreeMakers

68. #### 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()

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 gatherSymbols(p: Prop): Set[Sym]

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      PropositionalLogic

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

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

      a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
      AnyRef → Any
    Note

      not specified by SLS as a member of AnyRef

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

    The hashCode method for reference types.

    The hashCode method for reference types. See hashCode in scala.Any.

    returns

      the hash code value for this object.

    Definition Classes
      AnyRef → Any

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

    Test whether the dynamic type of the receiver object is `T0`.

    Test whether the dynamic type of the receiver object is `T0`.

    Note that the result of the test is modulo Scala's erasure semantics. Therefore the expression `1.isInstanceOf[String]` will return `false`, while the expression `List(1).isInstanceOf[List[String]]` will return `true`. In the latter example, because the type argument is erased as part of compilation it is not possible to check whether the contents of the list are of the specified type.

    returns

      `true` if the receiver object is an instance of erasure of type `T0`; `false` otherwise.

    Definition Classes
      Any

76. #### val matchOwner: Global.Symbol

    Definition Classes
      MatchMonadInterface

77. #### def modelToCounterExample(scrutVar: Var)(varAssignment: Map[Var, (Seq[Const], Seq[Const])]): Option[CounterExample]

    Definition Classes
      MatchAnalyzer

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

    Definition Classes
      MatchAnalyzer

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

    Equivalent to `!(this eq that)`.

    Equivalent to `!(this eq that)`.

    returns

      `true` if the argument is not a reference to the receiver object; `false` otherwise.

    Definition Classes
      AnyRef

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

    Definition Classes
      MatchTranslator

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

    Definition Classes
      CodegenCore

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

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Wakes up a single thread that is waiting on the receiver object's monitor.

    Definition Classes
      AnyRef
    Note

      not specified by SLS as a member of AnyRef

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

    Wakes up all threads that are waiting on the receiver object's monitor.

    Wakes up all threads that are waiting on the receiver object's monitor.

    Definition Classes
      AnyRef
    Note

      not specified by SLS as a member of AnyRef

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

    Definition Classes
      MatchOptimizer → TreeMakers

85. #### object optimizedCodegen extends CommonCodegen

    Definition Classes
      OptimizedCodegen

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

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

87. #### def propToSolvable(p: Prop): Solvable

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      MatchAnalyzer → PropositionalLogic

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

    Definition Classes
      MatchApproximator

96. #### def simplify(f: Prop): Prop

    Simplifies propositional formula according to the following rules: - eliminate double negation (avoids unnecessary Tseitin variables) - flatten trees of same connectives (avoids unnecessary Tseitin variables) - removes constants and connectives that are in fact constant because of their operands - eliminates duplicate operands - convert formula into NNF: all sub-expressions have a positive polarity which makes them amenable for the subsequent Plaisted transformation and increases chances to figure out that the formula is already in CNF

    Simplifies propositional formula according to the following rules: - eliminate double negation (avoids unnecessary Tseitin variables) - flatten trees of same connectives (avoids unnecessary Tseitin variables) - removes constants and connectives that are in fact constant because of their operands - eliminates duplicate operands - convert formula into NNF: all sub-expressions have a positive polarity which makes them amenable for the subsequent Plaisted transformation and increases chances to figure out that the formula is already in CNF

    Complexity: DFS over formula tree

    See http://www.decision-procedures.org/slides/propositional_logic-2x3.pdf

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      AnyRef

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

    Creates a String representation of this object.

    Creates a String representation of this object. The default representation is platform dependent. On the java platform it is the concatenation of the class name, "@", and the object's hashcode in hexadecimal.

    returns

      a String representation of the object.

    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 →[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