scala.tools.nsc.matching.ParallelMatching.MatchMatrix

Ordering

Alphabetic
By inheritance

Inherited

Hide All
Show all

MatchMatrix
MatrixExhaustiveness
MatchMatrixOptimizer
AnyRef
Any

Visibility

Public
All

Instance Constructors

new MatchMatrix (context: MatrixContext)

Type Members

case class FinalState (bx: Int, params: List[Symbol], body: Tree) extends State with Product with Serializable
case class LiteralState (bx: Int, params: List[Symbol], body: Tree) extends State with Product with Serializable
class MixEquals extends RuleApplication
class MixLiteralInts extends RuleApplication
class MixSequence extends RuleApplication

Handle Sequence patterns (including Star patterns.
class MixTypes extends RuleApplication

Mixture rule for type tests.
class MixUnapply extends RuleApplication

mixture rule for unapply pattern
case class PatternMatch (scrut: Scrutinee, ps: List[Pattern]) extends Product with Serializable
class PatternSwitch extends PatternMatch
case class Rep (tvars: PatternVarGroup, rows: List[Row]) extends Product with Serializable
case class Row (pats: List[Pattern], subst: Bindings, guard: Tree, bx: Int) extends Product with Serializable

* States, Rows, Etc.
class RuleApplication extends AnyRef

*** Rule Applications ****
class Scrutinee extends AnyRef

Encapsulates a symbol being matched on.
class State extends AnyRef

Attributes
abstract
case class VariableRule (subst: Bindings, guard: Tree, guardedRest: Rep, bx: Int) extends RuleApplication with Product with Serializable

VariableRule: The top-most rows has only variable (non-constructor) patterns.

Abstract Value Members

def data : MatrixInit

Attributes
abstract

Concrete Value Members

def != (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def != (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
def ## (): Int

Attributes
final
Definition Classes
AnyRef → Any
def == (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def == (arg0: Any): Boolean

Attributes
final
Definition Classes
Any
def addOuterCondition (cond: Tree, tpe2test: Type, scrut: Tree): Tree

adds a test comparing the dynamic outer to the static outer
adds a test comparing the dynamic outer to the static outer

Attributes
final
def asInstanceOf [T0] : T0

Attributes
final
Definition Classes
Any
lazy val cases : List[CaseDef]
def clone (): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def condition (tpe: Type, scrutTree: Tree, isBound: Boolean): Tree

Attributes
final
def condition (tpe: Type, scrut: Scrutinee, isBound: Boolean): Tree

returns the condition in "if (cond) k1 else k2"
returns the condition in "if (cond) k1 else k2"

Attributes
final
val context : MatrixContext
def createLabelDef (namePrefix: String, body: Tree, params: List[Symbol] = Nil, restpe: Type = matchResultType): LabelDef
def createShortCut (theLabel: Symbol): Int

Attributes
final
def eq (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def equals (arg0: Any): Boolean

Definition Classes
AnyRef → Any
def expand (roots: List[PatternVar], cases: List[CaseDef]): List[(Row, Product with Serializable with State)]

Expands the patterns recursively.
Expands the patterns recursively.

Attributes
final
lazy val expansion : Rep
lazy val failTree : Tree
def finalize (): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def getClass (): java.lang.Class[_]

Attributes
final
Definition Classes
AnyRef → Any
def hashCode (): Int

Definition Classes
AnyRef → Any
def isInstanceOf [T0] : Boolean

Attributes
final
Definition Classes
Any
def isPatternSwitch (scrut: Scrutinee, ps: List[Pattern]): Option[PatternSwitch]
def make (roots1: PatternVarGroup, rows1: List[Row]): Rep

This is the recursively focal point for translating the current list of pattern variables and a list of pattern match rows into a tree suitable for entering erasure.
This is the recursively focal point for translating the current list of pattern variables and a list of pattern match rows into a tree suitable for entering erasure.
The first time it is called, the variables are (copies of) the original pattern matcher roots, and the rows correspond to the original casedefs.

Attributes
final
def ne (arg0: AnyRef): Boolean

Attributes
final
Definition Classes
AnyRef
def notify (): Unit

Attributes
final
Definition Classes
AnyRef
def notifyAll (): Unit

Attributes
final
Definition Classes
AnyRef
def optimize (tree: Tree): Tree

Attributes
final
Definition Classes
MatchMatrixOptimizer
lazy val roots : List[PatternVar]
lazy val rows : List[Row]
def synchronized [T0] (arg0: ⇒ T0): T0

Attributes
final
Definition Classes
AnyRef
lazy val targets : List[Product with Serializable with State]
def toString (): String

Definition Classes
MatchMatrix → AnyRef → Any
def wait (): Unit

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

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()
def wait (arg0: Long): Unit

Attributes
final
Definition Classes
AnyRef
Annotations
@throws()

MatchMatrix

class MatchMatrix extends MatchMatrixOptimizer with MatrixExhaustiveness

Instance Constructors

new MatchMatrix (context: MatrixContext)

Type Members

case class FinalState (bx: Int, params: List[Symbol], body: Tree) extends State with Product with Serializable

case class LiteralState (bx: Int, params: List[Symbol], body: Tree) extends State with Product with Serializable

class MixEquals extends RuleApplication

class MixLiteralInts extends RuleApplication

class MixSequence extends RuleApplication

class MixTypes extends RuleApplication

class MixUnapply extends RuleApplication

case class PatternMatch (scrut: Scrutinee, ps: List[Pattern]) extends Product with Serializable

class PatternSwitch extends PatternMatch

case class Rep (tvars: PatternVarGroup, rows: List[Row]) extends Product with Serializable

case class Row (pats: List[Pattern], subst: Bindings, guard: Tree, bx: Int) extends Product with Serializable

class RuleApplication extends AnyRef

class Scrutinee extends AnyRef

class State extends AnyRef

case class VariableRule (subst: Bindings, guard: Tree, guardedRest: Rep, bx: Int) extends RuleApplication with Product with Serializable

Abstract Value Members

def data : MatrixInit

Concrete Value Members

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def addOuterCondition (cond: Tree, tpe2test: Type, scrut: Tree): Tree

def asInstanceOf [T0] : T0

lazy val cases : List[CaseDef]

def clone (): AnyRef

def condition (tpe: Type, scrutTree: Tree, isBound: Boolean): Tree

def condition (tpe: Type, scrut: Scrutinee, isBound: Boolean): Tree

val context : MatrixContext

def createLabelDef (namePrefix: String, body: Tree, params: List[Symbol] = Nil, restpe: Type = matchResultType): LabelDef

def createShortCut (theLabel: Symbol): Int

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def expand (roots: List[PatternVar], cases: List[CaseDef]): List[(Row, Product with Serializable with State)]

lazy val expansion : Rep

lazy val failTree : Tree

def finalize (): Unit

def getClass (): java.lang.Class[_]

def hashCode (): Int

def isInstanceOf [T0] : Boolean

def isPatternSwitch (scrut: Scrutinee, ps: List[Pattern]): Option[PatternSwitch]

def make (roots1: PatternVarGroup, rows1: List[Row]): Rep

def ne (arg0: AnyRef): Boolean

def notify (): Unit

def notifyAll (): Unit

def optimize (tree: Tree): Tree

lazy val roots : List[PatternVar]

lazy val rows : List[Row]

def synchronized [T0] (arg0: ⇒ T0): T0

lazy val targets : List[Product with Serializable with State]

def toString (): String

def wait (): Unit

def wait (arg0: Long, arg1: Int): Unit

def wait (arg0: Long): Unit

Inherited from MatrixExhaustiveness

Inherited from MatchMatrixOptimizer

Inherited from AnyRef

Inherited from Any