Trait

scala.tools.nsc.transform.patmat.MatchOptimization

CommonSubconditionElimination

Related Doc: package MatchOptimization

Permalink

trait CommonSubconditionElimination extends OptimizedCodegen with MatchApproximator

Source
MatchOptimization.scala
Linear Supertypes
Known Subclasses
Type Hierarchy
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. trait AbsCodegen extends AnyRef

    Permalink
    Definition Classes
    CodegenCore
  2. trait AbsVar extends AnyRef

    Permalink
    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

    Permalink
    Definition Classes
    TreeMakers
  4. final case class And(ops: Set[Prop]) extends Prop with Product with Serializable

    Permalink
    Definition Classes
    PropositionalLogic
  5. final case class AtMostOne(ops: List[Sym]) extends Prop with Product with Serializable

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

    Permalink
    Definition Classes
    TreeMakers
  7. trait Casegen extends AbsCodegen

    Permalink
    Definition Classes
    CodegenCore
  8. abstract class CommonCodegen extends AbsCodegen

    Permalink
    Definition Classes
    CodegenCore
  9. sealed abstract class CondTreeMaker extends FunTreeMaker

    Permalink
    Definition Classes
    TreeMakers
  10. sealed abstract class Const extends AnyRef

    Permalink
    Definition Classes
    TreesAndTypesDomain
  11. final case class Eq(p: Var, q: Const) extends Prop with Product with Serializable

    Permalink
    Definition Classes
    PropositionalLogic
  12. case class EqualityTestTreeMaker(prevBinder: Global.Symbol, patTree: Global.Tree, pos: Global.Position) extends CondTreeMaker with Product with Serializable

    Permalink
    Definition Classes
    TreeMakers
  13. 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

    Permalink

    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
  14. sealed abstract class FunTreeMaker extends TreeMaker

    Permalink
    Definition Classes
    TreeMakers
  15. case class GuardTreeMaker(guardTree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable

    Permalink
    Definition Classes
    TreeMakers
  16. type Model = Map[Sym, Boolean]

    Permalink
    Definition Classes
    PropositionalLogic
  17. sealed trait NoNewBinders extends TreeMaker

    Permalink
    Definition Classes
    TreeMakers
  18. final case class Not(a: Prop) extends Prop with Product with Serializable

    Permalink
    Definition Classes
    PropositionalLogic
  19. final case class Or(ops: Set[Prop]) extends Prop with Product with Serializable

    Permalink
    Definition Classes
    PropositionalLogic
  20. sealed trait PreserveSubPatBinders extends TreeMaker

    Permalink
    Definition Classes
    TreeMakers
  21. 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

    Permalink

    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
  22. class Prop extends AnyRef

    Permalink
    Definition Classes
    PropositionalLogic
  23. trait PropMap extends AnyRef

    Permalink
    Definition Classes
    PropositionalLogic
  24. trait PropTraverser extends AnyRef

    Permalink
    Definition Classes
    PropositionalLogic
  25. class ReusedCondTreeMaker extends TreeMaker

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

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

    Permalink
    Definition Classes
    PropositionalLogic
  28. abstract type Solvable

    Permalink
    Definition Classes
    PropositionalLogic
  29. case class SubstOnlyTreeMaker(prevBinder: Global.Symbol, nextBinder: Global.Symbol) extends TreeMaker with Product with Serializable

    Permalink
    Definition Classes
    TreeMakers
  30. class Substitution extends AnyRef

    Permalink
    Definition Classes
    TypedSubstitution
  31. final class Sym extends Prop

    Permalink
    Definition Classes
    PropositionalLogic
  32. case class Test(prop: MatchApproximator.Prop, treeMaker: MatchApproximator.TreeMaker) extends Product with Serializable

    Permalink
    Definition Classes
    MatchApproximator
  33. type Tree = Global.Tree

    Permalink
  34. abstract class TreeMaker extends AnyRef

    Permalink
    Definition Classes
    TreeMakers
  35. class TreeMakersToProps extends AnyRef

    Permalink
    Definition Classes
    MatchApproximator
  36. class TreeMakersToPropsIgnoreNullChecks extends TreeMakersToProps

    Permalink
    Definition Classes
    MatchApproximator
  37. case class TrivialTreeMaker(tree: Global.Tree) extends TreeMaker with NoNewBinders with Product with Serializable

    Permalink
    Definition Classes
    TreeMakers
  38. type Type = Global.Type

    Permalink
  39. sealed class TypeConst extends Const

    Permalink
    Definition Classes
    TreesAndTypesDomain
  40. trait TypeConstExtractor extends AnyRef

    Permalink
    Definition Classes
    PropositionalLogic
  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

    Permalink

    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 class ValueConst extends Const

    Permalink
    Definition Classes
    TreesAndTypesDomain
  43. trait ValueConstExtractor extends AnyRef

    Permalink
    Definition Classes
    PropositionalLogic
  44. class Var extends AbsVar

    Permalink
    Definition Classes
    TreesAndTypesDomain
  45. trait VarExtractor extends AnyRef

    Permalink
    Definition Classes
    PropositionalLogic

Abstract Value Members

  1. abstract val EmptyModel: Model

    Permalink
    Definition Classes
    PropositionalLogic
  2. abstract val NoModel: Model

    Permalink
    Definition Classes
    PropositionalLogic
  3. abstract def analyzeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type, suppression: MatchOptimization.Suppression): Unit

    Permalink
    Definition Classes
    TreeMakers
  4. abstract def eqFreePropToSolvable(f: Prop): Solvable

    Permalink
    Definition Classes
    PropositionalLogic
  5. abstract def findAllModelsFor(solvable: Solvable, pos: Position = NoPosition): List[Solution]

    Permalink
    Definition Classes
    PropositionalLogic
  6. abstract def findModelFor(solvable: Solvable): Model

    Permalink
    Definition Classes
    PropositionalLogic
  7. abstract def optimizeCases(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Global.Type): (List[List[TreeMaker]], List[Global.Tree])

    Permalink
    Definition Classes
    TreeMakers
  8. abstract def reportWarning(message: String): Unit

    Permalink
    Definition Classes
    PropositionalLogic
  9. abstract val typer: (analyzer)#Typer

    Permalink
    Definition Classes
    CheckableTreeAndTypeAnalysis
  10. abstract def uncheckedWarning(pos: Position, msg: String): Unit

    Permalink
    Definition Classes
    PropositionalLogic

