scala.tools.nsc.typechecker.Typers

Typer

abstract class Typer extends TyperDiagnostics

Source
Typers.scala
Linear Supertypes
TyperDiagnostics, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. Typer
  2. TyperDiagnostics
  3. AnyRef
  4. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Typer(context0: Context)

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. def adapt(tree: Tree, mode: Int, pt: Type, original: Tree = EmptyTree): Tree

    Perform the following adaptations of expression, pattern or type tree' wrt to given mode mode' and given prototype pt': (-1) For expressions with annotated types, let AnnotationCheckers decide what to do (0) Convert expressions with constant types to literals (unless in interactive/scaladoc mode) (1) Resolve overloading, unless mode contains FUNmode (2) Apply parameterless functions (3) Apply polymorphic types to fresh instances of their type parameters and store these instances in context.undetparams, unless followed by explicit type application. (4) Do the following to unapplied methods used as values: (4.1) If the method has only implicit parameters pass implicit arguments (4.2) otherwise, if pt' is a function type and method is not a constructor, convert to function by eta-expansion, (4.

    Perform the following adaptations of expression, pattern or type tree' wrt to given mode mode' and given prototype pt': (-1) For expressions with annotated types, let AnnotationCheckers decide what to do (0) Convert expressions with constant types to literals (unless in interactive/scaladoc mode) (1) Resolve overloading, unless mode contains FUNmode (2) Apply parameterless functions (3) Apply polymorphic types to fresh instances of their type parameters and store these instances in context.undetparams, unless followed by explicit type application. (4) Do the following to unapplied methods used as values: (4.1) If the method has only implicit parameters pass implicit arguments (4.2) otherwise, if pt' is a function type and method is not a constructor, convert to function by eta-expansion, (4.3) otherwise, if the method is nullary with a result type compatible to pt' and it is not a constructor, apply it to () otherwise issue an error (5) Convert constructors in a pattern as follows: (5.1) If constructor refers to a case class factory, set tree's type to the unique instance of its primary constructor that is a subtype of the expected type. (5.2) If constructor refers to an extractor, convert to application of unapply or unapplySeq method.

    (6) Convert all other types to TypeTree nodes. (7) When in TYPEmode but not FUNmode or HKmode, check that types are fully parameterized (7.1) In HKmode, higher-kinded types are allowed, but they must have the expected kind-arity (8) When in both EXPRmode and FUNmode, add apply method calls to values of object type. (9) If there are undetermined type variables and not POLYmode, infer expression instance Then, if tree's type is not a subtype of expected type, try the following adaptations: (10) If the expected type is Byte, Short or Char, and the expression is an integer fitting in the range of that type, convert it to that type. (11) Widen numeric literals to their expected type, if necessary (12) When in mode EXPRmode, convert E to { E; () } if expected type is scala.Unit. (13) When in mode EXPRmode, apply AnnotationChecker conversion if expected type is annotated. (14) When in mode EXPRmode, apply a view If all this fails, error

    Attributes
    protected
  7. def adaptToArguments(qual: Tree, name: Name, args: List[Tree], pt: Type): Tree

    Try to apply an implicit conversion to qual' to that it contains a method name which can be applied to arguments args' with expected type pt'. If pt' is defined, there is a fallback to try again with pt = ?.

    Try to apply an implicit conversion to qual' to that it contains a method name which can be applied to arguments args' with expected type pt'. If pt' is defined, there is a fallback to try again with pt = ?. This helps avoiding propagating result information too far and solves #1756. If no conversion is found, return qual' unchanged.

  8. def adaptToMember(qual: Tree, searchTemplate: Type): Tree

  9. def adaptToMemberWithArgs(tree: Tree, qual: Tree, name: Name, mode: Int): Tree

    Try o apply an implicit conversion to qual' to that it contains a method name. If that's ambiguous try taking arguments into account using adaptToArguments.

  10. def adaptToName(qual: Tree, name: Name): Tree

    Try to apply an implicit conversion to qual' to that it contains a member name of arbitrary type. If no conversion is found, return qual' unchanged.

  11. def addGetterSetter(stat: Tree): List[Tree]

    stat

    ...

    returns

    ...

  12. def applyImplicitArgs(fun: Tree): Tree

    Find implicit arguments and pass them to given tree.

  13. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  14. def atOwner(tree: Tree, owner: Symbol): Typer

  15. def atOwner(owner: Symbol): Typer

  16. def callToCompanionConstr(context: Context, calledFun: Symbol): Boolean

  17. def checkClassType(tpt: Tree, existentialOK: Boolean, stablePrefix: Boolean): Unit

    Check that tpt' refers to a non-refinement class type

  18. object checkDead extends AnyRef

  19. def checkFinitary(classinfo: ClassInfoType): Unit

  20. def checkMethodStructuralCompatible(meth: Symbol): Unit

    Check if a method is defined in such a way that it can be called.

    Check if a method is defined in such a way that it can be called. A method cannot be called if it is a non-private member of a structural type and if its parameter's types are not one of - this.type - a type member of the structural type - an abstract type declared outside of the structural type.

  21. object checkNoEscaping extends TypeMap

    Check that type of given tree does not contain local or private components.

  22. def checkNonCyclic(defn: Tree, tpt: Tree): Unit

  23. def checkNonCyclic(sym: Symbol): Unit

  24. def checkNonCyclic(pos: Position, tp: Type, lockedSym: Symbol): Boolean

  25. def checkNonCyclic(pos: Position, tp: Type): Boolean

    Check that type tp is not a subtype of itself.

    Check that type tp is not a subtype of itself.

    pos

    ...

    tp

    ...

    returns

    true if tp is not a subtype of itself.

  26. def checkParamsConvertible(pos: Position, tpe: Type): Unit

  27. def checkStable(tree: Tree): Tree

    Check that tree is a stable expression.

    Check that tree is a stable expression.

    tree

    ...

    returns

    ...

  28. def checkStarPatOK(pos: Position, mode: Int): Unit

  29. def clone(): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  30. def computeParamAliases(clazz: Symbol, vparamss: List[List[ValDef]], rhs: Tree): Unit

    Enter all aliases of local parameter accessors.

    Enter all aliases of local parameter accessors.

    clazz

    ...

    vparamss

    ...

    rhs

    ...

  31. def computeType(tree: Tree, pt: Type): Type

  32. def constrTyperIf(inConstr: Boolean): Typer

    The typer for an expression, depending on where we are.

    The typer for an expression, depending on where we are. If we are before a superclass call, this is a typer over a constructor context; otherwise it is the current typer.

  33. var context: Context

  34. def context1: Context

  35. def cyclicAdjective(sym: Symbol): String

    Definition Classes
    TyperDiagnostics
  36. def cyclicReferenceMessage(sym: Symbol, tree: Tree): Option[String]

    Returns Some(msg) if the given tree is untyped apparently due to a cyclic reference, and None otherwise.

    Returns Some(msg) if the given tree is untyped apparently due to a cyclic reference, and None otherwise.

    Definition Classes
    TyperDiagnostics
  37. final def deindentTyping(): Unit

    Annotations
    @inline()
  38. def doTypedApply(tree: Tree, fun0: Tree, args: List[Tree], mode: Int, pt: Type): Tree

  39. def enterSym(txt: Context, tree: Tree): Context

    Attributes
    protected
  40. def enterSyms(txt: Context, trees: List[Tree]): Unit

    Attributes
    protected
  41. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  43. def existentialTransform(rawSyms: List[Symbol], tp: Type): (List[Symbol], Type)

    Given a set rawSyms of term- and type-symbols, and a type tp, produce a set of fresh type parameters and a type so that it can be abstracted to an existential type.

    Given a set rawSyms of term- and type-symbols, and a type tp, produce a set of fresh type parameters and a type so that it can be abstracted to an existential type. Every type symbol T in rawSyms is mapped to a clone. Every term symbol x of type T in rawSyms is given an associated type symbol of the following form:

    type x.type <: T with Singleton

    The name of the type parameter is x.type, to produce nice diagnostics. The Singleton parent ensures that the type parameter is still seen as a stable type. Type symbols in rawSyms are fully replaced by the new symbols. Term symbols are also replaced, except for term symbols of an Ident tree, where only the type of the Ident is changed.

    Attributes
    protected
  44. def finalize(): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  45. def findManifest(tp: Type, full: Boolean): SearchResult

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

    Definition Classes
    AnyRef → Any
  47. def getManifestTree(pos: Position, tp: Type, full: Boolean): Tree

  48. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  49. final def indentTyping(): Unit

    Annotations
    @inline()
  50. val infer: Inferencer

  51. def inferView(tree: Tree, from: Type, to: Type, reportAmbiguous: Boolean): Tree

    Infer an implicit conversion (view) between two types.

    Infer an implicit conversion (view) between two types.

    tree

    The tree which needs to be converted.

    from

    The source type of the conversion

    to

    The target type of the conversion

    reportAmbiguous

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

  52. def instantiate(tree: Tree, mode: Int, pt: Type): Tree

    tree

    ...

    mode

    ...

    pt

    ...

    returns

    ...

  53. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  54. def isNamedApplyBlock(tree: Tree): Boolean

    Is tree' a block created by a named application?

  55. def isRawParameter(sym: Symbol): Boolean

  56. def isStale(sym: Symbol): Boolean

    A symbol is stale if it is toplevel, to be loaded from a classfile, and the classfile is produced from a sourcefile which is compiled in the current run.

  57. def labelTyper(ldef: LabelDef): Typer

    The typer for a label definition.

    The typer for a label definition. If this is part of a template we first have to enter the label definition.

  58. def member(qual: Tree, name: Name): Symbol

    The member with given name of given qualifier tree

  59. def memberAnnots(annots: List[AnnotationInfo], memberClass: Symbol, keepClean: Boolean = false): List[AnnotationInfo]

    The annotations amongst annots that should go on a member of class memberClass (field, getter, setter, beanGetter, beanSetter, param) If 'keepClean' is true, annotations without any meta-annotation are kept

    The annotations amongst annots that should go on a member of class memberClass (field, getter, setter, beanGetter, beanSetter, param) If 'keepClean' is true, annotations without any meta-annotation are kept

    Attributes
    protected
  60. def namer: Namer

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

    Definition Classes
    AnyRef
  62. def needsInstantiation(tparams: List[Symbol], formals: List[Type], args: List[Tree]): Boolean

    Does function need to be instantiated, because a missing parameter in an argument closure overlaps with an uninstantiated formal?

  63. final def notify(): Unit

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

    Definition Classes
    AnyRef
  65. def packSymbols(hidden: List[Symbol], tp: Type): Type

    Compute an existential type from raw hidden symbols syms' and type tp'

  66. def packedType(tree: Tree, owner: Symbol): Type

    convert skolems to existentials

  67. def parentTypes(templ: Template): List[Tree]

  68. final def printInference(s: ⇒ String): Unit

    Annotations
    @inline()
  69. final def printTyping(s: ⇒ String): Unit

    Annotations
    @inline()
  70. def qualifyingClass(tree: Tree, qual: Name, packageOK: Boolean): Symbol

    The qualifying class of a this or super with prefix qual.

  71. def reallyExists(sym: Symbol): Boolean

    Is symbol defined and not stale?

  72. def reenterTypeParams(tparams: List[TypeDef]): List[Symbol]

  73. def reenterValueParams(vparamss: List[List[ValDef]]): Unit

  74. def removeAnnotations(mods: Modifiers): Modifiers

    Remove definition annotations from modifiers (they have been saved into the symbol's annotations in the type completer / namer)

  75. def reportTypeError(pos: Position, ex: TypeError): Unit

    Report a type error.

    Report a type error.

    ex

    The exception that caused the error

    Definition Classes
    TyperDiagnostics
  76. def silent[T](op: (Typer) ⇒ T, reportAmbiguousErrors: Boolean, newtree: Tree): Any

  77. def stabilizeFun(tree: Tree, mode: Int, pt: Type): Tree

    tree

    ...

    mode

    ...

    pt

    ...

    returns

    ...

  78. def symWasOverloaded(sym: Symbol): Boolean

    Definition Classes
    TyperDiagnostics
  79. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  80. def toString(): String

    Definition Classes
    AnyRef → Any
  81. def transformedOrTyped(tree: Tree, mode: Int, pt: Type): Tree

  82. def tryBoth(tree: Tree)(op1: (Typer, Tree) ⇒ Tree)(op2: (Typer, Tree) ⇒ Tree): Tree

    Utility method: Try op1 on tree.

    Utility method: Try op1 on tree. If that gives an error try op2 instead.

  83. def typed(tree: Tree, pt: Type): Tree

    Types expression tree with given prototype pt.

    Types expression tree with given prototype pt.

    tree

    ...

    pt

    ...

    returns

    ...

  84. def typed(tree: Tree): Tree

    Types expression or definition tree.

    Types expression or definition tree.

    tree

    ...

    returns

    ...

  85. def typed(tree: Tree, mode: Int, pt: Type): Tree

    tree

    ...

    mode

    ...

    pt

    ...

    returns

    ...

  86. def typed1(tree: Tree, mode: Int, pt: Type): Tree

    Attributes
    protected
  87. def typedAnnotation(ann: Tree, mode: Int = EXPRmode, selfsym: Symbol = NoSymbol, annClass: Symbol = AnnotationClass, requireJava: Boolean = false): AnnotationInfo

    Convert an annotation constructor call into an AnnotationInfo.

    Convert an annotation constructor call into an AnnotationInfo.

    annClass

    the expected annotation class

  88. def typedArg(arg: Tree, mode: Int, newmode: Int, pt: Type): Tree

  89. def typedArgs(args: List[Tree], mode: Int, originalFormals: List[Type], adaptedFormals: List[Type]): List[Tree]

  90. def typedArgs(args: List[Tree], mode: Int): List[Tree]

  91. def typedBlock(block: Block, mode: Int, pt: Type): Block

    block

    ...

    mode

    ...

    pt

    ...

    returns

    ...

  92. def typedCase(cdef: CaseDef, pattpe: Type, pt: Type): CaseDef

    cdef

    ...

    pattpe

    ...

    pt

    ...

    returns

    ...

  93. def typedCases(tree: Tree, cases: List[CaseDef], pattp: Type, pt: Type): List[CaseDef]

  94. def typedClassDef(cdef: ClassDef): Tree

    cdef

    ...

    returns

    ...

  95. def typedDefDef(ddef: DefDef): DefDef

    ddef

    ...

    returns

    ...

  96. def typedExistentialTypeTree(tree: ExistentialTypeTree, mode: Int): Tree

    Attributes
    protected
  97. def typedFunction(fun: Function, mode: Int, pt: Type): Tree

    fun

    ...

    mode

    ...

    pt

    ...

    returns

    ...

  98. def typedHigherKindedType(tree: Tree): Tree

  99. def typedHigherKindedType(tree: Tree, mode: Int): Tree

  100. def typedHigherKindedType(tree: Tree, mode: Int, pt: Type): Tree

    Types a higher-kinded type tree -- pt denotes the expected kind

  101. def typedImport(imp: Import): Import

  102. def typedLabelDef(ldef: LabelDef): LabelDef

  103. def typedModuleDef(mdef: ModuleDef): Tree

    mdef

    ...

    returns

    ...

  104. def typedOperator(tree: Tree): Tree

    Types function part of an application

  105. def typedPattern(tree: Tree, pt: Type): Tree

    Types a pattern with prototype pt

  106. def typedPos(pos: Position)(tree: Tree): Tree

  107. def typedQualifier(tree: Tree): Tree

  108. def typedQualifier(tree: Tree, mode: Int): Tree

    Types qualifier tree of a select node.

    Types qualifier tree of a select node. E.g. is tree occurs in a context like tree.m.

  109. def typedQualifier(tree: Tree, mode: Int, pt: Type): Tree

    Types qualifier tree of a select node.

    Types qualifier tree of a select node. E.g. is tree occurs in a context like tree.m.

  110. def typedRefinement(stats: List[Tree]): Unit

  111. def typedStats(stats: List[Tree], exprOwner: Symbol): List[Tree]

  112. def typedTemplate(templ: Template, parents1: List[Tree]): Template

    templ

    ...

    parents1

    ...

    - Check that inner classes do not inherit from Annotation

    returns

    ...

  113. def typedType(tree: Tree): Tree

    Types a (fully parameterized) type tree

  114. def typedType(tree: Tree, mode: Int): Tree

    Types a (fully parameterized) type tree

  115. def typedTypeApply(tree: Tree, mode: Int, fun: Tree, args: List[Tree]): Tree

    Attributes
    protected
  116. def typedTypeConstructor(tree: Tree): Tree

  117. def typedTypeConstructor(tree: Tree, mode: Int): Tree

    Types a type constructor tree used in a new or supertype

  118. def typedTypeDef(tdef: TypeDef): TypeDef

  119. def typedUseCase(useCase: UseCase): Unit

  120. def typedValDef(vdef: ValDef): ValDef

    vdef

    ...

    returns

    ...

  121. def typerAddSyntheticMethods(templ: Template, clazz: Symbol, context: Context): Template

    In order to override this in the TreeCheckers Typer so synthetics aren't re-added all the time, it is exposed here the module/class typing methods go through it.

    In order to override this in the TreeCheckers Typer so synthetics aren't re-added all the time, it is exposed here the module/class typing methods go through it.

    Attributes
    protected
  122. def validateParentClasses(parents: List[Tree], selfType: Type): Unit

    Check that

    Check that

    • all parents are class types,
    • first parent class is not a mixin; following classes are mixins,
    • final classes are not inherited,

    - sealed classes are only inherited by classes which are nested within definition of base class, or that occur within same statement sequence,

    • self-type of current class is a subtype of self-type of each parent class.
    • no two parents define same symbol.
  123. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()
  126. final val xtypes: Boolean(false)

Inherited from TyperDiagnostics

Inherited from AnyRef

Inherited from Any