Packages

t

scala.tools.nsc.transform.patmat.MatchOptimization

CommonSubconditionElimination

trait CommonSubconditionElimination extends OptimizedCodegen with MatchApproximator

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CommonSubconditionElimination
  2. MatchApproximator
  3. TreesAndTypesDomain
  4. CheckableTreeAndTypeAnalysis
  5. PropositionalLogic
  6. TreeMakers
  7. OptimizedCodegen
  8. TypedSubstitution
  9. CodegenCore
  10. MatchMonadInterface
  11. AnyRef
  12. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class Substitution extends AnyRef
    Definition Classes
    TypedSubstitution
  2. trait AbsVar extends AnyRef
    Definition Classes
    PropositionalLogic
  3. final case class And (ops: Set[Prop]) extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  4. final case class AtMostOne (ops: List[Sym]) extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  5. final case class Eq (p: Var, q: Const) extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  6. final case class Not (a: Prop) extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  7. final case class Or (ops: Set[Prop]) extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  8. class Prop extends AnyRef
    Definition Classes
    PropositionalLogic
  9. trait PropMap extends AnyRef
    Definition Classes
    PropositionalLogic
  10. trait PropTraverser extends AnyRef
    Definition Classes
    PropositionalLogic
  11. final case class Solution (model: Model, unassigned: List[Sym]) extends Product with Serializable
    Definition Classes
    PropositionalLogic
  12. final class Sym extends Prop
    Definition Classes
    PropositionalLogic
  13. trait TypeConstExtractor extends AnyRef
    Definition Classes
    PropositionalLogic
  14. trait ValueConstExtractor extends AnyRef
    Definition Classes
    PropositionalLogic
  15. trait VarExtractor extends AnyRef
    Definition Classes
    PropositionalLogic
  16. case class Test (prop: MatchApproximator.Prop, treeMaker: MatchApproximator.TreeMaker) extends Product with Serializable
    Definition Classes
    MatchApproximator
  17. class TreeMakersToProps extends AnyRef
    Definition Classes
    MatchApproximator
  18. class TreeMakersToPropsIgnoreNullChecks extends TreeMakersToProps
    Definition Classes
    MatchApproximator
  19. trait AbsCodegen extends AnyRef
    Definition Classes
    CodegenCore
  20. trait Casegen extends AbsCodegen
    Definition Classes
    CodegenCore
  21. abstract class CommonCodegen extends AbsCodegen
    Definition Classes
    CodegenCore
  22. type Model = Map[Sym, Boolean]
    Definition Classes
    PropositionalLogic
  23. class ReusedCondTreeMaker extends TreeMaker
  24. case class ReusingCondTreeMaker (sharedPrefix: List[CommonSubconditionElimination.Test], toReused: (CommonSubconditionElimination.TreeMaker) ⇒ CommonSubconditionElimination.TreeMaker) extends TreeMaker with Product with Serializable
  25. abstract type Solvable
    Definition Classes
    PropositionalLogic
  26. type Tree = Global.Tree
    Definition Classes
    TreesAndTypesDomain → PropositionalLogic
  27. type Type = Global.Type
    Definition Classes
    TreesAndTypesDomain → PropositionalLogic
  28. case class AlternativesTreeMaker (prevBinder: Global.Symbol, altss: List[List[TreeMaker]], pos: Global.Position) extends TreeMaker with NoNewBinders with Product with Serializable
    Definition Classes
    TreeMakers
  29. case class BodyTreeMaker (body: Global.Tree, matchPt: Global.Type) extends TreeMaker with NoNewBinders with Product with Serializable
    Definition Classes
    TreeMakers
  30. sealed abstract class CondTreeMaker extends FunTreeMaker
    Definition Classes
    TreeMakers
  31. case class EqualityTestTreeMaker (prevBinder: Global.Symbol, patTree: Global.Tree, pos: Global.Position) extends CondTreeMaker with Product with Serializable
    Definition Classes
    TreeMakers
  32. 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
  33. sealed abstract class FunTreeMaker extends TreeMaker
    Definition Classes
    TreeMakers
  34. case class GuardTreeMaker (guardTree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable
    Definition Classes
    TreeMakers
  35. sealed trait NoNewBinders extends TreeMaker
    Definition Classes
    TreeMakers
  36. sealed trait PreserveSubPatBinders extends TreeMaker
    Definition Classes
    TreeMakers
  37. 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
  38. case class SubstOnlyTreeMaker (prevBinder: Global.Symbol, nextBinder: Global.Symbol) extends TreeMaker with Product with Serializable
    Definition Classes
    TreeMakers
  39. abstract class TreeMaker extends AnyRef
    Definition Classes
    TreeMakers
  40. case class TrivialTreeMaker (tree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable
    Definition Classes
    TreeMakers
  41. 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
  42. sealed abstract class Const extends AnyRef
    Definition Classes
    TreesAndTypesDomain
  43. sealed class TypeConst extends Const
    Definition Classes
    TreesAndTypesDomain
  44. sealed class ValueConst extends Const
    Definition Classes
    TreesAndTypesDomain
  45. class Var extends AbsVar
    Definition Classes
    TreesAndTypesDomain

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: MatchOptimization.Suppression): Unit
    Definition Classes
    TreeMakers
  4. abstract def eqFreePropToSolvable(f: Prop): Solvable
    Definition Classes
    PropositionalLogic
  5. abstract def findAllModelsFor(solvable: Solvable, pos: Position = NoPosition): List[Solution]
    Definition Classes
    PropositionalLogic
  6. abstract def findModelFor(solvable: Solvable): Model
    Definition Classes
    PropositionalLogic
  7. abstract def optimizeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type): (List[List[TreeMaker]], List[Global.Tree])
    Definition Classes
    TreeMakers
  8. abstract def reportWarning(message: String): Unit
    Definition Classes
    PropositionalLogic
  9. abstract val typer: (analyzer)#Typer
    Definition Classes
    CheckableTreeAndTypeAnalysis
  10. abstract def uncheckedWarning(pos: Position, msg: String): Unit
    Definition Classes
    PropositionalLogic

