scala.tools.nsc.typechecker

Analyzer

trait Analyzer extends Contexts with Namers with Typers with Infer with Implicits with Variances with EtaExpansion with SyntheticMethods with Unapplies with NamesDefaults with TypeDiagnostics

The main attribution phase.

Source
Analyzer.scala
Linear Supertypes
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Analyzer
  2. TypeDiagnostics
  3. NamesDefaults
  4. Unapplies
  5. SyntheticMethods
  6. TreeDSL
  7. EtaExpansion
  8. Variances
  9. Implicits
  10. Infer
  11. Typers
  12. Modes
  13. Namers
  14. Contexts
  15. AnyRef
  16. Any
Visibility
  1. Public
  2. All

Type Members

  1. class Context extends AnyRef

  2. class DeSkolemizeMap extends TypeMap

    Convert to corresponding type parameters all skolems of method parameters which appear in tparams.

  3. class ImplicitInfo extends AnyRef

    A class that records an available implicit

  4. class ImplicitSearch extends Typer

    A class that sets up an implicit search.

  5. class ImportInfo extends AnyRef

  6. case class ImportType(expr: Tree) extends Type with Product with Serializable

  7. class Inferencer extends AnyRef

    The context-dependent inferencer part

  8. case class NamedApplyInfo(qual: Option[Tree], targs: List[Tree], vargss: List[List[Tree]], blockTyper: Typer) extends Product with Serializable

  9. abstract class Namer extends AnyRef

  10. class PolyTypeCompleter extends TypeCompleter

    A class representing a lazy type with known type parameters.

  11. class SearchResult extends AnyRef

    The result of an implicit search

  12. abstract class TypeCompleter extends LazyType

  13. case class TypeDiag(tp: Type, sym: Symbol) extends Ordered[TypeDiag] with Product with Serializable

  14. abstract class Typer extends TyperDiagnostics

  15. trait TyperDiagnostics extends AnyRef

Abstract Value Members

  1. abstract val global: Global

    Definition Classes
    AnalyzerTreeDSLVariances

