Packages

class ImplicitSearch extends Analyzer.Typer with Analyzer.ImplicitsContextErrors

A class that sets up an implicit search. For more info, see comments for inferImplicit.

Source
Implicits.scala
Linear Supertypes
Analyzer.ImplicitsContextErrors, Analyzer.Typer, Analyzer.TyperContextErrors, Analyzer.PatternTyper, Analyzer.Tag, Analyzer.Adaptation, Analyzer.TyperDiagnostics, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ImplicitSearch
  2. ImplicitsContextErrors
  3. Typer
  4. TyperContextErrors
  5. PatternTyper
  6. Tag
  7. Adaptation
  8. TyperDiagnostics
  9. AnyRef
  10. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ImplicitSearch(tree: Global.Tree, pt: Global.Type, isView: Boolean, context0: Analyzer.Context, pos0: Global.Position = NoPosition)

    tree

    The tree for which the implicit needs to be inserted.

    pt

    The original expected type of the implicit.

    isView

    We are looking for a view

    context0

    The context used for the implicit search

    pos0

    Position that is preferable for use in tracing and error reporting (useful when we infer synthetic stuff and pass EmptyTree in the tree argument) If it's set to NoPosition, then position-based services will use tree.pos

Type Members

  1. class ImplicitComputation extends AnyRef

    Prune ImplicitInfos down to either all the eligible ones or the best one.