Concrete Value Members

  1. object EmptySubstitution extends Substitution
    Definition Classes
    TypedSubstitution
  2. object Substitution
    Definition Classes
    TypedSubstitution
  3. object AnalysisBudget
    Definition Classes
    PropositionalLogic
  4. object And extends Serializable
    Definition Classes
    PropositionalLogic
  5. object False extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  6. object Or extends Serializable
    Definition Classes
    PropositionalLogic
  7. object Sym
    Definition Classes
    PropositionalLogic
  8. object True extends Prop with Product with Serializable
    Definition Classes
    PropositionalLogic
  9. object Test extends Serializable
    Definition Classes
    MatchApproximator
  10. object optimizedCodegen extends CommonCodegen
    Definition Classes
    OptimizedCodegen
  11. 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
  12. 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
  13. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from CommonSubconditionElimination to any2stringadd[CommonSubconditionElimination] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  14. def ->[B](y: B): (CommonSubconditionElimination, B)
    Implicit
    This member is added by an implicit conversion from CommonSubconditionElimination to ArrowAssoc[CommonSubconditionElimination] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  15. def /\(props: Iterable[Prop]): Serializable with Product with Prop
    Definition Classes
    PropositionalLogic
  16. 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).

    returns

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

    Definition Classes
    AnyRef → Any
  17. def \/(props: Iterable[Prop]): Serializable with Product with Prop
    Definition Classes
    PropositionalLogic
  18. def approximateMatchConservative(root: Global.Symbol, cases: List[List[TreeMaker]]): List[List[Test]]
    Definition Classes
    MatchApproximator
  19. 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.

  20. val budgetProp: sys.Prop[String]
    Definition Classes
    PropositionalLogic
  21. final def caseWithoutBodyToProp(tests: List[Test]): Prop
    Attributes
    protected
    Definition Classes
    MatchApproximator
  22. def checkableType(tp: Global.Type): Global.Type
    Definition Classes
    CheckableTreeAndTypeAnalysis
  23. 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

  24. def codegen: AbsCodegen
    Definition Classes
    OptimizedCodegen → CodegenCore
  25. 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
  26. 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
  27. def combineExtractors(treeMakers: List[TreeMaker])(casegen: Casegen): Global.Tree
    Definition Classes
    TreeMakers
  28. val debugInfoEmitVars: Boolean
    Attributes
    protected
    Definition Classes
    TreeMakers
  29. 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)

  30. 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
  31. def emitTypeSwitch(bindersAndCases: List[(Global.Symbol, List[TreeMaker])], pt: Global.Type): Option[List[Global.CaseDef]]
    Definition Classes
    TreeMakers
  32. def ensuring(cond: (CommonSubconditionElimination) ⇒ Boolean, msg: ⇒ Any): CommonSubconditionElimination
    Implicit
    This member is added by an implicit conversion from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. def ensuring(cond: (CommonSubconditionElimination) ⇒ Boolean): CommonSubconditionElimination
    Implicit
    This member is added by an implicit conversion from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. def ensuring(cond: Boolean, msg: ⇒ Any): CommonSubconditionElimination
    Implicit
    This member is added by an implicit conversion from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. def ensuring(cond: Boolean): CommonSubconditionElimination
    Implicit
    This member is added by an implicit conversion from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  36. def enumerateSubtypes(tp: Global.Type, grouped: Boolean): List[List[Global.Type]]
    Definition Classes
    CheckableTreeAndTypeAnalysis
  37. final def eq(arg0: AnyRef): Boolean

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

    Tests whether the argument (that) 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
  38. 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
  39. 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

  40. def fixerUpper(origOwner: Global.Symbol, pos: Global.Position): Global.Traverser
    Attributes
    protected
    Definition Classes
    TreeMakers
  41. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from CommonSubconditionElimination to StringFormat[CommonSubconditionElimination] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  42. def freshName(prefix: String): Global.TermName
    Definition Classes
    CodegenCore
  43. def freshSym(pos: Global.Position, tp: Global.Type = NoType, prefix: String = "x"): Global.TermSymbol
    Definition Classes
    CodegenCore
  44. def gatherSymbols(p: Prop): Set[Sym]
    Definition Classes
    PropositionalLogic
  45. def gatherVariables(p: Prop): Set[Var]
    Definition Classes
    PropositionalLogic
  46. final def getClass(): Class[_]

    Returns the runtime class representation of the object.

    Returns the runtime class representation of the object.

    returns

    a class object corresponding to the runtime type of the receiver.

    Definition Classes
    AnyRef → Any
  47. 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
  48. 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
  49. val matchOwner: Global.Symbol
    Definition Classes
    MatchMonadInterface
  50. 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
  51. def newSynthCaseLabel(name: String): Global.MethodSymbol
    Definition Classes
    CodegenCore
  52. 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

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

  54. def prepareNewAnalysis(): Unit
    Definition Classes
    TreesAndTypesDomain → PropositionalLogic
  55. def propToSolvable(p: Prop): Solvable
    Definition Classes
    PropositionalLogic
  56. def propagateSubstitution(treeMakers: List[TreeMaker], initial: Substitution): List[TreeMaker]
    Definition Classes
    TreeMakers
  57. def pureType(tp: Global.Type): Global.Type
    Definition Classes
    MatchMonadInterface
  58. def removeSubstOnly(makers: List[TreeMaker]): collection.immutable.List[TreeMaker]
    Definition Classes
    TreeMakers
  59. def removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])
    Definition Classes
    PropositionalLogic
  60. def reportMissingCases(pos: Global.Position, counterExamples: List[String]): Unit
    Definition Classes
    MatchMonadInterface
  61. def reportUnreachable(pos: Global.Position): Unit
    Definition Classes
    MatchMonadInterface
  62. def showTreeMakers(cases: List[List[TreeMaker]]): Unit
    Definition Classes
    MatchApproximator
  63. 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
  64. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  65. 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
  66. def uncheckableType(tp: Global.Type): Boolean
    Definition Classes
    CheckableTreeAndTypeAnalysis
  67. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  68. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  69. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  70. def →[B](y: B): (CommonSubconditionElimination, B)
    Implicit
    This member is added by an implicit conversion from CommonSubconditionElimination to ArrowAssoc[CommonSubconditionElimination] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
  71. object ReusedCondTreeMaker
  72. object IrrefutableExtractorTreeMaker
    Definition Classes
    TreeMakers
  73. object TypeTestTreeMaker extends Serializable
    Definition Classes
    TreeMakers
  74. object Const
    Definition Classes
    TreesAndTypesDomain
  75. object NullConst extends Const with Product with Serializable
    Definition Classes
    TreesAndTypesDomain → PropositionalLogic
  76. object TypeConst extends TypeConstExtractor
    Definition Classes
    TreesAndTypesDomain → PropositionalLogic
  77. object ValueConst extends ValueConstExtractor
    Definition Classes
    TreesAndTypesDomain → PropositionalLogic
  78. object Var extends VarExtractor
    Definition Classes
    TreesAndTypesDomain → PropositionalLogic

Inherited from MatchOptimization.MatchApproximator

Inherited from MatchOptimization.TreesAndTypesDomain

Inherited from MatchOptimization.CheckableTreeAndTypeAnalysis

Inherited from MatchOptimization.PropositionalLogic

Inherited from MatchOptimization.TreeMakers

Inherited from MatchOptimization.OptimizedCodegen

Inherited from MatchOptimization.TypedSubstitution

Inherited from MatchOptimization.CodegenCore

Inherited from MatchOptimization.MatchMonadInterface

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from CommonSubconditionElimination to any2stringadd[CommonSubconditionElimination]

Inherited by implicit conversion StringFormat from CommonSubconditionElimination to StringFormat[CommonSubconditionElimination]

Inherited by implicit conversion Ensuring from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination]

Inherited by implicit conversion ArrowAssoc from CommonSubconditionElimination to ArrowAssoc[CommonSubconditionElimination]

Ungrouped