scala.tools.nsc.transform.patmat.MatchTranslation

# MatchTranslator

###
Related Doc: package MatchTranslation

#### trait MatchTranslator extends PatternMatching.TreeMakers with PatternMatching.TreeMakerWarnings

Source
  MatchTranslation.scala

Linear Supertypes
PatternMatching.TreeMakerWarnings, PatternMatching.TreeMakers, PatternMatching.CodegenCore, PatternMatching.TypedSubstitution, PatternMatching.MatchMonadInterface, AnyRef, Any
Known Subclasses
OptimizingMatchTranslator, PureMatchTranslator
Ordering

1. Alphabetic
2. By Inheritance

Inherited

1. MatchTranslator
2. TreeMakerWarnings
3. TreeMakers
4. CodegenCore
5. TypedSubstitution
6. MatchMonadInterface
7. AnyRef
8. 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

   Definition Classes
     CodegenCore

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

   Definition Classes
     TreeMakers

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

   Definition Classes
     TreeMakers

4. #### final case class BoundTree(binder: Global.Symbol, tree: Global.Tree) extends Product with Serializable

5. #### trait Casegen extends AbsCodegen

   Definition Classes
     CodegenCore

6. #### abstract class CommonCodegen extends AbsCodegen

   Definition Classes
     CodegenCore

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

   Definition Classes
     TreeMakers

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

   Definition Classes
     TreeMakers

9. #### abstract class ExtractorCall extends AnyRef

10. #### class ExtractorCallProd extends ExtractorCall

11. #### class ExtractorCallRegular extends ExtractorCall

12. #### case class ExtractorTreeMaker(extractor: Global.Tree, extraCond: Option[Global.Tree], nextBinder: Global.Symbol)(subPatBinders: List[Global.Symbol], subPatRefs: List[Global.Tree], potentiallyMutableBinders: Set[Global.Symbol], extractorReturnsBoolean: Boolean, checkedLength: Option[Int], prevBinder: Global.Symbol, ignoredSubPatBinders: Set[Global.Symbol]) extends FunTreeMaker with PreserveSubPatBinders with Product with Serializable

    Make a TreeMaker that will result in an extractor call specified by `extractor` the next TreeMaker (here, we don't know which it'll be) is chained after this one by flatMap'ing a function with binder `nextBinder` over our extractor's result the function's body is determined by the next TreeMaker (furthermore, the interpretation of `flatMap` depends on the codegen instance we're using).

    Make a TreeMaker that will result in an extractor call specified by `extractor` the next TreeMaker (here, we don't know which it'll be) is chained after this one by flatMap'ing a function with binder `nextBinder` over our extractor's result the function's body is determined by the next TreeMaker (furthermore, the interpretation of `flatMap` depends on the codegen instance we're using).

    The values for the subpatterns, as computed by the extractor call in `extractor`, are stored in local variables that re-use the symbols in `subPatBinders`. This makes extractor patterns more debuggable (SI-5739).

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreeMakers

15. #### sealed trait NoNewBinders extends TreeMaker

    Definition Classes
      TreeMakers

16. #### sealed trait PreserveSubPatBinders extends TreeMaker

    Definition Classes
      TreeMakers

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

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

    Definition Classes
      TreeMakers

19. #### class Substitution extends AnyRef

    Definition Classes
      TypedSubstitution

20. #### final case class TranslationStep(makers: List[MatchTranslator.TreeMaker], subpatterns: List[BoundTree]) extends Product with Serializable

21. #### abstract class TreeMaker extends AnyRef

    Definition Classes
      TreeMakers

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

    Definition Classes
      TreeMakers

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

### Abstract Value Members

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

   Definition Classes
     TreeMakers

2. #### abstract def codegen: AbsCodegen

   Definition Classes
     CodegenCore

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

   Definition Classes
     TreeMakers

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

   Definition Classes
     MatchMonadInterface

### Concrete Value Members

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

   Test two objects for inequality.

   Test two objects for inequality.

   returns

     `true` if !(this == that), false otherwise.

   Definition Classes
     AnyRef → Any

