SequenceLikePattern

abstract def elems: List[Tree]

abstract def tree: Tree

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def boundTree: Tree

def boundVariables: List[Symbol]

def clone(): AnyRef

def description: String

def dummies: List[Pattern]

def elemPatterns: List[Pattern]

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

Standard methods *

def equalsCheck: Type

def finalize(): Unit

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

def hasStar: Boolean

def hashCode(): Int

def isCaseClass: Boolean

def isDefault: Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isModule: Boolean

def isObject: Boolean

final def ne(arg0: AnyRef): Boolean

def necessaryType: Type

def nonStarElems: List[Tree]

def nonStarLength: Int

def nonStarPatterns: List[Pattern]

final def notify(): Unit

final def notifyAll(): Unit

def rebindTo(t: Tree): Pattern

def rebindToEmpty(tpe: Type): Pattern

def rebindToEqualsCheck(): Pattern

def rebindToObjectCheck(): Pattern

def rebindToType(tpe: Type, ascription: Type = null): Pattern

def setBound(x: Bind): Pattern

def setType(tpe: Type): SequenceLikePattern.this.type

def simplify(pv: PatternVar): Pattern

def subpatterns(pm: PatternMatch): List[Pattern]

def subpatternsForVars: List[Pattern]

def sufficientType: Type

def sym: Symbol

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

final def toString(): String

def toTypeString(): String

def tpe: Type

final def wait(): Unit

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

final def wait(arg0: Long): Unit