Concrete Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final val ALTmode: Int(8192)

    ALTmode is set when we are under a pattern alternative.

    ALTmode is set when we are under a pattern alternative.

    Definition Classes
    Modes
  7. final val BYVALmode: Int(32768)

    BYVALmode is set when we are typing an expression that occurs in a by-value position.

    BYVALmode is set when we are typing an expression that occurs in a by-value position. An expression e1 is in by-value position within expression e2 iff it will be reduced to a value at that position during the evaluation of e2. Examples are by-value function arguments or the conditional of an if-then-else clause. This mode has been added to support continuations.

    Definition Classes
    Modes
  8. object CODE extends AnyRef

  9. final val EXPRmode: Int(1)

    Definition Classes
    Modes
  10. final val FUNmode: Int(16)

    FUNmode is orthogonal to above.

    FUNmode is orthogonal to above. When set we are looking for a method or constructor.

    Definition Classes
    Modes
  11. object Function1 extends AnyRef

    An extractor for unary function types arg => res

  12. final val HKmode: Int(16384)

    HKmode is set when we are typing a higher-kinded type.

    HKmode is set when we are typing a higher-kinded type. adapt should then check kind-arity based on the prototypical type's kind arity. Type arguments should not be inferred.

    Definition Classes
    Modes
  13. object HasMember extends AnyRef

    An extractor for types of the form ? { name: ? }

  14. object HasMethodMatching extends AnyRef

    An extractor for types of the form ? { name: (? >: argtpe <: Any*)restp }

  15. object ImplicitNotFoundMsg extends AnyRef

  16. final val LHSmode: Int(1024)

    LHSmode is set for the left-hand side of an assignment.

    LHSmode is set for the left-hand side of an assignment.

    Definition Classes
    Modes
  17. final val NOmode: Int(0)

    NOmode, EXPRmode and PATTERNmode are mutually exclusive.

    NOmode, EXPRmode and PATTERNmode are mutually exclusive.

    Definition Classes
    Modes
  18. val NoContext: Context

    Definition Classes
    Contexts
  19. val NoImplicitInfo: ImplicitInfo

    A sentinel indicating no implicit was found

    A sentinel indicating no implicit was found

    Definition Classes
    Implicits
  20. final val PATTERNmode: Int(2)

    Definition Classes
    Modes
  21. final val POLYmode: Int(32)

    POLYmode is orthogonal to above.

    POLYmode is orthogonal to above. When set expression types can be polymorphic.

    Definition Classes
    Modes
  22. final val QUALmode: Int(64)

    QUALmode is orthogonal to above.

    QUALmode is orthogonal to above. When set expressions may be packages and Java statics modules.

    Definition Classes
    Modes
  23. final val RETmode: Int(131072)

    RETmode is set when we are typing a return expression.

    RETmode is set when we are typing a return expression.

    Definition Classes
    Modes
  24. final val SCCmode: Int(8)

    SCCmode is orthogonal to above.

    SCCmode is orthogonal to above. When set we are in the this or super constructor call of a constructor.

    Definition Classes
    Modes
  25. final val SNDTRYmode: Int(512)

    SNDTRYmode indicates that an application is typed for the 2nd time.

    SNDTRYmode indicates that an application is typed for the 2nd time. In that case functions may no longer be coerced with implicit views.

    Definition Classes
    Modes
  26. final val STARmode: Int(4096)

    STARmode is set when star patterns are allowed.

    STARmode is set when star patterns are allowed. (This was formerly called REGPATmode.)

    Definition Classes
    Modes
  27. final val SUPERCONSTRmode: Int(256)

    SUPERCONSTRmode is set for the super in a superclass constructor call super.

    SUPERCONSTRmode is set for the super in a superclass constructor call super.<init>.

    Definition Classes
    Modes
  28. lazy val SearchFailure: SearchResult

    Definition Classes
    Implicits
  29. final val TAPPmode: Int(128)

    TAPPmode is set for the function/type constructor part of a type application.

    TAPPmode is set for the function/type constructor part of a type application. When set we do not decompose PolyTypes.

    Definition Classes
    Modes
  30. final val TYPEPATmode: Int(65536)

    TYPEPATmode is set when we are typing a type in a pattern.

    TYPEPATmode is set when we are typing a type in a pattern.

    Definition Classes
    Modes
  31. final val TYPEmode: Int(4)

    TYPEmode needs a comment.

    TYPEmode needs a comment. <-- XXX.

    Definition Classes
    Modes
  32. object UnTyper extends Traverser

  33. def actualArgs(pos: Position, actuals: List[Tree], nformals: Int): List[Tree]

    Definition Classes
    Infer
  34. def actualTypes(actuals: List[Type], nformals: Int): List[Type]

    Definition Classes
    Infer
  35. def addDefaults(givenArgs: List[Tree], qual: Option[Tree], targs: List[Tree], previousArgss: List[List[Tree]], params: List[Symbol], pos: Position, context: Context): (List[Tree], List[Symbol])

    Extend the argument list givenArgs' with default arguments. Defaults are added as named arguments calling the corresponding default getter.

    Extend the argument list givenArgs' with default arguments. Defaults are added as named arguments calling the corresponding default getter.

    Example: given def foo(x: Int = 2, y: String = "def") foo(y = "lt") the argument list (y = "lt") is transformed to (y = "lt", x = foo$default$1())

    Definition Classes
    NamesDefaults
  36. def addSyntheticMethods(templ: Template, clazz: Symbol, context: Context): Template

    Add the synthetic methods to case classes.

    Add the synthetic methods to case classes. Note that a lot of the complexity herein is a consequence of case classes inheriting from case classes, which has been deprecated as of Sep 11 2009. So when the opportunity for removal arises, this can be simplified.

    Definition Classes
    SyntheticMethods
  37. def alternatives(tree: Tree): List[Type]

    Definition Classes
    TypeDiagnostics
  38. def alternativesString(tree: Tree): String

    Definition Classes
    TypeDiagnostics
  39. def applyErrorMsg(tree: Tree, msg: String, argtpes: List[Type], pt: Type): String

    Definition Classes
    TypeDiagnostics
  40. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  41. def caseClassCopyMeth(cdef: ClassDef): Option[DefDef]

    Definition Classes
    Unapplies
  42. def caseModuleApplyMeth(cdef: ClassDef): DefDef

    The apply method corresponding to a case class

    The apply method corresponding to a case class

    Definition Classes
    Unapplies
  43. def caseModuleDef(cdef: ClassDef): ModuleDef

    The module corresponding to a case class; overrides toString to show the module's name

    The module corresponding to a case class; overrides toString to show the module's name

    Definition Classes
    Unapplies
  44. def caseModuleUnapplyMeth(cdef: ClassDef): DefDef

    The unapply method corresponding to a case class

    The unapply method corresponding to a case class

    Definition Classes
    Unapplies
  45. def clone(): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  46. def companionClassOf(module: Symbol, context: Context): Symbol

    Definition Classes
    Namers
  47. def companionModuleDef(cdef: ClassDef, parents: List[Tree] = Nil, body: List[Tree] = Nil): ModuleDef

    Definition Classes
    Unapplies
  48. def companionModuleOf(clazz: Symbol, context: Context): Symbol

    Finds the companion module of a class symbol.

    Finds the companion module of a class symbol. Calling .companionModule does not work for classes defined inside methods.

    Definition Classes
    Namers
  49. def companionSymbolOf(sym: Symbol, context: Context): Symbol

    Definition Classes
    Namers
  50. def copyUntyped[T <: Tree](tree: T): T

    Definition Classes
    Unapplies
  51. def copyUntypedInvariant(td: TypeDef): TypeDef

    Definition Classes
    Unapplies
  52. def decodeWithKind(name: Name, owner: Symbol): String

    Definition Classes
    TypeDiagnostics
  53. def defaultGetter(param: Symbol, context: Context): Symbol

    For a parameter with default argument, find the method symbol of the default getter.

    For a parameter with default argument, find the method symbol of the default getter.

    Definition Classes
    NamesDefaults
  54. val defaultParametersOfMethod: WeakHashMap[Symbol, Set[Symbol]]

    Definition Classes
    NamesDefaults
  55. def deprecatedName(sym: Symbol): Option[Name]

    Definition Classes
    NamesDefaults
  56. def disambiguate(ss: List[String]): List[String]

    Definition Classes
    TypeDiagnostics
  57. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  58. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  59. def etaExpand(unit: CompilationUnit, tree: Tree): Tree

    Expand partial function applications of type type.

    Expand partial function applications of type type.

     p.f(es_1)...(es_n)
        ==>  {
               private synthetic val eta$f   = p.f   // if p is not stable
               ...
               private synthetic val eta$e_i = e_i    // if e_i is not stable
               ...
               (ps_1 => ... => ps_m => eta$f([es_1])...([es_m])(ps_1)...(ps_m))
             }
    

    tree is already attributed

    Definition Classes
    EtaExpansion
  60. object etaExpansion extends AnyRef

  61. def existentialContext(tp: Type): String

    Definition Classes
    TypeDiagnostics
  62. def explainVariance(found: Type, req: Type): String

    Look through the base types of the found type for any which might have been valid subtypes if given conformant type arguments.

    Look through the base types of the found type for any which might have been valid subtypes if given conformant type arguments. Examine those for situations where the type error would have been eliminated if the variance were different. In such cases, append an additional explanatory message.

    TODO: handle type aliases better.

    Definition Classes
    TypeDiagnostics
  63. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  64. final def forArgMode(fun: Tree, mode: Int): Int

    Definition Classes
    Typers
  65. final def forFunMode(mode: Int): Int

    Definition Classes
    Modes
  66. final def forTypeMode(mode: Int): Int

    Definition Classes
    Modes
  67. def formalTypes(formals: List[Type], nargs: Int, removeByName: Boolean = true, removeRepeated: Boolean = true): List[Type]

    The formal parameter types corresponding to formals.

    The formal parameter types corresponding to formals. If formals has a repeated last parameter, a list of (nargs - params.length + 1) copies of its type is returned. By-name types are replaced with their underlying type.

    removeByName

    allows keeping ByName parameters. Used in NamesDefaults.

    removeRepeated

    allows keeping repeated parameter (if there's one argument). Used in NamesDefaults.

    Definition Classes
    Infer
  68. def foundReqMsg(found: Type, req: Type): String

    Definition Classes
    TypeDiagnostics
  69. def freshVar(tparam: Symbol): TypeVar

    A fresh type variable with given type parameter as origin.

    A fresh type variable with given type parameter as origin.

    tparam

    ...

    returns

    ...

    Definition Classes
    Infer
  70. final def getClass(): java.lang.Class[_]

    Definition Classes
    AnyRef → Any
  71. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  72. final def inAllModes(mode: Int, required: Int): Boolean

    Definition Classes
    Modes
  73. final def inAnyMode(mode: Int, required: Int): Boolean

    Definition Classes
    Modes
  74. final def inFunMode(mode: Int): Boolean

    Definition Classes
    Modes
  75. final def inHKMode(mode: Int): Boolean

    Definition Classes
    Modes
  76. final def inNoModes(mode: Int, prohibited: Int): Boolean

    Definition Classes
    Modes
  77. final def inPatternMode(mode: Int): Boolean

    Definition Classes
    Modes
  78. final def inPolyMode(mode: Int): Boolean

    Definition Classes
    Modes
  79. def inferError(pos: Position, msg: String): Unit

    It can be quite difficult to know which of the many functions called "error" is being called at any given point in the compiler.

    It can be quite difficult to know which of the many functions called "error" is being called at any given point in the compiler. To alleviate this I am renaming such functions inside this trait based on where it originated.

    Definition Classes
    TypeDiagnostics
  80. def inferImplicit(tree: Tree, pt: Type, reportAmbiguous: Boolean, isView: Boolean, context: Context): SearchResult

    Search for an implicit value.

    Search for an implicit value. See the comment on result at the end of class ImplicitSearch for more info how the search is conducted.

    tree

    The tree for which the implicit needs to be inserted. (the inference might instantiate some of the undetermined type parameters of that tree.

    pt

    The expected type of the implicit.

    reportAmbiguous

    Should ambiguous implicit errors be reported? False iff we search for a view to find out whether one type is coercible to another.

    isView

    We are looking for a view

    context

    The current context

    returns

    A search result

    Definition Classes
    Implicits
  81. object instantiate extends TypeMap

    Map every TypeVar to its constraint.

  82. def isIdentity(a: Array[Int]): Boolean

    returns true' if every element is equal to its index

    returns true' if every element is equal to its index

    Definition Classes
    NamesDefaults
  83. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  84. def isNamed(arg: Tree): Boolean

    Definition Classes
    NamesDefaults
  85. var lastAccessCheckDetails: String

    Definition Classes
    Contexts
  86. def linePrecedes(t1: Tree, t2: Tree): Boolean

    Does the positioned line assigned to t1 precede that of t2?

    Does the positioned line assigned to t1 precede that of t2?

    Definition Classes
    TypeDiagnostics
  87. var lockedCount: Int

    Definition Classes
    Namers
  88. def memberWildcardType(name: Name, tp: Type): Type

    A constructor for types ?{ name: tp }, used in infer view to member searches.

    A constructor for types ?{ name: tp }, used in infer view to member searches.

    Definition Classes
    Implicits
  89. def missingParameterTypeMsg(fun: Tree, vparam: ValDef, pt: Type): String

    Definition Classes
    TypeDiagnostics
  90. def missingParams[T](args: List[T], params: List[Symbol], argName: (T) ⇒ Option[Name]): (List[Symbol], Boolean)

    Definition Classes
    NamesDefaults
  91. def mkTypeCompleter(t: Tree)(c: (Symbol) ⇒ Unit): TypeCompleter

    Definition Classes
    Namers
  92. def modeString(mode: Int): String

    Definition Classes
    Modes
  93. def nameOf(arg: Tree): Option[Name]

    Definition Classes
    NamesDefaults
  94. object namerFactory extends SubComponent

  95. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  96. def newNamer(context: Context): Namer

    Definition Classes
    Namers
  97. def newTyper(context: Context): Typer

    Definition Classes
    Typers
  98. val noApplyInfo: NamedApplyInfo

    Definition Classes
    NamesDefaults
  99. def noErroneousSyms(syms: Symbol*): Boolean

    Definition Classes
    TypeDiagnostics
  100. def noErroneousTrees(trees: Tree*): Boolean

    Definition Classes
    TypeDiagnostics
  101. def noErroneousTypes(tps: Type*): Boolean

    The common situation of making sure nothing is erroneous could be nicer if Symbols, Types, and Trees all implemented some common interface in which isErroneous and similar would be placed.

    The common situation of making sure nothing is erroneous could be nicer if Symbols, Types, and Trees all implemented some common interface in which isErroneous and similar would be placed.

    Definition Classes
    TypeDiagnostics
  102. def normalize(tp: Type): Type

    Automatically perform the following conversions on expression types: A method type becomes the corresponding function type.

    Automatically perform the following conversions on expression types: A method type becomes the corresponding function type. A nullary method type becomes its result type. Implicit parameters are skipped. This method seems to be performance critical.

    Definition Classes
    Infer
  103. def notAMember(sel: Tree, qual: Tree, name: Name): Unit

    Definition Classes
    TypeDiagnostics
  104. def notEnoughArgumentsMsg(fun: Tree, missing: List[Symbol]): String

    Definition Classes
    TypeDiagnostics
  105. final def notify(): Unit

    Definition Classes
    AnyRef
  106. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  107. final def onlyStickyModes(mode: Int): Int

    Definition Classes
    Modes
  108. object packageObjects extends SubComponent

  109. def paramPos(params: List[Symbol], name: Name): (Int, Option[Name])

    Returns

    Returns

    • the position of the parameter named name
    • optionally, if name is @deprecatedName, the new name
    Definition Classes
    NamesDefaults
  110. def removeNames(typer: Typer)(args: List[Tree], params: List[Symbol]): (List[Tree], Array[Int])

    Removes name assignments from args.

    Removes name assignments from args. Additionally, returns an array mapping argument indicies from call-site-order to definition-site-order.

    Verifies that names are not specified twice, positional args don't appear after named ones.

    Definition Classes
    NamesDefaults
  111. def reorderArgs[T](args: List[T], pos: (Int) ⇒ Int)(implicit arg0: ClassManifest[T]): List[T]

    pos

    maps indicies from old to new

    Definition Classes
    NamesDefaults
  112. def reorderArgsInv[T](args: List[T], pos: (Int) ⇒ Int)(implicit arg0: ClassManifest[T]): List[T]

    pos

    maps indicies from new to old (!)

    Definition Classes
    NamesDefaults
  113. def resetContexts(): Unit

    Definition Classes
    Contexts
  114. def resetImplicits(): Unit

    Definition Classes
    Implicits
  115. def resetNamer(): Unit

    Definition Classes
    Namers
  116. def resetSynthetics(): Unit

    Clear the cache of createdMethodSymbols.

    Clear the cache of createdMethodSymbols.

    Definition Classes
    SyntheticMethods
  117. def resetTyper(): Unit

    Definition Classes
    Typers
  118. def restrictionError(pos: Position, unit: CompilationUnit, msg: String): Unit

    Definition Classes
    TypeDiagnostics
  119. def restrictionWarning(pos: Position, unit: CompilationUnit, msg: String): Unit

    For errors which are artifacts of the implementation: such messages indicate that the restriction may be lifted in the future.

    For errors which are artifacts of the implementation: such messages indicate that the restriction may be lifted in the future.

    Definition Classes
    TypeDiagnostics
  120. def rootContext(unit: CompilationUnit, tree: Tree, erasedTypes: Boolean): Context

    Definition Classes
    Contexts
  121. def rootContext(unit: CompilationUnit): Context

    Definition Classes
    Contexts
  122. def rootImports(unit: CompilationUnit, tree: Tree): List[Symbol]

    List of objects and packages to import from in a root context.

    List of objects and packages to import from in a root context. This list is sensitive to the compiler settings.

    Attributes
    protected
    Definition Classes
    Contexts
  123. def setAddendum(pos: Position, msg: () ⇒ String): Unit

    Definition Classes
    TypeDiagnostics
  124. final val shortenImports: Boolean(false)

    Definition Classes
    Typers
  125. def skipImplicit(tp: Type): Type

    Definition Classes
    Infer
  126. def solvedTypes(tvars: List[TypeVar], tparams: List[Symbol], variances: List[Int], upper: Boolean, depth: Int): List[Type]

    Solve constraint collected in types tvars.

    Solve constraint collected in types tvars.

    tvars

    All type variables to be instantiated.

    tparams

    The type parameters corresponding to tvars

    variances

    The variances of type parameters; need to reverse solution direction for all contravariant variables.

    upper

    When true search for max solution else min.

    Definition Classes
    Infer
    Exceptions thrown
    NoInstance

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

    Definition Classes
    AnyRef
  128. def toString(): String

    Definition Classes
    AnyRef → Any
  129. def transformNamedApplication(typer: Typer, mode: Int, pt: Type)(tree: Tree, argPos: (Int) ⇒ Int): Tree

    Transform a function application into a Block, and assigns typer.

    Transform a function application into a Block, and assigns typer.context .namedApplyBlockInfo to the new block as side-effect. If tree has the form Apply(fun, args) first the function "fun" (which might be an application itself!) is transformed into a block of the form { val qual$1 = qualifier_of_fun val x$1 = arg_1_of_fun ... val x$n = arg_n_of_fun qual$1.fun[targs](x$1, ...)...(..., x$n) } then for each argument in args, a value is created and entered into the block. finally the application expression of the block is updated. { val qual$1 = .. ... val x$n = ... > val qual$n+1 = arg(1) > ... > val qual$n+m = arg(m) > qual$1.fun[targs](x$1, ...)...(..., x$n)(x$n+1, ..., x$n+m) }

    typer

    the typer calling this method; this method calls typer.doTypedApply

    mode

    the mode to use for calling typer.doTypedApply

    pt

    the expected type for calling typer.doTypedApply

    returns

    the transformed application (a Block) together with the NamedApplyInfo. if isNamedApplyBlock(tree), returns the existing context.namedApplyBlockInfo

    Definition Classes
    NamesDefaults
  130. val transformed: HashMap[Tree, Tree]

    Definition Classes
    Typers
  131. def treeSymTypeMsg(tree: Tree): String

    Definition Classes
    TypeDiagnostics
  132. object typerFactory extends SubComponent

  133. def unapplyMember(tp: Type): Symbol

    returns unapply or unapplySeq if available

    returns unapply or unapplySeq if available

    Definition Classes
    Unapplies
  134. def unapplyParameterType(extractor: Symbol): Symbol

    returns unapply member's parameter type.

    returns unapply member's parameter type.

    Definition Classes
    Unapplies
  135. def unapplyReturnTypeExpected(argsLength: Int): Type

    returns type of the unapply method returning T_0.

    returns type of the unapply method returning T_0...T_n for n == 0, boolean for n == 1, Some[T0] else Some[Product[Ti]]

    Definition Classes
    Unapplies
  136. def unapplyTypeList(ufn: Symbol, ufntpe: Type): List[Type]

    returns type list for return type of the extraction

    returns type list for return type of the extraction

    Definition Classes
    Unapplies
  137. def unapplyTypeListFromReturnType(tp1: Type): List[Type]

    (the inverse of unapplyReturnTypeSeq) for type Boolean, returns Nil for type Option[T] or Some[T]:

    (the inverse of unapplyReturnTypeSeq) for type Boolean, returns Nil for type Option[T] or Some[T]:

    • returns T0...Tn if n>0 and T <: Product[T0...Tn]]
    • returns T otherwise
    Definition Classes
    Unapplies
  138. def unapplyTypeListFromReturnTypeSeq(tp1: Type): List[Type]

    let type be the result type of the (possibly polymorphic) unapply method for type Option[T] or Some[T] -returns T0.

    let type be the result type of the (possibly polymorphic) unapply method for type Option[T] or Some[T] -returns T0...Tn-1,Tn* if n>0 and T <: Product[T0...Tn-1,Seq[Tn]]], -returns R* if T = Seq[R]

    Definition Classes
    Unapplies
  139. def underlying(member: Symbol): Symbol

    The symbol that which this accessor represents (possibly in part).

    The symbol that which this accessor represents (possibly in part). This is used for error messages, where we want to speak in terms of the actual declaration or definition, not in terms of the generated setters and getters

    Definition Classes
    Namers
  140. def varNotice(sym: Symbol): String

    An explanatory note to be added to error messages when there's a problem with abstract var defs

    An explanatory note to be added to error messages when there's a problem with abstract var defs

    Definition Classes
    Namers
  141. def varianceInArgs(tps: List[Type], tparams1: List[Symbol])(tparam: Symbol): Int

    Compute variance of type parameter tparam' in all type arguments tps which correspond to formal type parameters tparams1'.

    Compute variance of type parameter tparam' in all type arguments tps which correspond to formal type parameters tparams1'.

    Definition Classes
    Variances
  142. def varianceInAttrib(annot: AnnotationInfo)(tparam: Symbol): Int

    Compute variance of type parameter tparam' in type annotation annot'.

    Compute variance of type parameter tparam' in type annotation annot'.

    Definition Classes
    Variances
  143. def varianceInAttribs(annots: List[AnnotationInfo])(tparam: Symbol): Int

    Compute variance of type parameter tparam' in all type annotations annots'.

    Compute variance of type parameter tparam' in all type annotations annots'.

    Definition Classes
    Variances
  144. def varianceInSym(sym: Symbol)(tparam: Symbol): Int

    Compute variance of type parameter tparam' in type of symbol sym'.

    Compute variance of type parameter tparam' in type of symbol sym'.

    Definition Classes
    Variances
  145. def varianceInSyms(syms: List[Symbol])(tparam: Symbol): Int

    Compute variance of type parameter tparam' in types of all symbols sym'.

    Compute variance of type parameter tparam' in types of all symbols sym'.

    Definition Classes
    Variances
  146. def varianceInType(tp: Type)(tparam: Symbol): Int

    Compute variance of type parameter tparam in type tp.

    Compute variance of type parameter tparam in type tp.

    Definition Classes
    Variances
  147. def varianceInTypes(tps: List[Type])(tparam: Symbol): Int

    Compute variance of type parameter tparam' in all types tps'.

    Compute variance of type parameter tparam' in all types tps'.

    Definition Classes
    Variances
  148. def varianceWord(sym: Symbol): String

    Definition Classes
    TypeDiagnostics
  149. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  150. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  151. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()
  152. def withAddendum(pos: Position): (String) ⇒ String

    Definition Classes
    TypeDiagnostics
  153. def withDisambiguation[T](locals: List[Symbol], types: Type*)(op: ⇒ T): T

    Given any number of types, alters the name information in the symbols until they can be distinguished from one another: then executes the given code.

    Given any number of types, alters the name information in the symbols until they can be distinguished from one another: then executes the given code. The names are restored and the result is returned.

    Definition Classes
    TypeDiagnostics

Inherited from TypeDiagnostics

Inherited from NamesDefaults

Inherited from Unapplies

Inherited from SyntheticMethods

Inherited from TreeDSL

Inherited from EtaExpansion

Inherited from Variances

Inherited from Implicits

Inherited from Infer

Inherited from Typers

Inherited from Modes

Inherited from Namers

Inherited from Contexts

Inherited from AnyRef

Inherited from Any