ExtractorCall

abstract def args: List[ast.tpd.Tree]

abstract def resultType: Type

abstract def treeMaker(binder: Symbol, binderKnownNonNull: Boolean, pos: Position, binderTypeTested: Type): MatchTranslator.TreeMaker

Create the TreeMaker that embodies this extractor call

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val aligner: MatchTranslator.PatternAligned

final def asInstanceOf[T0]: T0

def checkedLength: Option[Int]

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def expectedLength: Int

def finalize(): Unit

def firstIndexingBinder: Int

final def getClass(): Class[_]

def hashCode(): Int

lazy val ignoredSubPatBinders: Set[Symbol]

final def isInstanceOf[T0]: Boolean

def lastIndexingBinder: Int

def lengthGuard(binder: Symbol): Option[ast.tpd.Tree]

val mathSignum: ast.tpd.Select

val mathSignymSymbol: TermSymbol

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def rawSubPatTypes: List[Type]

def resultInMonad: Type

def seqTree(binder: Symbol): ast.tpd.Tree

lazy val subBoundTrees: List[BoundTree]

def subPatBinders: List[Symbol]

def subPatRefs(binder: Symbol): List[ast.tpd.Tree]

def subPatRefsSeq(binder: Symbol): List[ast.tpd.Tree]

def subPatTypes: List[Type]

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

def toString(): String

def tupleSel(binder: Symbol)(i: Int): ast.tpd.Tree

def typeArgOfBaseTypeOr(tp: Type, baseClass: Symbol)(or: ⇒ Type): Type

final def wait(): Unit

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

final def wait(arg0: Long): Unit