scala.tools.nsc.typechecker.PatternMatching

SymbolicMatchAnalysis

trait SymbolicMatchAnalysis extends TreeMakerApproximation with Logic

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

Self Type
SymbolicMatchAnalysis with CodegenCore
Source
PatternMatching.scala
Linear Supertypes
Logic, TreeMakerApproximation, Prettification, TreeMakers, TypedSubstitution, MatchMonadInterface, AnyRef, Any
Known Subclasses
MatchOptimizations, OptimizingMatchTranslator
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. SymbolicMatchAnalysis
  2. Logic
  3. TreeMakerApproximation
  4. Prettification
  5. TreeMakers
  6. TypedSubstitution
  7. MatchMonadInterface
  8. AnyRef
  9. Any
Implicitly
  1. by any2stringadd
  2. by any2stringfmt
  3. by any2ArrowAssoc
  4. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. trait AbsVar extends AnyRef

    Definition Classes
    Logic

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

    Definition Classes
    TreeMakers

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

    Definition Classes
    Logic

  4. case class AndCond(a: (TreeMakerApproximation.this)#Cond, b: (TreeMakerApproximation.this)#Cond) extends (TreeMakerApproximation.this)#Cond with Product with Serializable

    Definition Classes
    TreeMakerApproximation

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

    Definition Classes
    TreeMakers

  6. abstract class Cond extends AnyRef

    Definition Classes
    TreeMakerApproximation

  7. abstract class CondTreeMaker extends (TreeMakers.this)#FunTreeMaker

    Definition Classes
    TreeMakers

  8. sealed abstract class Const extends AnyRef

    Definition Classes
    SymbolicMatchAnalysis → Logic

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

  10. class CounterExample extends AnyRef

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

    Definition Classes
    Logic

  12. class EqualityCond extends (TreeMakerApproximation.this)#Cond

    Definition Classes
    TreeMakerApproximation

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

    Definition Classes
    TreeMakers

  14. case class ExtractorTreeMaker(extractor: Global.Tree, extraCond: Option[Global.Tree], nextBinder: Global.Symbol)(subPatBinders: List[Global.Symbol], subPatRefs: List[Global.Tree], extractorReturnsBoolean: Boolean, checkedLength: Option[Int], prevBinder: Global.Symbol) extends (TreeMakers.this)#FunTreeMaker with (TreeMakers.this)#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).

  15. abstract type Formula

    Definition Classes
    Logic

  16. abstract class FunTreeMaker extends (TreeMakers.this)#TreeMaker

    Definition Classes
    TreeMakers

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

    Definition Classes
    TreeMakers

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

  19. type Model = Map[(SymbolicMatchAnalysis.this)#Sym, Boolean]

    Definition Classes
    Logic

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

  21. trait NoNewBinders extends (TreeMakers.this)#TreeMaker

    Definition Classes
    TreeMakers

  22. class NonNullCond extends (TreeMakerApproximation.this)#Cond

    Definition Classes
    TreeMakerApproximation

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

    Definition Classes
    Logic

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

    Definition Classes
    Logic

  25. case class OrCond(a: (TreeMakerApproximation.this)#Cond, b: (TreeMakerApproximation.this)#Cond) extends (TreeMakerApproximation.this)#Cond with Product with Serializable

    Definition Classes
    TreeMakerApproximation

  26. trait PreserveSubPatBinders extends (TreeMakers.this)#TreeMaker

    Definition Classes
    TreeMakers

  27. case class ProductExtractorTreeMaker(prevBinder: Global.Symbol, extraCond: Option[Global.Tree])(subPatBinders: List[Global.Symbol], subPatRefs: List[Global.Tree], mutableBinders: List[Global.Symbol]) extends (TreeMakers.this)#FunTreeMaker with (TreeMakers.this)#PreserveSubPatBinders with Product with Serializable

    An optimized version of ExtractorTreeMaker for Products.

  28. class Prop extends AnyRef

    Definition Classes
    Logic

  29. trait PropMap extends AnyRef

    Definition Classes
    Logic

  30. trait PropTraverser extends AnyRef

    Definition Classes
    Logic

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

    Definition Classes
    TreeMakers

  32. class Substitution extends AnyRef

    Definition Classes
    TypedSubstitution

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

    Definition Classes
    Logic

  34. case class Test(cond: (TreeMakerApproximation.this)#Cond, treeMaker: (TreeMakerApproximation.this)#TreeMaker) extends Product with Serializable

    Definition Classes
    TreeMakerApproximation

  35. abstract class TreeMaker extends AnyRef

    Definition Classes
    TreeMakers

  36. class TreeMakersToConds extends AnyRef

    Definition Classes
    TreeMakerApproximation

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

    Definition Classes
    TreeMakers

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

  39. class TypeCond extends (TreeMakerApproximation.this)#Cond

    Definition Classes
    TreeMakerApproximation

  40. sealed class TypeConst extends (SymbolicMatchAnalysis.this)#Const

    Definition Classes
    SymbolicMatchAnalysis → Logic

  41. trait TypeConstExtractor extends AnyRef

    Definition Classes
    Logic

  42. case class TypeExample(c: (SymbolicMatchAnalysis.this)#Const) extends (SymbolicMatchAnalysis.this)#CounterExample with Product with Serializable

  43. case class TypeTestTreeMaker(prevBinder: Global.Symbol, testedBinder: Global.Symbol, expectedTp: Global.Type, nextBinderTp: Global.Type)(pos: Global.Position, extractorArgTypeTest: Boolean = false) extends (TreeMakers.this)#CondTreeMaker with Product with Serializable

    implements the run-time aspects of (§8.

  44. sealed class ValueConst extends (SymbolicMatchAnalysis.this)#Const

  45. case class ValueExample(c: (SymbolicMatchAnalysis.this)#ValueConst) extends (SymbolicMatchAnalysis.this)#CounterExample with Product with Serializable

  46. class Var extends (SymbolicMatchAnalysis.this)#AbsVar

    Definition Classes
    SymbolicMatchAnalysis → Logic

Abstract Value Members

  1. abstract val EmptyModel: (SymbolicMatchAnalysis.this)#Model

    Definition Classes
    Logic

  2. abstract val NoModel: (SymbolicMatchAnalysis.this)#Model

    Definition Classes
    Logic

  3. abstract def andFormula(a: (SymbolicMatchAnalysis.this)#Formula, b: (SymbolicMatchAnalysis.this)#Formula): (SymbolicMatchAnalysis.this)#Formula

    Definition Classes
    Logic

  4. abstract def cnfString(f: (SymbolicMatchAnalysis.this)#Formula): String

    Definition Classes
    Logic

  5. abstract def eqFreePropToSolvable(p: (SymbolicMatchAnalysis.this)#Prop): (SymbolicMatchAnalysis.this)#Formula

    Definition Classes
    Logic

  6. abstract def findAllModelsFor(f: (SymbolicMatchAnalysis.this)#Formula): List[(SymbolicMatchAnalysis.this)#Model]

    Definition Classes
    Logic

  7. abstract def findModelFor(f: (SymbolicMatchAnalysis.this)#Formula): (SymbolicMatchAnalysis.this)#Model

    Definition Classes
    Logic

  8. abstract def inMatchMonad(tp: Global.Type): Global.Type

    Definition Classes
    MatchMonadInterface

  9. abstract def matchMonadSym: Global.Symbol

    Attributes
    protected
    Definition Classes
    MatchMonadInterface

  10. abstract def pureType(tp: Global.Type): Global.Type

    Definition Classes
    MatchMonadInterface

  11. abstract val typer: (analyzer)#Typer

    Definition Classes
    MatchMonadInterface

Concrete Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. def +(other: String): String

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

  5. def ->[B](y: B): (SymbolicMatchAnalysis, B)

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

  6. def /\(props: Iterable[(SymbolicMatchAnalysis.this)#Prop]): (SymbolicMatchAnalysis.this)#Prop

    Definition Classes
    Logic

  7. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  8. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  9. object Cond

    Definition Classes
    TreeMakerApproximation

  10. object Const

  11. object CounterExample

  12. object EmptySubstitution extends Substitution

    Definition Classes
    TypedSubstitution

  13. object EqualityCond

    Definition Classes
    TreeMakerApproximation

  14. object False extends Prop with Product with Serializable

    Definition Classes
    Logic

  15. object FalseCond extends (TreeMakerApproximation.this)#Cond with Product with Serializable

    Definition Classes
    TreeMakerApproximation

  16. object IrrefutableExtractorTreeMaker

    Definition Classes
    TreeMakerApproximation

  17. object NoExample extends (SymbolicMatchAnalysis.this)#CounterExample with Product with Serializable

  18. object NonNullCond

    Definition Classes
    TreeMakerApproximation

  19. object NullConst extends (SymbolicMatchAnalysis.this)#Const with Product with Serializable

    Definition Classes
    SymbolicMatchAnalysis → Logic

  20. lazy val NullTp: Global.UniqueConstantType

  21. object Substitution

    Definition Classes
    TypedSubstitution

  22. object Test extends Serializable

    Definition Classes
    TreeMakerApproximation

  23. object True extends Prop with Product with Serializable

    Definition Classes
    Logic

  24. object TrueCond extends (TreeMakerApproximation.this)#Cond with Product with Serializable

    Definition Classes
    TreeMakerApproximation

  25. object TypeCond

    Definition Classes
    TreeMakerApproximation

  26. object TypeConst extends (SymbolicMatchAnalysis.this)#TypeConstExtractor

    Definition Classes
    SymbolicMatchAnalysis → Logic

  27. object TypeTestTreeMaker extends Serializable

    Definition Classes
    TreeMakers

  28. object ValueConst

  29. object Var

  30. object WildcardExample extends (SymbolicMatchAnalysis.this)#CounterExample with Product with Serializable

  31. def \/(props: Iterable[(SymbolicMatchAnalysis.this)#Prop]): (SymbolicMatchAnalysis.this)#Prop

    Definition Classes
    Logic

  32. def alignAcrossRows(xss: List[List[AnyRef]], sep: String, lineSep: String = "\n"): String

    Definition Classes
    Prettification

  33. def alignedColumns(cols: Seq[AnyRef]): Seq[String]

    Definition Classes
    Prettification

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

    Definition Classes
    TreeMakerApproximation

  35. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  36. def checkableType(tp: Global.Type): Global.Type

  37. def clone(): AnyRef

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

  38. def combineCases(scrut: Global.Tree, scrutSym: Global.Symbol, casesRaw: List[List[(SymbolicMatchAnalysis.this)#TreeMaker]], pt: Global.Type, owner: Global.Symbol, matchFailGenOverride: Option[(Global.Tree) ⇒ Global.Tree]): Global.Tree

    Definition Classes
    TreeMakers

  39. def combineCasesNoSubstOnly(scrut: Global.Tree, scrutSym: Global.Symbol, casesNoSubstOnly: List[List[(SymbolicMatchAnalysis.this)#TreeMaker]], pt: Global.Type, owner: Global.Symbol, matchFailGenOverride: Option[(Global.Tree) ⇒ Global.Tree]): Global.Tree

    Definition Classes
    TreeMakers

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

    Definition Classes
    TreeMakers

  41. val debugInfoEmitVars: Boolean

    Attributes
    protected
    Definition Classes
    TreeMakers

  42. def emitSwitch(scrut: Global.Tree, scrutSym: Global.Symbol, cases: List[List[(SymbolicMatchAnalysis.this)#TreeMaker]], pt: Global.Type, matchFailGenOverride: Option[(Global.Tree) ⇒ Global.Tree], unchecked: Boolean): Option[Global.Tree]

    Definition Classes
    TreeMakers

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

    Definition Classes
    TreeMakers

  44. def ensuring(cond: (SymbolicMatchAnalysis) ⇒ Boolean, msg: ⇒ Any): SymbolicMatchAnalysis

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

  45. def ensuring(cond: (SymbolicMatchAnalysis) ⇒ Boolean): SymbolicMatchAnalysis

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

  46. def ensuring(cond: Boolean, msg: ⇒ Any): SymbolicMatchAnalysis

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

  47. def ensuring(cond: Boolean): SymbolicMatchAnalysis

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

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

  49. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  50. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

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

  52. def finalize(): Unit

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

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

    Attributes
    protected
    Definition Classes
    TreeMakers

  54. def formatted(fmtstr: String): String

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

  55. def gatherVariables(p: (SymbolicMatchAnalysis.this)#Prop): Set[(SymbolicMatchAnalysis.this)#Var]

    Definition Classes
    Logic

  56. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  57. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  58. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  59. final def matchMonadResult(tp: Global.Type): Global.Type

    Definition Classes
    MatchMonadInterface

  60. val matchOwner: Global.Symbol

    Definition Classes
    MatchMonadInterface

  61. def modelString(model: (SymbolicMatchAnalysis.this)#Model): String

  62. def modelToCounterExample(scrutVar: (SymbolicMatchAnalysis.this)#Var)(model: (SymbolicMatchAnalysis.this)#Model): (SymbolicMatchAnalysis.this)#CounterExample

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

  64. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  65. def needsTypeTest(tp: Global.Type, pt: Global.Type): Boolean

    Definition Classes
    TreeMakers

  66. final def notify(): Unit

    Definition Classes
    AnyRef

  67. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  68. def optimizeCases(prevBinder: Global.Symbol, cases: List[List[(SymbolicMatchAnalysis.this)#TreeMaker]], pt: Global.Type, unchecked: Boolean): (List[List[(SymbolicMatchAnalysis.this)#TreeMaker]], List[Global.Tree])

    Definition Classes
    TreeMakers

  69. def prepareNewAnalysis(): Unit

  70. def propToSolvable(p: (SymbolicMatchAnalysis.this)#Prop): (SymbolicMatchAnalysis.this)#Formula

    Definition Classes
    Logic

  71. def propagateSubstitution(treeMakers: List[(SymbolicMatchAnalysis.this)#TreeMaker], initial: (SymbolicMatchAnalysis.this)#Substitution): List[(SymbolicMatchAnalysis.this)#TreeMaker]

    Definition Classes
    TreeMakers

  72. def removeSubstOnly(makers: List[(SymbolicMatchAnalysis.this)#TreeMaker]): collection.immutable.List[(SymbolicMatchAnalysis.this)#TreeMaker]

    Definition Classes
    TreeMakers

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

    Definition Classes
    Logic

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

    Definition Classes
    MatchMonadInterface

  75. def reportUnreachable(pos: Global.Position): Unit

    Definition Classes
    MatchMonadInterface

  76. def sameValue(a: Global.Tree, b: Global.Tree): Boolean

    Definition Classes
    TreeMakerApproximation

  77. def showTests(testss: List[List[(SymbolicMatchAnalysis.this)#Test]]): Unit

    Definition Classes
    TreeMakerApproximation

  78. def showTreeMakers(cases: List[List[(SymbolicMatchAnalysis.this)#TreeMaker]]): Unit

    Definition Classes
    TreeMakerApproximation

  79. def symbolicCase(tests: List[(SymbolicMatchAnalysis.this)#Test], modelNull: Boolean = false): (SymbolicMatchAnalysis.this)#Prop

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

    Definition Classes
    AnyRef

  81. def toString(): String

    Definition Classes
    AnyRef → Any

  82. def uncheckableType(tp: Global.Type): Boolean

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

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

  85. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  87. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

  88. def →[B](y: B): (SymbolicMatchAnalysis, B)

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

Shadowed Implict Value Members

  1. val self: Any

    Implicit information
    This member is added by an implicit conversion from SymbolicMatchAnalysis to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (symbolicMatchAnalysis: StringAdd).self
    Definition Classes
    StringAdd

  2. val self: Any

    Implicit information
    This member is added by an implicit conversion from SymbolicMatchAnalysis to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (symbolicMatchAnalysis: StringFormat).self
    Definition Classes
    StringFormat

Deprecated Value Members

  1. def x: SymbolicMatchAnalysis

    Implicit information
    This member is added by an implicit conversion from SymbolicMatchAnalysis to ArrowAssoc[SymbolicMatchAnalysis] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (symbolicMatchAnalysis: ArrowAssoc[SymbolicMatchAnalysis]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: SymbolicMatchAnalysis

    Implicit information
    This member is added by an implicit conversion from SymbolicMatchAnalysis to Ensuring[SymbolicMatchAnalysis] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (symbolicMatchAnalysis: Ensuring[SymbolicMatchAnalysis]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from Logic

Inherited from TreeMakerApproximation

Inherited from Prettification

Inherited from TreeMakers

Inherited from TypedSubstitution

Inherited from MatchMonadInterface

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from SymbolicMatchAnalysis to StringAdd

Inherited by implicit conversion any2stringfmt from SymbolicMatchAnalysis to StringFormat

Inherited by implicit conversion any2ArrowAssoc from SymbolicMatchAnalysis to ArrowAssoc[SymbolicMatchAnalysis]

Inherited by implicit conversion any2Ensuring from SymbolicMatchAnalysis to Ensuring[SymbolicMatchAnalysis]

Ungrouped