scala.tools.nsc.transform.patmat.MatchOptimization

# MatchOptimizer

#### trait MatchOptimizer extends OptimizedCodegen with SwitchEmission with CommonSubconditionElimination

Linear Supertypes
CommonSubconditionElimination, MatchOptimization.MatchApproximator, MatchOptimization.TreesAndTypesDomain, MatchOptimization.CheckableTreeAndTypeAnalysis, MatchOptimization.PropositionalLogic, SwitchEmission, MatchOptimization.TreeMakers, MatchOptimization.OptimizedCodegen, MatchOptimization.OptimizedMatchMonadInterface, MatchOptimization.TypedSubstitution, MatchOptimization.CodegenCore, MatchOptimization.MatchMonadInterface, AnyRef, Any
Known Subclasses
OptimizingMatchTranslator
Type Hierarchy Learn more about scaladoc diagrams
Ordering

1. Alphabetic
2. By inheritance

Inherited

1. MatchOptimizer
2. CommonSubconditionElimination
3. MatchApproximator
4. TreesAndTypesDomain
5. CheckableTreeAndTypeAnalysis
6. PropositionalLogic
7. SwitchEmission
8. TreeMakers
9. OptimizedCodegen
10. OptimizedMatchMonadInterface
11. TypedSubstitution
12. CodegenCore
13. MatchMonadInterface
14. AnyRef
15. 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 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: Position) extends TreeMaker with NoNewBinders with Product with Serializable

   Definition Classes
     TreeMakers

4. #### case class And (a: Prop, b: 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. #### abstract class CondTreeMaker extends FunTreeMaker

   Definition Classes
     TreeMakers

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

   Definition Classes
     TreesAndTypesDomain → PropositionalLogic

10. #### 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: 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], 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).

13. #### abstract type Formula

    Definition Classes
      PropositionalLogic

14. #### abstract type FormulaBuilder

    Definition Classes
      PropositionalLogic

15. #### abstract class FunTreeMaker extends TreeMaker

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      PropositionalLogic

18. #### trait NoNewBinders extends TreeMaker

    Definition Classes
      TreeMakers

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      PropositionalLogic

21. #### trait PreserveSubPatBinders extends TreeMaker

    Definition Classes
      TreeMakers

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

23. #### class Prop extends AnyRef

    Definition Classes
      PropositionalLogic

24. #### trait PropMap extends AnyRef

    Definition Classes
      PropositionalLogic

25. #### trait PropTraverser extends AnyRef

    Definition Classes
      PropositionalLogic

26. #### class RegularSwitchMaker extends SwitchMaker

    Definition Classes
      SwitchEmission

27. #### class ReusedCondTreeMaker extends TreeMaker

    Definition Classes
      CommonSubconditionElimination

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

    Definition Classes
      CommonSubconditionElimination

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

    Definition Classes
      TreeMakers

30. #### class Substitution extends AnyRef

    Definition Classes
      TypedSubstitution

31. #### abstract class SwitchMaker extends AnyRef

    Definition Classes
      SwitchEmission

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      MatchApproximator

34. #### type Tree = Global.Tree

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

35. #### abstract class TreeMaker extends AnyRef

    Definition Classes
      TreeMakers

36. #### class TreeMakersToProps extends AnyRef

    Definition Classes
      MatchApproximator

37. #### class TreeMakersToPropsIgnoreNullChecks extends TreeMakersToProps

    Definition Classes
      MatchApproximator

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

    Definition Classes
      TreeMakers

39. #### type Type = Global.Type

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

40. #### sealed class TypeConst extends Const

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

