RuleApplication

def cond : Tree

def failure : Tree

def pmatch : PatternMatch

def rest : Rep

def success : Tree

def tree (): Tree

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

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def asInstanceOf [T0] : T0

def clone (): AnyRef

lazy val codegen : Tree

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def finalize (): Unit

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

def hashCode (): Int

lazy val head : Pattern

def isInstanceOf [T0] : Boolean

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

def ne (arg0: AnyRef): Boolean

def notify (): Unit

def notifyAll (): Unit

lazy val patterns : List[Pattern]

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

lazy val scrut : Scrutinee

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

def toString (): String

def wait (): Unit

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

def wait (arg0: Long): Unit