Value Members

  1. object TyperErrorGen
    Definition Classes
    TyperContextErrors
  2. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  3. final def ##(): Int
    Definition Classes
    AnyRef → Any
  4. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from Analyzer.ImplicitSearch to any2stringadd[Analyzer.ImplicitSearch] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  5. def ->[B](y: B): (Analyzer.ImplicitSearch, B)
    Implicit
    This member is added by an implicit conversion from Analyzer.ImplicitSearch to ArrowAssoc[Analyzer.ImplicitSearch] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def AmbiguousImplicitError(info1: Analyzer.ImplicitInfo, tree1: Global.Tree, info2: Analyzer.ImplicitInfo, tree2: Global.Tree, pre1: String, pre2: String, trailer: String)(isView: Boolean, pt: Global.Type, tree: Global.Tree)(implicit context0: Analyzer.Context): Unit
    Definition Classes
    ImplicitsContextErrors
  8. def DivergingImplicitExpansionError(tree: Global.Tree, pt: Global.Type, sym: Global.Symbol)(implicit context0: Analyzer.Context): Unit
    Definition Classes
    ImplicitsContextErrors
  9. def adapt(tree: Global.Tree, mode: Mode, pt: Global.Type, original: Global.Tree = EmptyTree): Global.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.

    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, do SAM conversion (15) When in mode EXPRmode, apply a view If all this fails, error

    Attributes
    protected
    Definition Classes
    Typer
  10. def adaptAfterOverloadResolution(tree: Global.Tree, mode: Mode, pt: Global.Type = WildcardType, original: Global.Tree = EmptyTree): Global.Tree
    Definition Classes
    Typer
  11. def adaptCase(cdef: Global.CaseDef, mode: Mode, tpe: Global.Type): Global.CaseDef
    Definition Classes
    Typer
  12. def adaptToArguments(qual: Global.Tree, name: Global.Name, args: List[Global.Tree], pt: Global.Type, reportAmbiguous: Boolean = true, saveErrors: Boolean = true): Global.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.

    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.

    Definition Classes
    Typer
  13. def adaptToMember(qual: Global.Tree, searchTemplate: Global.Type, reportAmbiguous: Boolean = true, saveErrors: Boolean = true): Global.Tree
    Definition Classes
    Typer
  14. def adaptToMemberWithArgs(tree: Global.Tree, qual: Global.Tree, name: Global.Name, mode: Mode, reportAmbiguous: Boolean = true, saveErrors: Boolean = true): Global.Tree

    Try to apply an implicit conversion to qual so that it contains a method name.

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

    Definition Classes
    Typer
  15. def adaptToName(qual: Global.Tree, name: Global.Name): Global.Tree

    Try to apply an implicit conversion to qual to that it contains a member name of arbitrary type.

    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.

    Definition Classes
    Typer
  16. def allImplicits: List[Analyzer.SearchResult]
  17. def allImplicitsPoly(tvars: List[Global.TypeVar]): List[(Analyzer.SearchResult, List[Global.TypeConstraint])]
  18. def applicableInfos(iss: Analyzer.Infoss, isLocalToCallsite: Boolean): LinkedHashMap[Analyzer.ImplicitInfo, Analyzer.SearchResult]

    Computes from a list of lists of implicit infos a map which takes infos which are applicable for given expected type pt to their attributed trees.

    Computes from a list of lists of implicit infos a map which takes infos which are applicable for given expected type pt to their attributed trees.

    iss

    The given list of lists of implicit infos

    isLocalToCallsite

    Is implicit definition visible without prefix? If this is the case then symbols in preceding lists shadow symbols of the same name in succeeding lists.

    returns

    map from infos to search results

  19. def applyImplicitArgs(fun: Global.Tree): Global.Tree

    Find implicit arguments and pass them to given tree.

    Find implicit arguments and pass them to given tree.

    Definition Classes
    Typer
  20. def approximate(tp: Global.Type): Global.Type

    The expected type with all undetermined type parameters replaced with wildcards.

  21. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  22. def atOwner(tree: Global.Tree, owner: Global.Symbol): Analyzer.Typer
    Definition Classes
    Typer
  23. def atOwner(owner: Global.Symbol): Analyzer.Typer
    Definition Classes
    Typer
  24. def bestImplicit: Analyzer.SearchResult

    The result of the implicit search: First search implicits visible in current context.

    The result of the implicit search: First search implicits visible in current context. If that fails, search implicits in expected type pt.

    todo. the following lines should be deleted after we migrate delegate tag materialization to implicit macros If that fails, and pt is an instance of a ClassTag, try to construct a class tag. If that fails, and pt is an instance of a TypeTag, try to construct a type tag. If that fails, and pt is an instance of a ClassManifest, try to construct a class manifest. If that fails, and pt is an instance of a Manifest, try to construct a manifest. If that fails, and pt is an instance of a OptManifest, try to construct a class manifest and return NoManifest if construction fails. If all fails return SearchFailure

  25. def callToCompanionConstr(context: Analyzer.Context, calledFun: Global.Symbol): Boolean
    Definition Classes
    Typer
  26. def canAdaptConstantTypeToLiteral: Boolean

    Overridden to false in scaladoc and/or interactive.

    Overridden to false in scaladoc and/or interactive.

    Definition Classes
    Typer
  27. def canTranslateEmptyListToNil: Boolean
    Definition Classes
    Typer
  28. def checkClassType(tpt: Global.Tree): Boolean

    Check that tpt refers to a non-refinement class type

    Check that tpt refers to a non-refinement class type

    Definition Classes
    Typer
  29. def checkExistentialsFeature(pos: Global.Position, tpe: Global.Type, prefix: String): AnyVal
    Definition Classes
    Typer
  30. def checkFeature(pos: Global.Position, featureTrait: Global.Symbol, construct: ⇒ String = "", immediate: Boolean = false): Boolean

    Check whether feature given by featureTrait is enabled.

    Check whether feature given by featureTrait is enabled. If it is not, issue an error or a warning depending on whether the feature is required.

    construct

    A string expression that is substituted for "#" in the feature description string

    immediate

    When set, feature check is run immediately, otherwise it is run at the end of the typechecking run for the enclosing unit. This is done to avoid potential cyclic reference errors by implicits that are forced too early.

    returns

    if feature check is run immediately: true if feature is enabled, false otherwise if feature check is delayed or suppressed because we are past typer: true

    Definition Classes
    Typer
  31. def checkFinitary(classinfo: Global.ClassInfoType): Unit
    Definition Classes
    Typer
  32. def checkMethodStructuralCompatible(ddef: Global.DefDef): Unit

    Check if a structurally defined method violates implementation restrictions.

    Check if a structurally defined method violates implementation restrictions. A method cannot be called if it is a non-private member of a refinement type and if its parameter's types are any of:

    • the self-type of the refinement
    • a type member of the refinement
    • an abstract type declared outside of the refinement.
    • an instance of a value class Furthermore, the result type may not be a value class either
    Definition Classes
    Typer
  33. def checkNonCyclic(defn: Global.Tree, tpt: Global.Tree): Unit
    Definition Classes
    Typer
  34. def checkNonCyclic(sym: Global.Symbol): Unit
    Definition Classes
    Typer
  35. def checkNonCyclic(pos: Global.Position, tp: Global.Type, lockedSym: Global.Symbol): Boolean
    Definition Classes
    Typer
  36. def checkNonCyclic(pos: Global.Position, tp: Global.Type): Boolean

    Check that type tp is not a subtype of itself.

    Check that type tp is not a subtype of itself.

    Definition Classes
    Typer
  37. def checkParamsConvertible(tree: Global.Tree, tpe0: Global.Type): Unit
    Definition Classes
    Typer
  38. def checkStablePrefixClassType(tpt: Global.Tree): Boolean

    Check that tpt refers to a class type with a stable prefix.

    Check that tpt refers to a class type with a stable prefix.

    Definition Classes
    Typer
  39. def checkValidAdaptation(t: Global.Tree, args: List[Global.Tree]): Boolean
    Definition Classes
    Adaptation
  40. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  41. def computeMacroDefType(ddef: Global.DefDef, pt: Global.Type): Global.Type
    Definition Classes
    Typer
  42. def computeParamAliases(clazz: Global.Symbol, vparamss: List[List[Global.ValDef]], rhs: Global.Tree): Unit

    Enter all aliases of local parameter accessors.

    Enter all aliases of local parameter accessors.

    Definition Classes
    Typer
  43. def computeType(tree: Global.Tree, pt: Global.Type): Global.Type
    Definition Classes
    Typer
  44. final def constrTyperIf(inConstr: Boolean): Analyzer.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.

    Definition Classes
    Typer
  45. var context: Analyzer.Context
    Definition Classes
    Typer
  46. val context0: Analyzer.Context
  47. def context1: Analyzer.Context
    Definition Classes
    Typer
  48. def ctx_s: String
  49. def cyclicReferenceMessage(sym: Global.Symbol, tree: Global.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
  50. def doTypedApply(tree: Global.Tree, fun0: Global.Tree, args: List[Global.Tree], mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  51. def doTypedUnapply(tree: Global.Tree, funOrig: Global.Tree, funOverloadResolved: Global.Tree, args: List[Global.Tree], mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    PatternTyper
  52. def dropExistential(tp: Global.Type): Global.Type
    Definition Classes
    Typer
  53. def ensuring(cond: (Analyzer.ImplicitSearch) ⇒ Boolean, msg: ⇒ Any): Analyzer.ImplicitSearch
    Implicit
    This member is added by an implicit conversion from Analyzer.ImplicitSearch to Ensuring[Analyzer.ImplicitSearch] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  54. def ensuring(cond: (Analyzer.ImplicitSearch) ⇒ Boolean): Analyzer.ImplicitSearch
    Implicit
    This member is added by an implicit conversion from Analyzer.ImplicitSearch to Ensuring[Analyzer.ImplicitSearch] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  55. def ensuring(cond: Boolean, msg: ⇒ Any): Analyzer.ImplicitSearch
    Implicit
    This member is added by an implicit conversion from Analyzer.ImplicitSearch to Ensuring[Analyzer.ImplicitSearch] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  56. def ensuring(cond: Boolean): Analyzer.ImplicitSearch
    Implicit
    This member is added by an implicit conversion from Analyzer.ImplicitSearch to Ensuring[Analyzer.ImplicitSearch] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  57. def enterSym(txt: Analyzer.Context, tree: Global.Tree): Analyzer.Context
    Attributes
    protected
    Definition Classes
    Typer
  58. def enterSyms(txt: Analyzer.Context, trees: List[Global.Tree]): Unit
    Attributes
    protected
    Definition Classes
    Typer
  59. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  60. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  61. def extractorForUncheckedType(pos: Global.Position, pt: Global.Type): Global.Tree
    Definition Classes
    PatternTyper
  62. def failure(what: Any, reason: String, pos: Global.Position = this.pos): Analyzer.SearchResult
  63. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  64. def finishMethodSynthesis(templ: Global.Template, clazz: Global.Symbol, context: Analyzer.Context): Global.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. ...but it turns out it's also the ideal spot for namer/typer coordination for the tricky method synthesis scenarios, so we'll make it that.

    Attributes
    protected
    Definition Classes
    Typer
  65. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from Analyzer.ImplicitSearch to StringFormat[Analyzer.ImplicitSearch] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  66. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  67. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  68. def improves(info1: Analyzer.ImplicitInfo, info2: Analyzer.ImplicitInfo): Boolean

    Is implicit info info1 better than implicit info info2?

  69. val infer: Analyzer.Inferencer
    Definition Classes
    Typer
  70. def inferSamType(fun: Global.Tree, pt: Global.Type, mode: Mode): Global.SAMFunction

    Synthesize and type check the implementation of a type with a Single Abstract Method.

    Synthesize and type check the implementation of a type with a Single Abstract Method.

    Based on a type checked Function node { (p1: T1, ..., pN: TN) => body } : S where S is the expected type that defines a single abstract method (call it apply for the example), that has signature (p1: T1', ..., pN: TN'): T', synthesize the instantiation of the following anonymous class

    new S { def apply$body(p1: T1, ..., pN: TN): T = body def apply(p1: T1', ..., pN: TN'): T' = apply$body(p1,..., pN) }

    The apply method is identified by the argument sam; S corresponds to the argument pt, If pt is not fully defined, we derive samClassTpFullyDefined by inferring any unknown type parameters.

    The types T1' ... TN' and T' are derived from the method signature of the sam method, as seen from the fully defined samClassTpFullyDefined.

    The function's body is put in a (static) method in the class definition to enforce scoping. S's members should not be in scope in body. (Putting it in the block outside the class runs into implementation problems described below)

    The restriction on implicit arguments (neither S's constructor, nor sam may take an implicit argument list), is to keep the implementation of type inference (the computation of samClassTpFullyDefined) simple.

    Impl notes:

    • fun has a FunctionType, but the expected type pt is some SAM type -- let's remedy that
    • fun is fully attributed, so we'll have to wrangle some symbols into shape (owner change, vparam syms)
    • after experimentation, it works best to type check function literals fully first and then adapt to a sam type, as opposed to a sam-specific code paths earlier on in type checking (in typedFunction). For one, we want to emit the same bytecode regardless of whether the expected function type is a built-in FunctionN or some SAM type
    Definition Classes
    Typer
  71. def inferView(tree: Global.Tree, from: Global.Type, to: Global.Type, reportAmbiguous: Boolean = true, saveErrors: Boolean = true): Global.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.

    saveErrors

    Should ambiguous and divergent implicit errors that were buffered during the inference of a view be put into the original buffer. False iff we don't care about them.

    Definition Classes
    Typer
  72. def instantiate(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  73. def instantiateExpectingUnit(tree: Global.Tree, mode: Mode): Global.Tree

    If the expected type is Unit: try instantiating type arguments with expected type Unit, but if that fails, try again with pt = WildcardType and discard the expression.

    If the expected type is Unit: try instantiating type arguments with expected type Unit, but if that fails, try again with pt = WildcardType and discard the expression.

    Definition Classes
    Typer
  74. def instantiatePossiblyExpectingUnit(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  75. def isCapturedExistential(sym: Global.Symbol): Boolean
    Definition Classes
    Typer
  76. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  77. def isNamedApplyBlock(tree: Global.Tree): Boolean

    Is tree a block created by a named application?

    Is tree a block created by a named application?

    Definition Classes
    Typer
  78. def isPlausiblyCompatible(tp: Global.Type, pt: Global.Type): Boolean
  79. def isReferencedFrom(ctx: Analyzer.Context, sym: Global.Symbol): Boolean
    Definition Classes
    Typer
  80. def isStale(sym: Global.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.

    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.

    Definition Classes
    Typer
  81. def isValid(sym: Global.Symbol): Boolean

    Should implicit definition symbol sym be considered for applicability testing? This is the case if one of the following holds:

    Should implicit definition symbol sym be considered for applicability testing? This is the case if one of the following holds:

    • the symbol's type is initialized
    • the symbol comes from a classfile
    • the symbol comes from a different sourcefile than the current one
    • the symbol and the accessed symbol's definitions come before, and do not contain the closest enclosing definition, // see #3373
    • the symbol's definition is a val, var, or def with an explicit result type The aim of this method is to prevent premature cyclic reference errors by computing the types of only those implicits for which one of these conditions is true.
  82. val isView: Boolean
  83. def labelTyper(ldef: Global.LabelDef): Analyzer.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.

    Definition Classes
    Typer
  84. final def lookupTransformed(tree: Global.Tree): Option[Global.Tree]
    Definition Classes
    Typer
  85. def macroImplementationNotFoundMessage(name: Global.Name): String

    This file will be the death of me.

    This file will be the death of me.

    Attributes
    protected
    Definition Classes
    TyperContextErrors
  86. def member(qual: Global.Tree, name: Global.Name): Global.Symbol

    The member with given name of given qualifier tree

    The member with given name of given qualifier tree

    Definition Classes
    Typer
  87. def missingSelectErrorTree(tree: Global.Tree, qual: Global.Tree, name: Global.Name): Global.Tree
    Definition Classes
    Typer
  88. def namer: Analyzer.Namer
    Definition Classes
    Typer
  89. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  90. def needsInstantiation(tparams: List[Global.Symbol], formals: List[Global.Type], args: List[Global.Tree]): Boolean

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

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

    Definition Classes
    Typer
  91. def normSubType(tp: Global.Type, pt: Global.Type): Boolean
  92. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  93. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  94. def packCaptured(tpe: Global.Type): Global.Type
    Definition Classes
    Typer
  95. def packSymbols(hidden: List[Global.Symbol], tp: Global.Type): Global.Type

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

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

    Definition Classes
    Typer
  96. def packedType(tree: Global.Tree, owner: Global.Symbol): Global.Type

    convert local symbols and skolems to existentials

    convert local symbols and skolems to existentials

    Definition Classes
    Typer
  97. def packedTypes(trees: List[Global.Tree]): List[Global.Type]
    Definition Classes
    Typer
  98. def permanentlyHiddenWarning(pos: Global.Position, hidden: Global.Name, defn: Global.Symbol): Unit
    Definition Classes
    TyperDiagnostics
  99. def phasedAppliedType(sym: Global.Symbol, args: List[Global.Type]): Global.Type
    Definition Classes
    Typer
  100. def pos: Global.Position
  101. val pos0: Global.Position
  102. val pt: Global.Type
  103. def qualifyingClass(tree: Global.Tree, qual: Global.Name, packageOK: Boolean): Global.Symbol

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

    The qualifying class of a this or super with prefix qual. packageOk is equal false when qualifying class symbol

    Definition Classes
    Typer
  104. def reallyExists(sym: Global.Symbol): Boolean

    Is symbol defined and not stale?

    Is symbol defined and not stale?

    Definition Classes
    Typer
  105. def reenterTypeParams(tparams: List[Global.TypeDef]): List[Global.Symbol]
    Definition Classes
    Typer
  106. def reenterValueParams(vparamss: List[List[Global.ValDef]]): Unit
    Definition Classes
    Typer
  107. def reportTypeError(context0: Analyzer.Context, pos: Global.Position, ex: Global.TypeError): Unit

    Report a type error.

    Report a type error.

    pos

    The position where to report the error

    ex

    The exception that caused the error

    Definition Classes
    TyperDiagnostics
  108. def resolveClassTag(pos: Global.Position, tp: Global.Type, allowMaterialization: Boolean = true): Global.Tree

    Finds in scope or materializes a ClassTag.

    Finds in scope or materializes a ClassTag. Should be used instead of ClassManifest every time compiler needs to persist an erasure.

    Once upon a time, we had an ErasureTag which was to ClassTag the same that WeakTypeTag is for TypeTag. However we found out that we don't really need this concept, so it got removed.

    pos

    Position for error reporting. Please, provide meaningful value.

    tp

    Type we're looking a ClassTag for, e.g. resolveClassTag(pos, IntTpe) will look for ClassTag[Int].

    allowMaterialization

    If true (default) then the resolver is allowed to launch materialization macros when there's no class tag in scope. If false then materialization macros are prohibited from running.

    returns

    Tree that represents an scala.reflect.ClassTag for tp if everything is okay. EmptyTree if the result contains unresolved (i.e. not spliced) type parameters and abstract type members. EmptyTree if allowMaterialization is false, and there is no class tag in scope.

    Definition Classes
    Tag
  109. def resolveTypeTag(pos: Global.Position, pre: Global.Type, tp: Global.Type, concrete: Boolean, allowMaterialization: Boolean = true): Global.Tree

    Finds in scope or materializes an WeakTypeTag (if concrete is false) or a TypeTag (if concrete is true).

    Finds in scope or materializes an WeakTypeTag (if concrete is false) or a TypeTag (if concrete is true).

    pos

    Position for error reporting. Please, provide meaningful value.

    pre

    Prefix that represents a universe this type tag will be bound to. If pre is set to NoType, then any type tag in scope will do, regardless of its affiliation. If pre is set to NoType, and tag resolution involves materialization, then mkRuntimeUniverseRef will be used.

    tp

    Type we're looking a TypeTag for, e.g. resolveTypeTag(pos, mkRuntimeUniverseRef, IntTpe, false) will look for scala.reflect.runtime.universe.TypeTag[Int].

    concrete

    If true then the result must not contain unresolved (i.e. not spliced) type parameters and abstract type members. If false then the function will always succeed (abstract types will be reified as free types).

    allowMaterialization

    If true (default) then the resolver is allowed to launch materialization macros when there's no type tag in scope. If false then materialization macros are prohibited from running.

    returns

    Tree that represents a scala.reflect.TypeTag for tp if everything is okay. EmptyTree if concrete is true and the result contains unresolved (i.e. not spliced) type parameters and abstract type members. EmptyTree if allowMaterialization is false, and there is no array tag in scope.

    Definition Classes
    Tag
  110. def rewrappingWrapperTrees(f: (Global.Tree) ⇒ List[Global.Tree]): (Global.Tree) ⇒ List[Global.Tree]

    For flatMapping a list of trees when you want the DocDefs and Annotated to be transparent.

    For flatMapping a list of trees when you want the DocDefs and Annotated to be transparent.

    Definition Classes
    Typer
  111. val runDefinitions: reflect.internal.Definitions.definitions.RunDefinitions
    Definition Classes
    Typer
  112. def samToFunctionType(tp: Global.Type, sam: Global.Symbol = NoSymbol): Global.Type

    Convert a SAM type to the corresponding FunctionType, extrapolating BoundedWildcardTypes in the process (no type precision is lost by the extrapolation, but this facilitates dealing with the types arising from Java's use-site variance).

    Convert a SAM type to the corresponding FunctionType, extrapolating BoundedWildcardTypes in the process (no type precision is lost by the extrapolation, but this facilitates dealing with the types arising from Java's use-site variance).

    Definition Classes
    Typer
  113. val searchId: Int
  114. def searchImplicit(implicitInfoss: Analyzer.Infoss, isLocalToCallsite: Boolean): Analyzer.SearchResult

    Search list of implicit info lists for one matching prototype pt.

    Search list of implicit info lists for one matching prototype pt. If found return a search result with a tree from found implicit info which is typed with expected type pt. Otherwise return SearchFailure.

    implicitInfoss

    The given list of lists of implicit infos

    isLocalToCallsite

    Is implicit definition visible without prefix? If this is the case then symbols in preceding lists shadow symbols of the same name in succeeding lists.

  115. def silent[T](op: (Analyzer.Typer) ⇒ T, reportAmbiguousErrors: Boolean = context.ambiguousErrors, newtree: Global.Tree = context.tree): Analyzer.SilentResult[T]
    Definition Classes
    Typer
  116. def stabilize(tree: Global.Tree, pre: Global.Type, mode: Mode, pt: Global.Type): Global.Tree

    Post-process an identifier or selection node, performing the following:

    Post-process an identifier or selection node, performing the following:

    1. Check that non-function pattern expressions are stable (ignoring volatility concerns -- scala/bug#6815) (and narrow the type of modules: a module reference in a pattern has type Foo.type, not "object Foo") 2. Check that packages and static modules are not used as values 3. Turn tree type into stable type if possible and required by context. 4. Give getClass calls a more precise type based on the type of the target of the call.
    Attributes
    protected
    Definition Classes
    Typer
  117. def stabilizeFun(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  118. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  119. def synthesizePartialFunction(paramName: Global.TermName, paramPos: Global.Position, paramSynthetic: Boolean, tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree

    synthesize and type check a PartialFunction implementation based on the match in tree

    synthesize and type check a PartialFunction implementation based on the match in tree

    param => sel match { cases } becomes:

    new AbstractPartialFunction[$argTp, $matchResTp] { def applyOrElse[A1 <: $argTp, B1 >: $matchResTp]($param: A1, default: A1 => B1): B1 = $selector match { $cases } def isDefinedAt(x: $argTp): Boolean = $selector match { $casesTrue } }

    TODO: it would be nicer to generate the tree specified above at once and type it as a whole, there are two gotchas:

    • matchResTp may not be known until we've typed the match (can only use resTp when it's fully defined),
      • if we typed the match in isolation first, you'd know its result type, but would have to re-jig the owner structure
      • could we use a type variable for matchResTp and backpatch it?
    • occurrences of this in cases or sel must resolve to the this of the class originally enclosing the match, not of the anonymous partial function subclass

    an alternative TODO: add partial function AST node or equivalent and get rid of this synthesis --> do everything in uncurry (or later) however, note that pattern matching codegen is designed to run *before* uncurry

    Definition Classes
    Typer
  120. def toString(): String
    Definition Classes
    AnyRef → Any
  121. final def transformedOr(tree: Global.Tree, op: ⇒ Global.Tree): Global.Tree
    Definition Classes
    Typer
    Annotations
    @inline()
  122. final def transformedOrTyped(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  123. val tree: Global.Tree
  124. def tree_s: String
  125. def typed(tree: Global.Tree, mode: Mode): Global.Tree
    Definition Classes
    Typer
  126. def typed(tree: Global.Tree, pt: Global.Type): Global.Tree

    Types expression tree with given prototype pt.

    Types expression tree with given prototype pt.

    Definition Classes
    Typer
  127. def typed(tree: Global.Tree): Global.Tree

    Types expression or definition tree.

    Types expression or definition tree.

    Definition Classes
    Typer
  128. def typed(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  129. def typed1(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  130. def typedAnnotation(ann: Global.Tree, mode: Mode = EXPRmode): Global.AnnotationInfo

    Convert an annotation constructor call into an AnnotationInfo.

    Convert an annotation constructor call into an AnnotationInfo.

    Definition Classes
    Typer
  131. def typedArg(arg: Global.Tree, mode: Mode, newmode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  132. def typedArgs(args: List[Global.Tree], mode: Mode): collection.immutable.List[Global.Tree]
    Definition Classes
    Typer
  133. def typedArgsForFormals(args: List[Global.Tree], formals: List[Global.Type], mode: Mode): List[Global.Tree]
    Definition Classes
    PatternTyper
  134. def typedBlock(block0: Global.Block, mode: Mode, pt: Global.Type): Global.Block
    Definition Classes
    Typer
  135. def typedByValueExpr(tree: Global.Tree, pt: Global.Type = WildcardType): Global.Tree
    Definition Classes
    Typer
  136. def typedCase(cdef: Global.CaseDef, pattpe: Global.Type, pt: Global.Type): Global.CaseDef
    Definition Classes
    Typer
  137. def typedCases(cases: List[Global.CaseDef], pattp: Global.Type, pt: Global.Type): List[Global.CaseDef]
    Definition Classes
    Typer
  138. def typedClassDef(cdef: Global.ClassDef): Global.Tree
    Definition Classes
    Typer
  139. def typedClassOf(tree: Global.Tree, tpt: Global.Tree, noGen: Boolean = false): Global.Tree
    Definition Classes
    Typer
  140. def typedConstructorPattern(fun0: Global.Tree, pt: Global.Type): Global.Tree
    Definition Classes
    PatternTyper
  141. def typedDefDef(ddef: Global.DefDef): Global.DefDef
    Definition Classes
    Typer
  142. def typedDocDef(docDef: Global.DocDef, mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  143. def typedExistentialTypeTree(tree: Global.ExistentialTypeTree, mode: Mode): Global.Tree
    Attributes
    protected
    Definition Classes
    Typer
  144. def typedHigherKindedType(tree: Global.Tree, mode: Mode): Global.Tree
    Definition Classes
    Typer
  145. def typedHigherKindedType(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree

    Types a higher-kinded type tree -- pt denotes the expected kind and must be one of Kind.WildCard and Kind.FromParams

    Types a higher-kinded type tree -- pt denotes the expected kind and must be one of Kind.WildCard and Kind.FromParams

    Definition Classes
    Typer
  146. def typedImport(imp: Global.Import): Global.Import
    Definition Classes
    Typer
  147. def typedInPattern(tree: Global.Typed, mode: Mode, pt: Global.Type): Global.Tree
    Attributes
    protected
    Definition Classes
    PatternTyper
  148. def typedLabelDef(ldef: Global.LabelDef): Global.LabelDef
    Definition Classes
    Typer
  149. def typedMatch(selector: Global.Tree, cases: List[Global.CaseDef], mode: Mode, pt: Global.Type, tree: Global.Tree = EmptyTree): Global.Match
    Definition Classes
    Typer
  150. def typedModifiers(mods: Global.Modifiers): Global.Modifiers

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

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

    However reification does need annotation definitions to proceed. Unfortunately, AnnotationInfo doesn't provide enough info to reify it in general case. The biggest problem is with the "atp: Type" field, which cannot be reified in some situations that involve locally defined annotations. See more about that in Reifiers.scala.

    That's why the original tree gets saved into original field of AnnotationInfo (happens elsewhere). The field doesn't get pickled/unpickled and exists only during a single compilation run. This simultaneously allows us to reify annotations and to preserve backward compatibility.

    Definition Classes
    Typer
  151. def typedModuleDef(mdef: Global.ModuleDef): Global.Tree
    Definition Classes
    Typer
  152. def typedOperator(tree: Global.Tree): Global.Tree

    Types function part of an application

    Types function part of an application

    Definition Classes
    Typer
  153. def typedParentTypes(templ: Global.Template): List[Global.Tree]
    Definition Classes
    Typer
  154. def typedPattern(tree: Global.Tree, pt: Global.Type): Global.Tree

    Types a pattern with prototype pt

    Types a pattern with prototype pt

    Definition Classes
    Typer
  155. def typedPos(pos: Global.Position)(tree: Global.Tree): Global.Tree
    Definition Classes
    Typer
  156. def typedPos(pos: Global.Position, mode: Mode, pt: Global.Type)(tree: Global.Tree): Global.Tree
    Definition Classes
    Typer
  157. def typedQualifier(tree: Global.Tree): Global.Tree
    Definition Classes
    Typer
  158. def typedQualifier(tree: Global.Tree, mode: Mode): Global.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.

    Definition Classes
    Typer
  159. def typedQualifier(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.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.

    Definition Classes
    Typer
  160. def typedRefinement(templ: Global.Template): Unit
    Definition Classes
    Typer
  161. def typedStarInPattern(tree: Global.Tree, mode: Mode, pt: Global.Type): Global.Tree
    Attributes
    protected
    Definition Classes
    PatternTyper
  162. def typedStats(stats: List[Global.Tree], exprOwner: Global.Symbol, warnPure: Boolean = true): List[Global.Tree]
    Definition Classes
    Typer
  163. def typedTemplate(templ0: Global.Template, parents1: List[Global.Tree]): Global.Template

    Check that inner classes do not inherit from Annotation

    Check that inner classes do not inherit from Annotation

    Definition Classes
    Typer
  164. def typedType(tree: Global.Tree): Global.Tree

    Types a (fully parameterized) type tree

    Types a (fully parameterized) type tree

    Definition Classes
    Typer
  165. def typedType(tree: Global.Tree, mode: Mode): Global.Tree

    Types a (fully parameterized) type tree

    Types a (fully parameterized) type tree

    Definition Classes
    Typer
  166. def typedTypeApply(tree: Global.Tree, mode: Mode, fun: Global.Tree, args: List[Global.Tree]): Global.Tree
    Attributes
    protected
    Definition Classes
    Typer
  167. def typedTypeConstructor(tree: Global.Tree): Global.Tree
    Definition Classes
    Typer
  168. def typedTypeConstructor(tree: Global.Tree, mode: Mode): Global.Tree

    Types a type constructor tree used in a new or supertype

    Types a type constructor tree used in a new or supertype

    Definition Classes
    Typer
  169. def typedTypeDef(tdef: Global.TypeDef): Global.TypeDef
    Definition Classes
    Typer
  170. def typedValDef(vdef: Global.ValDef): Global.ValDef
    Definition Classes
    Typer
  171. final def typerWithCondLocalContext[T](c: ⇒ Analyzer.Context)(cond: Boolean)(f: (Analyzer.Typer) ⇒ T): T
    Definition Classes
    Typer
    Annotations
    @inline()
  172. final def typerWithLocalContext[T](c: Analyzer.Context)(f: (Analyzer.Typer) ⇒ T): T
    Definition Classes
    Typer
    Annotations
    @inline()
  173. val undetParams: List[Global.Symbol]

    The type parameters to instantiate

  174. def undet_s: String
  175. def validateParentClasses(parents: List[Global.Tree], selfType: Global.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.
    Definition Classes
    Typer
  176. def viewExists(from: Global.Type, to: Global.Type): Boolean
    Definition Classes
    Typer
  177. def virtualizedMatch(match_: Global.Match, mode: Mode, pt: Global.Type): Global.Tree
    Definition Classes
    Typer
  178. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  179. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  180. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  181. def warnTypeParameterShadow(tparams: List[Global.TypeDef], sym: Global.Symbol): Unit
    Definition Classes
    TyperDiagnostics
  182. val wildPt: Global.Type
  183. final def withCondConstrTyper[T](inConstr: Boolean)(f: (Analyzer.Typer) ⇒ T): T
    Definition Classes
    Typer
    Annotations
    @inline()
  184. def wrapClassTagUnapply(uncheckedPattern: Global.Tree, classTagExtractor: Global.Tree, pt: Global.Type): Global.Tree
    Definition Classes
    PatternTyper
  185. def wrapResult(tree: Global.Tree): Analyzer.SearchResult
  186. def →[B](y: B): (Analyzer.ImplicitSearch, B)
    Implicit
    This member is added by an implicit conversion from Analyzer.ImplicitSearch to ArrowAssoc[Analyzer.ImplicitSearch] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
  187. object checkDead
    Definition Classes
    TyperDiagnostics
  188. object checkUnused
    Definition Classes
    TyperDiagnostics
  189. object checkNoEscaping extends Global.TypeMap

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

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

    Definition Classes
    Typer
  190. object dyna
    Definition Classes
    Typer

Inherited from Analyzer.ImplicitsContextErrors

Inherited from Analyzer.Typer

Inherited from Analyzer.TyperContextErrors

Inherited from Analyzer.PatternTyper

Inherited from Analyzer.Tag

Inherited from Analyzer.Adaptation

Inherited from Analyzer.TyperDiagnostics

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from Analyzer.ImplicitSearch to any2stringadd[Analyzer.ImplicitSearch]

Inherited by implicit conversion StringFormat from Analyzer.ImplicitSearch to StringFormat[Analyzer.ImplicitSearch]

Inherited by implicit conversion Ensuring from Analyzer.ImplicitSearch to Ensuring[Analyzer.ImplicitSearch]

Inherited by implicit conversion ArrowAssoc from Analyzer.ImplicitSearch to ArrowAssoc[Analyzer.ImplicitSearch]

Ungrouped