Concrete Value Members

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

    Permalink

    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

    Permalink

    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

    Permalink
    Implicit information
    This member is added by an implicit conversion from CommonSubconditionElimination to any2stringadd[CommonSubconditionElimination] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (CommonSubconditionElimination, B)

    Permalink
    Implicit information
    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()
  5. def /\(props: Iterable[Prop]): Serializable with Product with Prop

    Permalink
    Definition Classes
    PropositionalLogic
  6. final def ==(arg0: Any): Boolean

    Permalink

    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
  7. object AnalysisBudget

    Permalink
    Definition Classes
    PropositionalLogic
  8. object And extends Serializable

    Permalink
    Definition Classes
    PropositionalLogic
  9. object Const

    Permalink
    Definition Classes
    TreesAndTypesDomain
  10. object EmptySubstitution extends Substitution

    Permalink
    Definition Classes
    TypedSubstitution
  11. object False extends Prop with Product with Serializable

    Permalink
    Definition Classes
    PropositionalLogic
  12. object IrrefutableExtractorTreeMaker

    Permalink
    Definition Classes
    TreeMakers
  13. object NullConst extends Const with Product with Serializable

    Permalink
  14. object Or extends Serializable

    Permalink
    Definition Classes
    PropositionalLogic
  15. object ReusedCondTreeMaker

    Permalink
  16. object Substitution

    Permalink
    Definition Classes
    TypedSubstitution
  17. object Sym

    Permalink
    Definition Classes
    PropositionalLogic
  18. object Test extends Serializable

    Permalink
    Definition Classes
    MatchApproximator
  19. object True extends Prop with Product with Serializable

    Permalink
    Definition Classes
    PropositionalLogic
  20. object TypeConst extends TypeConstExtractor

    Permalink
  21. object TypeTestTreeMaker extends Serializable

    Permalink
    Definition Classes
    TreeMakers
  22. object ValueConst extends ValueConstExtractor

    Permalink
  23. object Var extends VarExtractor

    Permalink
  24. def \/(props: Iterable[Prop]): Serializable with Product with Prop

    Permalink
    Definition Classes
    PropositionalLogic
  25. def approximateMatchConservative(root: Global.Symbol, cases: List[List[TreeMaker]]): List[List[Test]]

    Permalink
    Definition Classes
    MatchApproximator
  26. final def asInstanceOf[T0]: T0

    Permalink

    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.

  27. val budgetProp: sys.Prop[String]

    Permalink
    Definition Classes
    PropositionalLogic
  28. final def caseWithoutBodyToProp(tests: List[Test]): Prop

    Permalink
    Attributes
    protected
    Definition Classes
    MatchApproximator
  29. def checkableType(tp: Global.Type): Global.Type

    Permalink
    Definition Classes
    CheckableTreeAndTypeAnalysis
  30. def clone(): AnyRef

    Permalink

    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

  31. def codegen: AbsCodegen

    Permalink
    Definition Classes
    OptimizedCodegenCodegenCore
  32. 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

    Permalink
    Definition Classes
    TreeMakers
  33. 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

    Permalink
    Definition Classes
    TreeMakers
  34. def combineExtractors(treeMakers: List[TreeMaker])(casegen: Casegen): Global.Tree

    Permalink
    Definition Classes
    TreeMakers
  35. val debugInfoEmitVars: Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    TreeMakers
  36. def doCSE(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type): List[List[TreeMaker]]

    Permalink

    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)

  37. 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]

    Permalink
    Definition Classes
    TreeMakers
  38. def emitTypeSwitch(bindersAndCases: List[(Global.Symbol, List[TreeMaker])], pt: Global.Type): Option[List[Global.CaseDef]]

    Permalink
    Definition Classes
    TreeMakers
  39. def ensuring(cond: (CommonSubconditionElimination) ⇒ Boolean, msg: ⇒ Any): CommonSubconditionElimination

    Permalink
    Implicit information
    This member is added by an implicit conversion from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  40. def ensuring(cond: (CommonSubconditionElimination) ⇒ Boolean): CommonSubconditionElimination

    Permalink
    Implicit information
    This member is added by an implicit conversion from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  41. def ensuring(cond: Boolean, msg: ⇒ Any): CommonSubconditionElimination

    Permalink
    Implicit information
    This member is added by an implicit conversion from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  42. def ensuring(cond: Boolean): CommonSubconditionElimination

    Permalink
    Implicit information
    This member is added by an implicit conversion from CommonSubconditionElimination to Ensuring[CommonSubconditionElimination] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  43. def enumerateSubtypes(tp: Global.Type, grouped: Boolean): List[List[Global.Type]]

    Permalink
    Definition Classes
    CheckableTreeAndTypeAnalysis
  44. final def eq(arg0: AnyRef): Boolean

    Permalink

    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
  45. def equals(arg0: Any): Boolean

    Permalink

    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
  46. def finalize(): Unit

    Permalink

    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

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

    Permalink
    Attributes
    protected
    Definition Classes
    TreeMakers
  48. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    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()
  49. def freshName(prefix: String): Global.TermName

    Permalink
    Definition Classes
    CodegenCore
  50. def freshSym(pos: Global.Position, tp: Global.Type = NoType, prefix: String = "x"): Global.TermSymbol

    Permalink
    Definition Classes
    CodegenCore
  51. def gatherSymbols(p: Prop): Set[Sym]

    Permalink
    Definition Classes
    PropositionalLogic
  52. def gatherVariables(p: Prop): Set[Var]

    Permalink
    Definition Classes
    PropositionalLogic
  53. final def getClass(): Class[_]

    Permalink

    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

  54. def hashCode(): Int

    Permalink

    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
  55. final def isInstanceOf[T0]: Boolean

    Permalink

    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
  56. val matchOwner: Global.Symbol

    Permalink
    Definition Classes
    MatchMonadInterface
  57. final def ne(arg0: AnyRef): Boolean

    Permalink

    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
  58. def newSynthCaseLabel(name: String): Global.MethodSymbol

    Permalink
    Definition Classes
    CodegenCore
  59. final def notify(): Unit

    Permalink

    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

  60. final def notifyAll(): Unit

    Permalink

    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

  61. object optimizedCodegen extends CommonCodegen

    Permalink
    Definition Classes
    OptimizedCodegen
  62. def prepareNewAnalysis(): Unit

    Permalink
  63. def propToSolvable(p: Prop): Solvable

    Permalink
    Definition Classes
    PropositionalLogic
  64. def propagateSubstitution(treeMakers: List[TreeMaker], initial: Substitution): List[TreeMaker]

    Permalink
    Definition Classes
    TreeMakers
  65. def pureType(tp: Global.Type): Global.Type

    Permalink
    Definition Classes
    MatchMonadInterface
  66. def removeSubstOnly(makers: List[TreeMaker]): collection.immutable.List[TreeMaker]

    Permalink
    Definition Classes
    TreeMakers
  67. def removeVarEq(props: List[Prop], modelNull: Boolean = false): (Prop, List[Prop])

    Permalink
    Definition Classes
    PropositionalLogic
  68. def reportMissingCases(pos: Global.Position, counterExamples: List[String]): Unit

    Permalink
    Definition Classes
    MatchMonadInterface
  69. def reportUnreachable(pos: Global.Position): Unit

    Permalink
    Definition Classes
    MatchMonadInterface
  70. def showTreeMakers(cases: List[List[TreeMaker]]): Unit

    Permalink
    Definition Classes
    MatchApproximator
  71. def simplify(f: Prop): Prop

    Permalink

    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
  72. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  73. def toString(): String

    Permalink

    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
  74. def uncheckableType(tp: Global.Type): Boolean

    Permalink
    Definition Classes
    CheckableTreeAndTypeAnalysis
  75. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  76. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  77. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  78. def [B](y: B): (CommonSubconditionElimination, B)

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

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