2. #### final def ##(): Int

   Equivalent to `x.hashCode` except for boxed numeric types and `null`.

   Equivalent to `x.hashCode` except for boxed numeric types and `null`. For numerics, it returns a hash value which is consistent with value equality: if two value type instances compare as true, then ## will produce the same hash value for each of them. For `null` returns a hashcode where `null.hashCode` throws a `NullPointerException`.

   returns

     a hash value consistent with ==

   Definition Classes
     AnyRef → Any

3. #### def +(other: String): String

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

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

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

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

6. #### object EmptySubstitution extends Substitution

   Definition Classes
     TypedSubstitution

7. #### object ExtractorCall

8. #### object IrrefutableExtractorTreeMaker

   Definition Classes
     TreeMakers

9. #### object PatternBoundToUnderscore

10. #### object Substitution

    Definition Classes
      TypedSubstitution

11. #### object SymbolBound

12. #### object TypeTestTreeMaker extends Serializable

    Definition Classes
      TreeMakers

13. #### object WildcardPattern

    A conservative approximation of which patterns do not discern anything.

    A conservative approximation of which patterns do not discern anything. They are discarded during the translation.

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

15. #### def checkMatchVariablePatterns(cases: List[Global.CaseDef]): Unit

    Definition Classes
      TreeMakerWarnings

16. #### 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
      @IntrinsicCandidate() @throws( ... )
    Note

      not specified by SLS as a member of AnyRef

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

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

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

    Definition Classes
      TreeMakers

20. #### val debugInfoEmitVars: Boolean

    Attributes
      protected
    Definition Classes
      TreeMakers

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

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

    Definition Classes
      TreeMakers

23. #### def ensuring(cond: (PatternMatching.MatchTranslator) ⇒ Boolean, msg: ⇒ Any): PatternMatching.MatchTranslator

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

24. #### def ensuring(cond: (PatternMatching.MatchTranslator) ⇒ Boolean): PatternMatching.MatchTranslator

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

25. #### def ensuring(cond: Boolean, msg: ⇒ Any): PatternMatching.MatchTranslator

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

26. #### def ensuring(cond: Boolean): PatternMatching.MatchTranslator

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

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

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

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

    Attributes
      protected
    Definition Classes
      TreeMakers

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

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

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

    Definition Classes
      CodegenCore

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

    Definition Classes
      CodegenCore

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

    A representation that corresponds to the dynamic class of the receiver object.

    A representation that corresponds to the dynamic class of the receiver object.

    The nature of the representation is platform dependent.

    returns

      a representation that corresponds to the dynamic class of the receiver object.

    Definition Classes
      AnyRef → Any
    Annotations
      @IntrinsicCandidate()
    Note

      not specified by SLS as a member of AnyRef

34. #### 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
    Annotations
      @IntrinsicCandidate()

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

36. #### val matchOwner: Global.Symbol

    Definition Classes
      MatchMonadInterface

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

38. #### def newBoundTree(tree: Global.Tree, pt: Global.Type): BoundTree

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

    Definition Classes
      CodegenCore

40. #### 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
    Annotations
      @IntrinsicCandidate()
    Note

      not specified by SLS as a member of AnyRef

41. #### 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
    Annotations
      @IntrinsicCandidate()
    Note

      not specified by SLS as a member of AnyRef

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      TreeMakers

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

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      MatchMonadInterface

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

    Definition Classes
      AnyRef

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

49. #### def translateBody(body: Global.Tree, matchPt: Global.Type): TreeMaker