41. #### trait TypeConstExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

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

    implements the run-time aspects of (§8.

43. #### class UniqueSym extends Sym

    Definition Classes
      PropositionalLogic

44. #### sealed class ValueConst extends Const

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

45. #### trait ValueConstExtractor extends AnyRef

    Definition Classes
      PropositionalLogic

46. #### class Var extends AbsVar

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

47. #### 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 addFormula(buff: FormulaBuilder, f: Formula): Unit

   Definition Classes
     PropositionalLogic

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

   Definition Classes
     TreeMakers

5. #### abstract def andFormula(a: Formula, b: Formula): Formula

   Definition Classes
     PropositionalLogic

6. #### abstract def cnfString(f: Formula): String

   Definition Classes
     PropositionalLogic

7. #### abstract def eqFreePropToSolvable(p: Prop): Formula

   Definition Classes
     PropositionalLogic

8. #### abstract def findAllModelsFor(f: Formula): List[Model]

   Definition Classes
     PropositionalLogic

9. #### abstract def findModelFor(f: Formula): Model

   Definition Classes
     PropositionalLogic

10. #### abstract def formulaBuilder: FormulaBuilder

    Definition Classes
      PropositionalLogic

11. #### abstract def simplifyFormula(a: Formula): Formula

    Definition Classes
      PropositionalLogic

12. #### abstract def toFormula(buff: FormulaBuilder): Formula

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

### 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 MatchOptimizer to StringAdd performed by method any2stringadd in scala.Predef.
   Definition Classes
     StringAdd

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

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

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

   Definition Classes
     PropositionalLogic

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

   Definition Classes
     AnyRef

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

   Definition Classes
     Any

9. #### object AnalysisBudget

   Definition Classes
     PropositionalLogic

10. #### object Const

    Definition Classes
      TreesAndTypesDomain

11. #### object EmptySubstitution extends Substitution

    Definition Classes
      TypedSubstitution

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

    Definition Classes
      PropositionalLogic

13. #### object IrrefutableExtractorTreeMaker

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

15. #### lazy val NullTp: Global.UniqueConstantType

    Definition Classes
      TreesAndTypesDomain

16. #### object ReusedCondTreeMaker

    Definition Classes
      CommonSubconditionElimination

17. #### object Substitution

    Definition Classes
      TypedSubstitution

18. #### object Sym extends Serializable

    Definition Classes
      PropositionalLogic

19. #### object Test extends Serializable

    Definition Classes
      MatchApproximator

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

    Definition Classes
      PropositionalLogic

21. #### object TypeConst extends TypeConstExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

22. #### object TypeTestTreeMaker extends Serializable

    Definition Classes
      TreeMakers

23. #### object ValueConst extends ValueConstExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

24. #### object Var extends VarExtractor

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

25. #### def \/(props: Iterable[Prop]): Prop

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      MatchApproximator

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

    Definition Classes
      Any

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

    Attributes
      protected
    Definition Classes
      MatchApproximator

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

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

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

31. #### def codegen: AbsCodegen

    Definition Classes
      OptimizedCodegen → CodegenCore

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

    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

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreeMakers

35. #### val debugInfoEmitVars: Boolean

    Attributes
      protected
    Definition Classes
      TreeMakers

36. #### def doCSE(prevBinder: Global.Symbol, cases: List[List[TreeMaker]], pt: Type): List[List[TreeMaker]]

    a flow-sensitive, generalised, common sub-expression elimination reuse knowledge from performed tests the only sub-expressions we consider are the conditions and results of the three tests (type, type&equality, equality) when a sub-expression is shared, it is stored in a mutable variable the variable is floated up so that its scope includes all of the program that shares it we generalize sharing to implication, where b reuses a if a => b and priors(a) => priors(b) (the priors of a sub expression form the path through the decision tree)

    a flow-sensitive, generalised, common sub-expression elimination reuse knowledge from performed tests the only sub-expressions we consider are the conditions and results of the three tests (type, type&equality, equality) when a sub-expression is shared, it is stored in a mutable variable the variable is floated up so that its scope includes all of the program that shares it we generalize sharing to implication, where b reuses a if a => b and priors(a) => priors(b) (the priors of a sub expression form the path through the decision tree)

    Definition Classes
      CommonSubconditionElimination

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]

    Definition Classes
      SwitchEmission → TreeMakers

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

    Definition Classes
      SwitchEmission → TreeMakers

39. #### def ensuring(cond: (MatchOptimizer) ⇒ Boolean, msg: ⇒ Any): MatchOptimizer

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

40. #### def ensuring(cond: (MatchOptimizer) ⇒ Boolean): MatchOptimizer

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

41. #### def ensuring(cond: Boolean, msg: ⇒ Any): MatchOptimizer

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

