scala.tools.nsc.transform.patmat.MatchApproximation

# MatchApproximator

###
Related Doc: package MatchApproximation

#### trait MatchApproximator extends TreeMakers with TreesAndTypesDomain

Represent a match as a formula in propositional logic that encodes whether the match matches (abstractly: we only consider types)

Source
  MatchAnalysis.scala

Linear Supertypes
MatchApproximation.TreesAndTypesDomain, MatchApproximation.CheckableTreeAndTypeAnalysis, MatchApproximation.PropositionalLogic, MatchApproximation.TreeMakers, MatchApproximation.CodegenCore, MatchApproximation.TypedSubstitution, MatchApproximation.MatchMonadInterface, AnyRef, Any
Known Subclasses
CommonSubconditionElimination, MatchAnalyzer, MatchOptimizer, OptimizingMatchTranslator
Type Hierarchy Learn more about scaladoc diagrams
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. MatchApproximator
2. TreesAndTypesDomain
3. CheckableTreeAndTypeAnalysis
4. PropositionalLogic
5. TreeMakers
6. CodegenCore
7. TypedSubstitution
8. MatchMonadInterface
9. AnyRef
10. 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

### 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. #### final case class And(ops: Set[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. #### trait Casegen extends AbsCodegen

   Definition Classes
     CodegenCore

7. #### abstract class CommonCodegen extends AbsCodegen

   Definition Classes
     CodegenCore

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

   Definition Classes
     TreeMakers

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

   Definition Classes
     TreesAndTypesDomain

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      TreeMakers

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

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      PropositionalLogic

16. #### sealed trait NoNewBinders extends TreeMaker

    Definition Classes
      TreeMakers

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      PropositionalLogic

19. #### sealed trait PreserveSubPatBinders extends TreeMaker

    Definition Classes
      TreeMakers

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

21. #### class Prop extends AnyRef

    Definition Classes
      PropositionalLogic

22. #### trait PropMap extends AnyRef

    Definition Classes
      PropositionalLogic

23. #### trait PropTraverser extends AnyRef

    Definition Classes
      PropositionalLogic

24. #### final case class Solution(model: Model, unassigned: List[Sym]) extends Product with Serializable

    Definition Classes
      PropositionalLogic

25. #### abstract type Solvable

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      TreeMakers

27. #### class Substitution extends AnyRef

    Definition Classes
      TypedSubstitution

28. #### final class Sym extends Prop

    Definition Classes
      PropositionalLogic

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

30. #### type Tree = Global.Tree

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

31. #### abstract class TreeMaker extends AnyRef

    Definition Classes
      TreeMakers

32. #### class TreeMakersToProps extends AnyRef

33. #### class TreeMakersToPropsIgnoreNullChecks extends TreeMakersToProps

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

    Definition Classes
      TreeMakers

35. #### type Type = Global.Type

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

36. #### sealed class TypeConst extends Const

    Definition Classes
      TreesAndTypesDomain

37. #### trait TypeConstExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

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

39. #### sealed class ValueConst extends Const

    Definition Classes
      TreesAndTypesDomain

40. #### trait ValueConstExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

41. #### class Var extends AbsVar

    Definition Classes
      TreesAndTypesDomain

42. #### trait VarExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

### Abstract Value Members

1. #### abstract val EmptyModel: Model

   Definition Classes
     PropositionalLogic

2. #### abstract val NoModel: Model

   Definition Classes
     PropositionalLogic

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

   Definition Classes
     TreeMakers

4. #### abstract def codegen: AbsCodegen

   Definition Classes
     CodegenCore

5. #### abstract def eqFreePropToSolvable(f: Prop): Solvable

   Definition Classes
     PropositionalLogic

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

   Definition Classes
     PropositionalLogic

7. #### abstract def findModelFor(solvable: Solvable): Model

   Definition Classes
     PropositionalLogic

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

   Definition Classes
     TreeMakers

9. #### abstract def reportWarning(message: String): Unit

   Definition Classes
     PropositionalLogic

10. #### abstract val typer: (analyzer)#Typer

    Definition Classes
      CheckableTreeAndTypeAnalysis

### Concrete 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 MatchApproximator to any2stringadd[MatchApproximator] performed by method any2stringadd in scala.Predef.
   Definition Classes
     any2stringadd

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

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

5. #### def /\(props: Iterable[Prop]): Serializable with Product 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 EmptySubstitution extends Substitution

   Definition Classes
     TypedSubstitution

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

    Definition Classes
      PropositionalLogic

11. #### object IrrefutableExtractorTreeMaker

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

13. #### object Or extends Serializable

    Definition Classes
      PropositionalLogic

14. #### object Substitution

    Definition Classes
      TypedSubstitution

15. #### object Sym

    Definition Classes
      PropositionalLogic

16. #### object Test extends Serializable

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

    Definition Classes
      PropositionalLogic

18. #### object TypeConst extends TypeConstExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

19. #### object TypeTestTreeMaker extends Serializable

    Definition Classes
      TreeMakers

20. #### object ValueConst extends ValueConstExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

21. #### object Var extends VarExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

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

    Definition Classes
      PropositionalLogic

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

24. #### 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`.

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

    Definition Classes
      PropositionalLogic

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

    Attributes
      protected

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

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

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

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

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

    Definition Classes
      TreeMakers

32. #### val debugInfoEmitVars: Boolean

    Attributes
      protected
    Definition Classes
      TreeMakers

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

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

    Definition Classes
      TreeMakers

35. #### def ensuring(cond: (MatchApproximator) ⇒ Boolean, msg: ⇒ Any): MatchApproximator

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

36. #### def ensuring(cond: (MatchApproximator) ⇒ Boolean): MatchApproximator

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

37. #### def ensuring(cond: Boolean, msg: ⇒ Any): MatchApproximator

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

38. #### def ensuring(cond: Boolean): MatchApproximator

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

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

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

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

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

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

    Attributes
      protected
    Definition Classes
      TreeMakers

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

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

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

    Definition Classes
      CodegenCore

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

    Definition Classes
      CodegenCore

47. #### def gatherSymbols(p: Prop): Set[Sym]

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      PropositionalLogic

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

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

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

52. #### val matchOwner: Global.Symbol

    Definition Classes
      MatchMonadInterface

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

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

    Definition Classes
      CodegenCore

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

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

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

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      MatchMonadInterface

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

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

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

    Definition Classes
      AnyRef

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

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

73. #### def →[B](y: B): (MatchApproximator, B)

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

### Inherited from MatchApproximation.TreesAndTypesDomain

### Inherited from MatchApproximation.CheckableTreeAndTypeAnalysis

### Inherited from MatchApproximation.PropositionalLogic

### Inherited from MatchApproximation.TreeMakers

### Inherited from MatchApproximation.CodegenCore

### Inherited from MatchApproximation.TypedSubstitution

### Inherited from MatchApproximation.MatchMonadInterface

### Inherited from AnyRef

### Inherited from Any

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

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

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

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

### Ungrouped