MixSequence

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (MixSequence, B)

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

lazy val codegen: Tree

lazy val cond: Tree

def ensuring(cond: (MixSequence) ⇒ Boolean, msg: ⇒ Any): MixSequence

def ensuring(cond: (MixSequence) ⇒ Boolean): MixSequence

def ensuring(cond: Boolean, msg: ⇒ Any): MixSequence

def ensuring(cond: Boolean): MixSequence

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

val failRows: List[Row]

lazy val failure: Tree

def failureMatrixFn(c: Pattern): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def hasStar: Boolean

def hashCode(): Int

lazy val head: Pattern

final def isInstanceOf[T0]: Boolean

def mkFail(xs: List[Row]): Tree

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

lazy val patterns: List[Pattern]

val pmatch: PatternMatch

def remake(rows: List[Row], pvgroup: PatternVarGroup = emptyPatternVarGroup, includeScrut: Boolean = true): Rep

val rest: Rep

lazy val scrut: Scrutinee

val self: Any

val self: Any

lazy val success: Tree

lazy val successMatrixFn: PartialFunction[Pattern, List[Pattern]]

val successRows: List[Row]

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

def toString(): String

final def tree(): Tree

translate outcome of the rule application into code (possible involving recursive application of rewriting)

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def →[B](y: B): (MixSequence, B)

def x: MixSequence

def x: MixSequence