Rep

def != (arg0: AnyRef): Boolean

def != (arg0: Any): Boolean

def ## (): Int

def == (arg0: AnyRef): Boolean

def == (arg0: Any): Boolean

def applyRule (): Tree

Applying the rule will result in one of:

def asInstanceOf [T0] : T0

def canEqual (arg0: Any): Boolean

def clone (): AnyRef

lazy val defaults : List[Pattern]

def eq (arg0: AnyRef): Boolean

def equals (arg0: Any): Boolean

def finalize (): Unit

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

lazy val guard : Tree

lazy val guardedRest : Rep

def hashCode (): Int

lazy val index : Int

def isInstanceOf [T0] : Boolean

def ne (arg0: AnyRef): Boolean

def notify (): Unit

def notifyAll (): Unit

lazy val others : List[Pattern]

lazy val pats : List[Pattern]

def ppn (x: Any): String

def productArity : Int

def productElement (arg0: Int): Any

def productIterator : Iterator[Any]

def productPrefix : String

val rows : List[Row]

lazy val subst : Bindings

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

def toString (): String

def toTree (): Tree

Converts this to a tree - recursively acquires subreps.

val tvars : PatternVarGroup

def wait (): Unit

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

def wait (arg0: Long): Unit

def productElements : Iterator[Any]