50. #### def translateCase(scrutSym: Global.Symbol, pt: Global.Type)(caseDef: Global.CaseDef): collection.immutable.List[TreeMaker]

    The translation of `pat if guard => body` has two aspects: 1) the substitution due to the variables bound by patterns 2) the combination of the extractor calls using `flatMap`.

    The translation of `pat if guard => body` has two aspects: 1) the substitution due to the variables bound by patterns 2) the combination of the extractor calls using `flatMap`.

    2) is easy -- it looks like: `translatePattern_1.flatMap(translatePattern_2....flatMap(translatePattern_N.flatMap(translateGuard.flatMap((x_i) => success(Xbody(x_i)))))...)` this must be right-leaning tree, as can be seen intuitively by considering the scope of bound variables: variables bound by pat_1 must be visible from the function inside the left-most flatMap right up to Xbody all the way on the right 1) is tricky because translatePattern_i determines the shape of translatePattern_i+1: zoom in on `translatePattern_1.flatMap(translatePattern_2)` for example -- it actually looks more like: `translatePattern_1(x_scrut).flatMap((x_1) => {y_i -> x_1._i}translatePattern_2)`

    `x_1` references the result (inside the monad) of the extractor corresponding to `pat_1`, this result holds the values for the constructor arguments, which translatePattern_1 has extracted from the object pointed to by `x_scrut`. The `y_i` are the symbols bound by `pat_1` (in order) in the scope of the remainder of the pattern, and they must thus be replaced by:

    - (for 1-ary unapply) x_1
    - (for n-ary unapply, n > 1) selection of the i'th tuple component of `x_1`
    - (for unapplySeq) x_1.apply(i)

    in the treemakers,

    Thus, the result type of `translatePattern_i`'s extractor must conform to `M[(T_1,..., T_n)]`.

    Operationally, phase 1) is a foldLeft, since we must consider the depth-first-flattening of the transformed patterns from left to right. For every pattern ast node, it produces a transformed ast and a function that will take care of binding and substitution of the next ast (to the right).

51. #### def translateGuard(guard: Global.Tree): List[TreeMaker]

52. #### def translateMatch(match_: Global.Match): Global.Tree

    Implement a pattern match by turning its cases (including the implicit failure case) into the corresponding (monadic) extractors, and combining them with the `orElse` combinator.

    Implement a pattern match by turning its cases (including the implicit failure case) into the corresponding (monadic) extractors, and combining them with the `orElse` combinator.

    For `scrutinee match { case1 ... caseN }`, the resulting tree has the shape `runOrElse(scrutinee)(x => translateCase1(x).orElse(translateCase2(x)).....orElse(zero))`

    NOTE: the resulting tree is not type checked, nor are nested pattern matches transformed thus, you must typecheck the result (and that will in turn translate nested matches) this could probably optimized... (but note that the matchStrategy must be solved for each nested patternmatch)

53. #### def translatePattern(bound: BoundTree): List[TreeMaker]

54. #### def translateTry(caseDefs: List[Global.CaseDef], pt: Global.Type, pos: Global.Position): List[Global.CaseDef]

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

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

    Definition Classes
      AnyRef
    Annotations
      @throws( ... )

58. #### def →[B](y: B): (PatternMatching.MatchTranslator, B)

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

### Deprecated Value Members

1. #### 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
     @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
   Deprecated

     (Since version ) see corresponding Javadoc for more information.

   Note

     not specified by SLS as a member of AnyRef

### Inherited from PatternMatching.TreeMakerWarnings

### Inherited from PatternMatching.TreeMakers

### Inherited from PatternMatching.CodegenCore

### Inherited from PatternMatching.TypedSubstitution

### Inherited from PatternMatching.MatchMonadInterface

### Inherited from AnyRef

### Inherited from Any

### Inherited by implicit conversion any2stringadd from PatternMatching.MatchTranslator to any2stringadd[PatternMatching.MatchTranslator]

### Inherited by implicit conversion StringFormat from PatternMatching.MatchTranslator to StringFormat[PatternMatching.MatchTranslator]

### Inherited by implicit conversion Ensuring from PatternMatching.MatchTranslator to Ensuring[PatternMatching.MatchTranslator]

### Inherited by implicit conversion ArrowAssoc from PatternMatching.MatchTranslator to ArrowAssoc[PatternMatching.MatchTranslator]

### Ungrouped