42. #### def ensuring(cond: Boolean): MatchOptimizer

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

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

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

    Definition Classes
      AnyRef

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

    Definition Classes
      AnyRef → Any

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

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

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

    Attributes
      protected
    Definition Classes
      TreeMakers

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

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

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

    Definition Classes
      CodegenCore

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

    Definition Classes
      CodegenCore

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      AnyRef → Any

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

    Definition Classes
      AnyRef → Any

54. #### def inMatchMonad(tp: Global.Type): Global.Type

    Definition Classes
      OptimizedMatchMonadInterface → MatchMonadInterface

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

    Definition Classes
      Any

56. #### final def matchMonadResult(tp: Global.Type): Global.Type

    Definition Classes
      MatchMonadInterface

57. #### def matchMonadSym: Global.ClassSymbol

    Attributes
      protected
    Definition Classes
      OptimizedMatchMonadInterface → MatchMonadInterface

58. #### val matchOwner: Global.Symbol

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      AnyRef

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

    Definition Classes
      CodegenCore

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

    Definition Classes
      AnyRef

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

    Definition Classes
      AnyRef

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

    Definition Classes
      MatchOptimizer → TreeMakers

64. #### object optimizedCodegen extends CommonCodegen

    Definition Classes
      OptimizedCodegen

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

    Definition Classes
      TreesAndTypesDomain → PropositionalLogic

66. #### def propToSolvable(p: Prop): Formula

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      OptimizedMatchMonadInterface → MatchMonadInterface

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      PropositionalLogic

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

    Definition Classes
      MatchMonadInterface

72. #### def reportUnreachable(pos: Position): Unit

    Definition Classes
      MatchMonadInterface

73. #### def showTests(testss: List[List[Test]]): Unit

    Definition Classes
      MatchApproximator

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

    Definition Classes
      MatchApproximator

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

    Definition Classes
      AnyRef

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

    Definition Classes
      AnyRef → Any

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

    Definition Classes
      CheckableTreeAndTypeAnalysis

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

81. #### def →[B](y: B): (MatchOptimizer, B)

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

### Shadowed Implicit Value Members

1. #### val self: Any

   Implicit information
     This member is added by an implicit conversion from MatchOptimizer 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:

         (matchOptimizer: StringAdd).self

   Definition Classes
     StringAdd

2. #### val self: Any

   Implicit information
     This member is added by an implicit conversion from MatchOptimizer 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:

         (matchOptimizer: StringFormat).self

   Definition Classes
     StringFormat

### Deprecated Value Members

1. #### def x: MatchOptimizer

   Implicit information
     This member is added by an implicit conversion from MatchOptimizer to ArrowAssoc[MatchOptimizer] 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:

         (matchOptimizer: ArrowAssoc[MatchOptimizer]).x

   Definition Classes
     ArrowAssoc
   Annotations
     @deprecated
   Deprecated

     (Since version 2.10.0) Use `leftOfArrow`instead``

2. #### def x: MatchOptimizer

   Implicit information
     This member is added by an implicit conversion from MatchOptimizer to Ensuring[MatchOptimizer] 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:

         (matchOptimizer: Ensuring[MatchOptimizer]).x

   Definition Classes
     Ensuring
   Annotations
     @deprecated
   Deprecated

     (Since version 2.10.0) Use `resultOfEnsuring`instead``

### Inherited from CommonSubconditionElimination

### Inherited from MatchOptimization.MatchApproximator

### Inherited from MatchOptimization.TreesAndTypesDomain

### Inherited from MatchOptimization.CheckableTreeAndTypeAnalysis

### Inherited from MatchOptimization.PropositionalLogic

### Inherited from SwitchEmission

### Inherited from MatchOptimization.TreeMakers

### Inherited from MatchOptimization.OptimizedCodegen

### Inherited from MatchOptimization.OptimizedMatchMonadInterface

### Inherited from MatchOptimization.TypedSubstitution

### Inherited from MatchOptimization.CodegenCore

### Inherited from MatchOptimization.MatchMonadInterface

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion any2stringadd from MatchOptimizer to StringAdd

### Inherited by implicit conversion any2stringfmt from MatchOptimizer to StringFormat

### Inherited by implicit conversion any2ArrowAssoc from MatchOptimizer to ArrowAssoc[MatchOptimizer]

### Inherited by implicit conversion any2Ensuring from MatchOptimizer to Ensuring[MatchOptimizer]

### Ungrouped