Rep

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def applyRule(): Tree

Applying the rule will result in one of:

final def asInstanceOf[T0]: T0

def clone(): AnyRef

lazy val defaults: List[Pattern]

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

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

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

def ensuring(cond: Boolean): Rep

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

lazy val guard: Tree

lazy val guardedRest: Rep

lazy val index: Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

lazy val others: List[Pattern]

lazy val pats: List[Pattern]

def ppn(x: Any): String

val rows: List[Row]

val self: Any

val self: Any

lazy val subst: Bindings

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

def toString(): String

final def toTree(): Tree

Converts this to a tree - recursively acquires subreps.

val tvars: PatternVarGroup

final def wait(): Unit

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

final def wait(arg0: Long): Unit

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

def x: Rep

def x: Rep