SymbolLoader

abstract class SymbolLoader extends LazyType

A lazy type that completes itself by calling parameter doComplete. Any linked modules/classes or module classes are also initialized.

class LazyType
trait Symbol => LazyType
class Type
trait Showable
trait Hashable
class Object
trait Matchable
class Any

Value members

Abstract methods

Description of the resource (ClassPath, AbstractFile) being processed by this loader

Description of the resource (ClassPath, AbstractFile) being processed by this loader

Load source or class file for root, return

Load source or class file for root, return

Concrete methods

override def complete(root: SymDenotation)(using Context): Unit

Sets all missing fields of given denotation

Sets all missing fields of given denotation

Definition Classes

A proxy to this loader that keeps the doComplete operation but provides fresh slots for scope/sourceModule/moduleClass

A proxy to this loader that keeps the doComplete operation but provides fresh slots for scope/sourceModule/moduleClass

Inherited methods

def &(that: Type)(using Context): Type
Inherited from:
Type
final def <:<(that: Type)(using Context): Boolean

Is this type a subtype of that type?

Is this type a subtype of that type?

Inherited from:
Type
final def =:=(that: Type)(using Context): Boolean

Is this type the same as that type? This is the case iff this <:< that and that <:< this.

Is this type the same as that type? This is the case iff this <:< that and that <:< this.

Inherited from:
Type

The set of abstract term members of this type.

The set of abstract term members of this type.

Inherited from:
Type

The set of abstract type members of this type.

The set of abstract type members of this type.

Inherited from:
Type

All members of this type. Warning: this can be expensive to compute!

All members of this type. Warning: this can be expensive to compute!

Inherited from:
Type

If this is an AndType, the number of factors, 1 for all other types

If this is an AndType, the number of factors, 1 for all other types

Inherited from:
Type
def andThen[A](g: LazyType => A): T1 => A
Inherited from:
Function1
Inherited from:
Type
def apply(module: TermSymbol, modcls: ClassSymbol): LazyType
Inherited from:
LazyType
def apply(sym: Symbol): LazyType
Inherited from:
LazyType
final def asSeenFrom(pre: Type, cls: Symbol)(using Context): Type

This type seen as if it were the type of a member of prefix type pre declared in class cls.

This type seen as if it were the type of a member of prefix type pre declared in class cls.

Inherited from:
Type
def atoms(using Context): Atoms

The singleton types that must or may be in this type. @see Atoms. Overridden and cached in OrType.

The singleton types that must or may be in this type. @see Atoms. Overridden and cached in OrType.

Inherited from:
Type

The base classes of this type as determined by ClassDenotation in linearization order, with the class itself as first element. Inherited by all type proxies. Overridden for And and Or types. Nil for all other types.

The base classes of this type as determined by ClassDenotation in linearization order, with the class itself as first element. Inherited by all type proxies. Overridden for And and Or types. Nil for all other types.

Inherited from:
Type
final def baseType(base: Symbol)(using Context): Type

The basetype of this type with given class symbol, NoType if base is not a class.

The basetype of this type with given class symbol, NoType if base is not a class.

Inherited from:
Type
final def bounds(using Context): TypeBounds

This type seen as a TypeBounds

This type seen as a TypeBounds

Inherited from:
Type
final def classSymbol(using Context): Symbol

The least class or trait of which this type is a subtype or parameterized instance, or NoSymbol if none exists (either because this type is not a value type, or because superclasses are ambiguous).

The least class or trait of which this type is a subtype or parameterized instance, or NoSymbol if none exists (either because this type is not a value type, or because superclasses are ambiguous).

Inherited from:
Type

The least (wrt <:<) set of class symbols of which this type is a subtype

The least (wrt <:<) set of class symbols of which this type is a subtype

Inherited from:
Type

The type parameters computed by the completer before completion has finished

The type parameters computed by the completer before completion has finished

Inherited from:
LazyType
def compose[A](g: A => Symbol): A => R
Inherited from:
Function1
final def computeHash(bs: Binders): Int

Compute hashcode relative to enclosing binders bs

Compute hashcode relative to enclosing binders bs

Inherited from:
UncachedGroundType
Inherited from:
Type

Does this type contain wildcard types?

Does this type contain wildcard types?

Inherited from:
Type

The set of distinct symbols referred to by this type, after all aliases are expanded

The set of distinct symbols referred to by this type, after all aliases are expanded

Inherited from:
Type
def curried: T1 => T2 => R
Inherited from:
Function2
final def dealias(using Context): Type

Follow aliases and dereferences LazyRefs, annotated types and instantiated TypeVars until type is no longer alias type, annotated type, LazyRef, or instantiated type variable.

Follow aliases and dereferences LazyRefs, annotated types and instantiated TypeVars until type is no longer alias type, annotated type, LazyRef, or instantiated type variable.

Inherited from:
Type
final def dealiasKeepAnnots(using Context): Type

Follow aliases and dereferences LazyRefs and instantiated TypeVars until type is no longer alias type, LazyRef, or instantiated type variable. Goes through annotated types and rewraps annotations on the result.

Follow aliases and dereferences LazyRefs and instantiated TypeVars until type is no longer alias type, LazyRef, or instantiated type variable. Goes through annotated types and rewraps annotations on the result.

Inherited from:
Type
final def dealiasKeepOpaques(using Context): Type

Follow non-opaque aliases and dereferences LazyRefs, annotated types and instantiated TypeVars until type is no longer alias type, annotated type, LazyRef, or instantiated type variable.

Follow non-opaque aliases and dereferences LazyRefs, annotated types and instantiated TypeVars until type is no longer alias type, annotated type, LazyRef, or instantiated type variable.

Inherited from:
Type

Like dealiasKeepAnnots, but keeps only refining annotations

Like dealiasKeepAnnots, but keeps only refining annotations

Inherited from:
Type
final def decl(name: Name)(using Context): Denotation

A denotation containing the declaration(s) in this type with the given name. The result is either a SymDenotation or a MultiDenotation of SymDenotations. The info(s) are the original symbol infos, no translation takes place.

A denotation containing the declaration(s) in this type with the given name. The result is either a SymDenotation or a MultiDenotation of SymDenotations. The info(s) are the original symbol infos, no translation takes place.

Inherited from:
Type
Inherited from:
LazyType
final def decls(using Context): Scope

The scope of all declarations of this type. Defined by ClassInfo, inherited by type proxies. Empty scope for all other types.

The scope of all declarations of this type. Defined by ClassInfo, inherited by type proxies. Empty scope for all other types.

Inherited from:
Type
final def deconst(using Context): Type

Widen from constant type to its underlying non-constant base type.

Widen from constant type to its underlying non-constant base type.

Inherited from:
Type

If this is a prototype with some ignored component, reveal one more layer of it. Otherwise the type itself.

If this is a prototype with some ignored component, reveal one more layer of it. Otherwise the type itself.

Inherited from:
Type

If this is a prototype with some ignored component, reveal it, and deepen the result transitively. Otherwise the type itself.

If this is a prototype with some ignored component, reveal it, and deepen the result transitively. Otherwise the type itself.

Inherited from:
Type

Does this type have a supertype with an annotation satisfying given predicate p?

Does this type have a supertype with an annotation satisfying given predicate p?

Inherited from:
Type
final def derivesFrom(cls: Symbol)(using Context): Boolean

True if this type is an instance of the given cls or an instance of a non-bottom subclass of cls.

True if this type is an instance of the given cls or an instance of a non-bottom subclass of cls.

Inherited from:
Type
final def deskolemized(using Context): Type

Approximate this type with a type that does not contain skolem types.

Approximate this type with a type that does not contain skolem types.

Inherited from:
Type
def dropAnnot(cls: Symbol)(using Context): Type

Drop annotation of given cls from this type

Drop annotation of given cls from this type

Inherited from:
Type

Dealias, and if result is a dependent function type, drop the apply refinement.

Dealias, and if result is a dependent function type, drop the apply refinement.

Inherited from:
Type

If this is a proto type, WildcardType, otherwise the type itself

If this is a proto type, WildcardType, otherwise the type itself

Inherited from:
Type
Inherited from:
Type
def eql(that: Type): Boolean

Equality used for hash-consing; uses eq on all recursive invocations, except where a BindingType is involved. The latter demand a deep isomorphism check.

Equality used for hash-consing; uses eq on all recursive invocations, except where a BindingType is involved. The latter demand a deep isomorphism check.

Inherited from:
Type
final def equals(that: Any, bs: BinderPairs): Boolean

Compare this == that, assuming corresponding binders in bs are equal. The normal equals should be equivalent to equals(that, null). We usually overrideequalswhen we overrideisoexcept if theequals` comes from a case class, so it already has the right definition anyway.

Compare this == that, assuming corresponding binders in bs are equal. The normal equals should be equivalent to equals(that, null). We usually overrideequalswhen we overrideisoexcept if theequals` comes from a case class, so it already has the right definition anyway.

Inherited from:
Type
final def exists: Boolean

Is this type different from NoType?

Is this type different from NoType?

Inherited from:
Type
final def existsPart(p: Type => Boolean, stopAt: StopAt, forceLazy: Boolean)(using Context): Boolean

Returns true if there is a part of this type that satisfies predicate p.

Returns true if there is a part of this type that satisfies predicate p.

Inherited from:
Type
def fallbackToText(printer: Printer): Text

A fallback text representation, if the pattern matching in Printers does not have a case for this showable element

A fallback text representation, if the pattern matching in Printers does not have a case for this showable element

Inherited from:
Showable
final def fields(using Context): Seq[SingleDenotation]
Inherited from:
Type

The final result type of a PolyType, MethodType, or ExprType, after skipping all parameter sections, the type itself for all others.

The final result type of a PolyType, MethodType, or ExprType, after skipping all parameter sections, the type itself for all others.

Inherited from:
Type
final def findDecl(name: Name, excluded: FlagSet)(using Context): Denotation

A denotation containing the declaration(s) in this type with the given name, as seen from prefix type pre. Declarations that have a flag in excluded are omitted.

A denotation containing the declaration(s) in this type with the given name, as seen from prefix type pre. Declarations that have a flag in excluded are omitted.

Inherited from:
Type

Determine the expected function type from the prototype. If no function type is found, NoType is returned. If multiple function types are found in an intersection, their intersection is returned. This works since & invokes TypeComparer.distributeAnd, which ensures that (A1 => B1) & (A2 => B2) simplifies to (A1 | A2) => (B1 & B2), so the result is again a function type. An analogous distribution mechanism does not exist for |. Therefore, a union of function types also yields NoType, since we cannot determine a single expected function type.

Determine the expected function type from the prototype. If no function type is found, NoType is returned. If multiple function types are found in an intersection, their intersection is returned. This works since & invokes TypeComparer.distributeAnd, which ensures that (A1 => B1) & (A2 => B2) simplifies to (A1 | A2) => (B1 & B2), so the result is again a function type. An analogous distribution mechanism does not exist for |. Therefore, a union of function types also yields NoType, since we cannot determine a single expected function type.

Inherited from:
Type
final def findMember(name: Name, pre: Type, required: FlagSet, excluded: FlagSet)(using Context): Denotation

Find member of this type with given name, all required flags and no excluded flag and produce a denotation that contains the type of the member as seen from given prefix pre.

Find member of this type with given name, all required flags and no excluded flag and produce a denotation that contains the type of the member as seen from given prefix pre.

Inherited from:
Type

The parameter names in the first parameter section of a generic type or MethodType, Empty list for others

The parameter names in the first parameter section of a generic type or MethodType, Empty list for others

Inherited from:
Type
final def firstParamTypes(using Context): List[Type]

The parameter types in the first parameter section of a generic type or MethodType, Empty list for others

The parameter types in the first parameter section of a generic type or MethodType, Empty list for others

Inherited from:
Type

The first parent of this type, AnyRef if list of parents is empty

The first parent of this type, AnyRef if list of parents is empty

Inherited from:
Type
final def forallParts(p: Type => Boolean)(using Context): Boolean

Returns true if all parts of this type satisfy predicate p.

Returns true if all parts of this type satisfy predicate p.

Inherited from:
Type
final def foreachPart(p: Type => Unit, stopAt: StopAt)(using Context): Unit

Performs operation on all parts of this type

Performs operation on all parts of this type

Inherited from:
Type
final def frozen_<:<(that: Type)(using Context): Boolean

Is this type a subtype of that type?

Is this type a subtype of that type?

Inherited from:
Type
final def frozen_=:=(that: Type)(using Context): Boolean
Inherited from:
Type
final def hasAnnotation(cls: ClassSymbol)(using Context): Boolean

Does the type carry an annotation that is an instance of cls?

Does the type carry an annotation that is an instance of cls?

Inherited from:
Type

Is this type of kind AnyKind?

Is this type of kind AnyKind?

Inherited from:
Type
final def hasClassSymbol(cls: Symbol)(using Context): Boolean

Same as this.classSymbols.contains(cls) but more efficient

Same as this.classSymbols.contains(cls) but more efficient

Inherited from:
Type
final def hash: Int

customized hash code of this type. NotCached for uncached types. Cached types compute hash and use it as the type's hashCode.

customized hash code of this type. NotCached for uncached types. Cached types compute hash and use it as the type's hashCode.

Inherited from:
UncachedGroundType

Is the hash of this type the same for all possible sequences of enclosing binders?

Is the hash of this type the same for all possible sequences of enclosing binders?

Inherited from:
Type

The upper bound of a TypeBounds type, the type itself otherwise

The upper bound of a TypeBounds type, the type itself otherwise

Inherited from:
Type
Inherited from:
Hashable
final def implicitMembers(using Context): List[TermRef]

The set of implicit term members of this type

The set of implicit term members of this type

Inherited from:
Type
def isAny(using Context): Boolean
Inherited from:
Type
Inherited from:
Type
Inherited from:
Type

True iff symd is a denotation of a class type parameter and the reference `

True iff symd is a denotation of a class type parameter and the reference `

 . ` is an actual argument reference, i.e. `pre` is not the
ThisType of `symd`'s owner, or a reference to `symd`'s owner.'
Inherited from:
Type
Inherited from:
Type
Inherited from:
Type

Is this a Method or PolyType which has contextual parameters as first value parameter list?

Is this a Method or PolyType which has contextual parameters as first value parameter list?

Inherited from:
Type

Is this a higher-kinded type lambda with given parameter variances?

Is this a higher-kinded type lambda with given parameter variances?

Inherited from:
Type
def isDirectRef(sym: Symbol)(using Context): Boolean

Is this type a (neither aliased nor applied nor annotated) reference to class sym?

Is this type a (neither aliased nor applied nor annotated) reference to class sym?

Inherited from:
Type

Is this a MethodType for which the parameters will not be used?

Is this a MethodType for which the parameters will not be used?

Inherited from:
Type

Is some part of the widened version of this type produced as a repair for an error?

Is some part of the widened version of this type produced as a repair for an error?

Inherited from:
Type
final def isError(using Context): Boolean

Is this type produced as a repair for an error?

Is this type produced as a repair for an error?

Inherited from:
Type

Is this type exactly Any (no vars, aliases, refinements etc allowed)?

Is this type exactly Any (no vars, aliases, refinements etc allowed)?

Inherited from:
Type

Is this type exactly Nothing (no vars, aliases, refinements etc allowed)?

Is this type exactly Nothing (no vars, aliases, refinements etc allowed)?

Inherited from:
Type

Is this type exactly Null (no vars, aliases, refinements etc allowed)?

Is this type exactly Null (no vars, aliases, refinements etc allowed)?

Inherited from:
Type
Inherited from:
Type
final def isGround(using Context): Boolean

Does this type not refer to TypeParamRefs or uninstantiated TypeVars?

Does this type not refer to TypeParamRefs or uninstantiated TypeVars?

Inherited from:
Type

Is this a Method or PolyType which has implicit or contextual parameters?

Is this a Method or PolyType which has implicit or contextual parameters?

Inherited from:
Type
def isMatch(using Context): Boolean

Is this a match type or a higher-kinded abstraction of one?

Is this a match type or a higher-kinded abstraction of one?

Inherited from:
Type

Same as hasClassSmbol(MatchableClass), except that we also follow the constraint bounds of type variables in the constraint.

Same as hasClassSmbol(MatchableClass), except that we also follow the constraint bounds of type variables in the constraint.

Inherited from:
Type
final def isNotNull(using Context): Boolean

Is this type guaranteed not to have null as a value?

Is this type guaranteed not to have null as a value?

Inherited from:
Type
final def isNothingType(using Context): Boolean

Is this (an alias of) the scala.Nothing type?

Is this (an alias of) the scala.Nothing type?

Inherited from:
Type
final def isNullType(using Context): Boolean

Is this (an alias of) the scala.Null type?

Is this (an alias of) the scala.Null type?

Inherited from:
Type

Is this the type of a method with a leading empty parameter list?

Is this the type of a method with a leading empty parameter list?

Inherited from:
Type
final def isParameterless(using Context): Boolean

Is this either not a method at all, or a parameterless method?

Is this either not a method at all, or a parameterless method?

Inherited from:
Type

Is this type still provisional? This is the case if the type contains, or depends on, uninstantiated type variables or type symbols that have the Provisional flag set. This is an antimonotonic property - once a type is not provisional, it stays so forever.

Is this type still provisional? This is the case if the type contains, or depends on, uninstantiated type variables or type symbols that have the Provisional flag set. This is an antimonotonic property - once a type is not provisional, it stays so forever.

Inherited from:
Type
def isRef(sym: Symbol, skipRefined: Boolean)(using Context): Boolean

Is this type a (possibly refined or applied or aliased) type reference to the given type symbol?

Is this type a (possibly refined or applied or aliased) type reference to the given type symbol?

Inherited from:
Type

Is this a type of a repeated parameter?

Is this a type of a repeated parameter?

Inherited from:
Type

Is this type a (possibly aliased) singleton type?

Is this type a (possibly aliased) singleton type?

Inherited from:
Type
final def isStable(using Context): Boolean

Does this type denote a stable reference (i.e. singleton type)?

Does this type denote a stable reference (i.e. singleton type)?

Like in isStableMember, "stability" means idempotence. Rationale: If an expression has a stable type, the expression must be idempotent, so stable types must be singleton types of stable expressions.

Inherited from:
Type
Inherited from:
Type
final def isTypeAlias: Boolean

Is this an alias TypeBounds?

Is this an alias TypeBounds?

Inherited from:
Type
def isValueSubType(that: Type)(using Context): Boolean

Is this type a primitive value type which can be widened to the primitive value type that?

Is this type a primitive value type which can be widened to the primitive value type that?

Inherited from:
Type
final def isValueType: Boolean

Is this type a value type?

Is this type a value type?

Inherited from:
Type

Is this a value type or a type lambda?

Is this a value type or a type lambda?

Inherited from:
Type

Is this a value type or a wildcard?

Is this a value type or a wildcard?

Inherited from:
Type

Is this the type of a method that has a repeated parameter type as last parameter type?

Is this the type of a method that has a repeated parameter type as last parameter type?

Inherited from:
Type
protected def iso(that: Any, bs: BinderPairs): Boolean

Is this isomorphic to that, assuming pairs of matching binders bs? It is assumed that this.ne(that).

Is this isomorphic to that, assuming pairs of matching binders bs? It is assumed that this.ne(that).

Inherited from:
Type

The lower bound of a TypeBounds type, the type itself otherwise

The lower bound of a TypeBounds type, the type itself otherwise

Inherited from:
Type
def lookupRefined(name: Name)(using Context): Type

If this normalizes* to a refinement type that has a refinement for name (which might be followed by other refinements), and the refined info is a type alias, return the alias, otherwise return NoType. Used to reduce types of the form

If this normalizes* to a refinement type that has a refinement for name (which might be followed by other refinements), and the refined info is a type alias, return the alias, otherwise return NoType. Used to reduce types of the form

P { ... type T = / += / -= U ... } # T

to just U. Does not perform the reduction if the resulting type would contain a reference to the "this" of the current refined type, except in the following situation

(1) The "this" reference can be avoided by following an alias. Example:

P { type T = String, type R = P{...}.T } # R  -->  String

(*) normalizes means: follow instantiated typevars and aliases.

Inherited from:
Type
def mapReduceAnd[T](f: Type => T)(g: (T, T) => T)(using Context): T

Map function f over elements of an AndType, rebuilding with function g

Map function f over elements of an AndType, rebuilding with function g

Inherited from:
Type
final def mapReduceOr[T](f: Type => T)(g: (T, T) => T)(using Context): T

Map function f over elements of an OrType, rebuilding with function g

Map function f over elements of an OrType, rebuilding with function g

Inherited from:
Type
def matches(that: Type)(using Context): Boolean

Is this type close enough to that type so that members with the two types would override each other? This means:

Is this type close enough to that type so that members with the two types would override each other? This means:

  • Either both types are polytypes with the same number of type parameters and their result types match after renaming corresponding type parameters
  • Or both types are method types with =:=-equivalent(*) parameter types and matching result types after renaming corresponding parameter types if the method types are dependent.
  • Or both types are =:=-equivalent
  • Or phase.erasedTypes is false, and neither type takes term or type parameters.

(*) when matching with a Java method, we also regard Any and Object as equivalent parameter types.

Under explicit nulls, this function will always use unsafe-nulls semamtics to check the types. This is because we are using a relaxed rule (ignoring Null types) to check overriding Java methods.

Inherited from:
Type
def matchesLoosely(that: Type)(using Context): Boolean

This is the same as matches except that it also matches => T with T and vice versa.

This is the same as matches except that it also matches => T with T and vice versa.

Inherited from:
Type
final def member(name: Name)(using Context): Denotation

The member of this type with the given name

The member of this type with the given name

Inherited from:
Type
final def memberBasedOnFlags(name: Name, required: FlagSet, excluded: FlagSet)(using Context): Denotation

The member with given name and required and/or excluded flags

The member with given name and required and/or excluded flags

Inherited from:
Type

The set of member classes of this type

The set of member classes of this type

Inherited from:
Type
Inherited from:
Type
final def memberInfo(sym: Symbol)(using Context): Type

The info of sym, seen as a member of this type.

The info of sym, seen as a member of this type.

Inherited from:
Type
final def memberNames(keepOnly: NameFilter, pre: Type)(using Context): Set[Name]

The set of names of members of this type that pass the given name filter when seen as members of pre. More precisely, these are all of members name such that keepOnly(pre, name) is true.

The set of names of members of this type that pass the given name filter when seen as members of pre. More precisely, these are all of members name such that keepOnly(pre, name) is true.

Inherited from:
Type
final def membersBasedOnFlags(required: FlagSet, excluded: FlagSet)(using Context): Seq[SingleDenotation]

The set of members of this type that have all of required flags but none of excluded flags set.

The set of members of this type that have all of required flags but none of excluded flags set.

Inherited from:
Type
Inherited from:
LazyType

The parts of this type which are type or term refs and which satisfy predicate p.

The parts of this type which are type or term refs and which satisfy predicate p.

Value parameters:
p

The predicate to satisfy

Inherited from:
Type
def narrow(using Context): TermRef

A prefix-less refined this or a termRef to a new skolem symbol that has the given type as info.

A prefix-less refined this or a termRef to a new skolem symbol that has the given type as info.

Inherited from:
Type

A hook that is called before trying to complete a symbol with its associated cycle detection via the Touched flag. This is overridden for Type definitions in Namer, where we make sure that owners are completed before nested types.

A hook that is called before trying to complete a symbol with its associated cycle detection via the Touched flag. This is overridden for Type definitions in Namer, where we make sure that owners are completed before nested types.

Inherited from:
LazyType

The set of abstract type members of this type.

The set of abstract type members of this type.

Inherited from:
Type
final def nonPrivateDecl(name: Name)(using Context): Denotation

A denotation containing the non-private declaration(s) in this type with the given name

A denotation containing the non-private declaration(s) in this type with the given name

Inherited from:
Type
final def nonPrivateMember(name: Name)(using Context): Denotation

The non-private member of this type with the given name.

The non-private member of this type with the given name.

Inherited from:
Type
final def normalized(using Context): Type

The result of normalization using tryNormalize, or the type itself if tryNormlize yields NoType

The result of normalization using tryNormalize, or the type itself if tryNormlize yields NoType

Inherited from:
Type
final def normalizedPrefix(using Context): Type

The normalized prefix of this type is: For an alias type, the normalized prefix of its alias For all other named type and class infos: the prefix. Inherited by all other type proxies. NoType for all other types.

The normalized prefix of this type is: For an alias type, the normalized prefix of its alias For all other named type and class infos: the prefix. Inherited by all other type proxies. NoType for all other types.

Inherited from:
Type
def occursIn(that: Type)(using Context): Boolean

Does this type occur as a part of type that?

Does this type occur as a part of type that?

Inherited from:
Type
inline def orElse(inline that: Type): Type

This type, if it exists, otherwise that type

This type, if it exists, otherwise that type

Inherited from:
Type

If this is a OrType, the number of factors if that match soft, 1 for all other types.

If this is a OrType, the number of factors if that match soft, 1 for all other types.

Inherited from:
Type
final def overrides(that: Type, relaxedCheck: Boolean, matchLoosely: => Boolean, checkClassInfo: Boolean)(using Context): Boolean

Is this type a legal type for member sym1 that overrides another member sym2 of type that? This is the same as <:<, except that

Is this type a legal type for member sym1 that overrides another member sym2 of type that? This is the same as <:<, except that

Value parameters:
checkClassInfo

if true we check that ClassInfos are within bounds of abstract types

matchLoosely

if true the types => T and ()T are seen as overriding each other.

relaxedCheck

if true type Null becomes a subtype of non-primitive value types in TypeComparer.

Inherited from:
Type
final def paramInfoss(using Context): List[List[Type]]

The parameter types of a PolyType or MethodType, Empty list for others

The parameter types of a PolyType or MethodType, Empty list for others

Inherited from:
Type
final def paramNamess(using Context): List[List[TermName]]

The parameter names of a PolyType or MethodType, Empty list for others

The parameter names of a PolyType or MethodType, Empty list for others

Inherited from:
Type
final def parentSymbols(include: Symbol => Boolean)(using Context): List[Symbol]

The least (wrt <:<) set of symbols satisfying the include predicate of which this type is a subtype

The least (wrt <:<) set of symbols satisfying the include predicate of which this type is a subtype

Inherited from:
Type
def parents(using Context): List[Type]

The full parent types, including all type arguments

The full parent types, including all type arguments

Inherited from:
Type

Returns the set of methods that are abstract and do not overlap with any of java.lang.Object methods.

Returns the set of methods that are abstract and do not overlap with any of java.lang.Object methods.

Conceptually, a SAM (functional interface) has exactly one abstract method. If an interface declares an abstract method overriding one of the public methods of java.lang.Object, that also does not count toward the interface's abstract method count.

Returns:

the set of methods that are abstract and do not match any of java.lang.Object

See also:
Inherited from:
Type
def recoverable_&(that: Type)(using Context): Type

this & that, but handle CyclicReferences by falling back to safe_&.

this & that, but handle CyclicReferences by falling back to safe_&.

Inherited from:
Type
def relaxed_<:<(that: Type)(using Context): Boolean
Inherited from:
Type

If this is a repeated type, its element type, otherwise the type itself

If this is a repeated type, its element type, otherwise the type itself

Inherited from:
Type
def resultType(using Context): Type

The resultType of a LambdaType, or ExprType, the type itself for others

The resultType of a LambdaType, or ExprType, the type itself for others

Inherited from:
Type

If this is an ignored proto type, its underlying type, otherwise the type itself

If this is an ignored proto type, its underlying type, otherwise the type itself

Inherited from:
Type
def rewrapAnnots(tp: Type)(using Context): Type
Inherited from:
Type
def safe_&(that: Type)(using Context): Type

Safer version of &.

Safer version of &.

This version does not simplify the bounds of the intersection of two TypeBounds. The simplification done by & requires subtyping checks which may end up calling & again, in most cases this should be safe but because of F-bounded types, this can result in an infinite loop (which will be masked unless -Yno-deep-subtypes is enabled). pos/i536 demonstrates that the infinite loop can also involve lower bounds.

Inherited from:
Type
def select(name: TermName, sig: Signature, target: Name)(using Context): TermRef
Inherited from:
Type
def select(name: TermName)(using Context): TermRef
Inherited from:
Type
def select(sym: Symbol)(using Context): Type

The type <this . sym>, reduced if possible

The type <this . sym>, reduced if possible

Inherited from:
Type
def select(name: Name, denot: Denotation)(using Context): Type

The type <this . name> with given denotation, reduced if possible.

The type <this . name> with given denotation, reduced if possible.

Inherited from:
Type
def select(name: Name)(using Context): Type

The type <this . name> , reduced if possible

The type <this . name> , reduced if possible

Inherited from:
Type
def show(using Context): String

The string representation of this showable element.

The string representation of this showable element.

Inherited from:
Showable
def showIndented(margin: Int)(using Context): String

The string representation with each line after the first one indented by the given given margin (in spaces).

The string representation with each line after the first one indented by the given given margin (in spaces).

Inherited from:
Showable
def showSummary(depth: Int)(using Context): String

The summarized string representation of this showable element. Recursion depth is limited to some smallish value. Default is Config.summarizeDepth.

The summarized string representation of this showable element. Recursion depth is limited to some smallish value. Default is Config.summarizeDepth.

Inherited from:
Showable

Utility method to show the underlying type of a TypeProxy chain together with the proxy type itself.

Utility method to show the underlying type of a TypeProxy chain together with the proxy type itself.

Inherited from:
Type

The signature of this type. This is by default NotAMethod, but is overridden for PolyTypes, MethodTypes, and TermRef types. (the reason why we deviate from the "final-method-with-pattern-match-in-base-class" pattern is that method signatures use caching, so encapsulation is improved using an OO scheme).

The signature of this type. This is by default NotAMethod, but is overridden for PolyTypes, MethodTypes, and TermRef types. (the reason why we deviate from the "final-method-with-pattern-match-in-base-class" pattern is that method signatures use caching, so encapsulation is improved using an OO scheme).

Inherited from:
Type
def simplified(using Context): Type

A simplified version of this type which is equivalent wrt =:= to this type. This applies a typemap to the type which (as all typemaps) follows type variable instances and reduces typerefs over refined types. It also

A simplified version of this type which is equivalent wrt =:= to this type. This applies a typemap to the type which (as all typemaps) follows type variable instances and reduces typerefs over refined types. It also

  • re-evaluates all occurrences of And/OrType with &/| because what was a union or intersection of type variables might be a simpler type after the type variables are instantiated.
  • maps poly params in the current constraint set back to their type vars.
  • forces match types to be fully defined and tries to normalize them.

NOTE: Simplifying an intersection type might change its erasure (for example, the Java erasure of Object & Serializable is Object, but its simplification is Serializable). This means that simplification should never be used in a MethodicType, because that could lead to a different signature. Since this isn't very useful anyway, this method handles this by never simplifying inside a MethodicType, except for replacing type parameters with associated type variables.

Inherited from:
Type
Inherited from:
LazyType

Remove all AnnotatedTypes wrapping this type.

Remove all AnnotatedTypes wrapping this type.

Inherited from:
Type

Strip LazyRef wrappers

Strip LazyRef wrappers

Inherited from:
Type
def stripPoly(using Context): Type

Strip PolyType prefixes

Strip PolyType prefixes

Inherited from:
Type

Map a TypeVar to either its instance if it is instantiated, or its origin, if not, until the result is no longer a TypeVar. Identity on all other types.

Map a TypeVar to either its instance if it is instantiated, or its origin, if not, until the result is no longer a TypeVar. Identity on all other types.

Inherited from:
Type
def stripped(using Context): Type

Strip TypeVars and Annotation wrappers

Strip TypeVars and Annotation wrappers

Inherited from:
Type
final def subst(from: BindingType, to: BindingType)(using Context): Type

Substitute all types of the form TypeParamRef(from, N) by TypeParamRef(to, N).

Substitute all types of the form TypeParamRef(from, N) by TypeParamRef(to, N).

Inherited from:
Type
final def subst(from: List[Symbol], to: List[Type])(using Context): Type

Substitute all types that refer in their symbol attribute to one of the symbols in from by the corresponding types in to.

Substitute all types that refer in their symbol attribute to one of the symbols in from by the corresponding types in to.

Inherited from:
Type
final def substApprox(from: List[Symbol], to: List[Type])(using Context): Type

Substitute all occurrences of symbols in from by corresponding types in to. Unlike for subst, the to types can be type bounds. A TypeBounds target will be replaced by range that gets absorbed in an approximating type map.

Substitute all occurrences of symbols in from by corresponding types in to. Unlike for subst, the to types can be type bounds. A TypeBounds target will be replaced by range that gets absorbed in an approximating type map.

Inherited from:
Type
final def substParam(from: ParamRef, to: Type)(using Context): Type

Substitute a bound type by some other type

Substitute a bound type by some other type

Inherited from:
Type
final def substParams(from: BindingType, to: List[Type])(using Context): Type

Substitute bound types by some other types

Substitute bound types by some other types

Inherited from:
Type
final def substRecThis(binder: RecType, tp: Type)(using Context): Type

Substitute all occurrences of RecThis(binder) by tp

Substitute all occurrences of RecThis(binder) by tp

Inherited from:
Type
final def substSym(from: List[Symbol], to: List[Symbol])(using Context): Type

Substitute all occurrences of symbols in from by references to corresponding symbols in to

Substitute all occurrences of symbols in from by references to corresponding symbols in to

Inherited from:
Type
final def substThis(cls: ClassSymbol, tp: Type)(using Context): Type

Substitute all occurrences of This(cls) by tp

Substitute all occurrences of This(cls) by tp

Inherited from:
Type
final def substThisUnlessStatic(cls: ClassSymbol, tp: Type)(using Context): Type

As substThis, but only is class is a static owner (i.e. a globally accessible object)

As substThis, but only is class is a static owner (i.e. a globally accessible object)

Inherited from:
Type
final def termSymbol(using Context): Symbol

The term symbol associated with the type

The term symbol associated with the type

Inherited from:
Type
def toFunctionType(isJava: Boolean, dropLast: Int)(using Context): Type

Turn type into a function type.

Turn type into a function type.

Value parameters:
dropLast

The number of trailing parameters that should be dropped when forming the function type.

Inherited from:
Type
override def toString: String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Returns:

a string representation of the object.

Definition Classes
Inherited from:
LazyType
def toText(printer: Printer): Text

Convert to text

Convert to text

Inherited from:
Type

If this type can be normalized at the top-level by rewriting match types of S[n] types, the result after applying all toplevel normalizations, otherwise NoType

If this type can be normalized at the top-level by rewriting match types of S[n] types, the result after applying all toplevel normalizations, otherwise NoType

Inherited from:
Type
def tupled: ((T1, T2)) => R
Inherited from:
Function2

The set of type alias members of this type

The set of type alias members of this type

Inherited from:
Type
final def typeConstructor(using Context): Type

The type constructor of an applied type, otherwise the type itself

The type constructor of an applied type, otherwise the type itself

Inherited from:
Type
final def typeHash(bs: Binders, tp: Type): Int
Inherited from:
Hashable

The set of type members of this type

The set of type members of this type

Inherited from:
Type

The type parameter with given name. This tries first decls in order not to provoke a cycle by forcing the info. If that yields no symbol it tries member as an alternative.

The type parameter with given name. This tries first decls in order not to provoke a cycle by forcing the info. If that yields no symbol it tries member as an alternative.

Inherited from:
Type
def typeSize(using Context): Int

The number of applications and refinements in this type, after all aliases are expanded

The number of applications and refinements in this type, after all aliases are expanded

Inherited from:
Type
final def typeSymbol(using Context): Symbol

The type symbol associated with the type

The type symbol associated with the type

Inherited from:
Type
def underlyingClassRef(refinementOK: Boolean)(using Context): Type

If this is a (possibly aliased, annotated, and/or parameterized) reference to a class, the class type ref, otherwise NoType.

If this is a (possibly aliased, annotated, and/or parameterized) reference to a class, the class type ref, otherwise NoType.

Value parameters:
refinementOK

If true we also skip refinements.

Inherited from:
Type

Useful for diagnostics: The underlying type if this type is a type proxy, otherwise NoType

Useful for diagnostics: The underlying type if this type is a type proxy, otherwise NoType

Inherited from:
Type

The iterator of underlying types as long as type is a TypeProxy. Useful for diagnostics

The iterator of underlying types as long as type is a TypeProxy. Useful for diagnostics

Inherited from:
Type

Is this type unusable for implicit search or overloading resolution since it has embedded errors that can match anything? This is weaker and more ad-hoc than isErroneous. The main differences are that we always consider aliases (since these are relevant for inference or resolution) but never consider prefixes (since these often do not constrain the search space anyway).

Is this type unusable for implicit search or overloading resolution since it has embedded errors that can match anything? This is weaker and more ad-hoc than isErroneous. The main differences are that we always consider aliases (since these are relevant for inference or resolution) but never consider prefixes (since these often do not constrain the search space anyway).

Inherited from:
Type
final def widen(using Context): Type

Widen from singleton type to its underlying non-singleton base type by applying one or more underlying dereferences, Also go from => T to T. Identity for all other types. Example:

Widen from singleton type to its underlying non-singleton base type by applying one or more underlying dereferences, Also go from => T to T. Identity for all other types. Example:

class Outer { class C ; val x: C } def o: Outer <o.x.type>.widen = o.C

Inherited from:
Type
final def widenDealias(using Context): Type

Perform successive widenings and dealiasings until none can be applied anymore

Perform successive widenings and dealiasings until none can be applied anymore

Inherited from:
Type

Perform successive widenings and dealiasings while rewrapping annotations, until none can be applied anymore

Perform successive widenings and dealiasings while rewrapping annotations, until none can be applied anymore

Inherited from:
Type

Perform successive widenings and dealiasings while rewrapping refining annotations, until none can be applied anymore

Perform successive widenings and dealiasings while rewrapping refining annotations, until none can be applied anymore

Inherited from:
Type
final def widenExpr: Type

Widen from ExprType type to its result type. (Note: no stripTypeVar needed because TypeVar's can't refer to ExprTypes.)

Widen from ExprType type to its result type. (Note: no stripTypeVar needed because TypeVar's can't refer to ExprTypes.)

Inherited from:
Type
final def widenIfUnstable(using Context): Type

Widen type if it is unstable (i.e. an ExprType, or TermRef to unstable symbol

Widen type if it is unstable (i.e. an ExprType, or TermRef to unstable symbol

Inherited from:
Type

If this is a nullary method type, its result type

If this is a nullary method type, its result type

Inherited from:
Type
final def widenSingleton(using Context): Type

Widen from singleton type to its underlying non-singleton base type by applying one or more underlying dereferences.

Widen from singleton type to its underlying non-singleton base type by applying one or more underlying dereferences.

Inherited from:
Type

Widen all top-level singletons reachable by dealiasing and going to the operands of & and |. Overridden and cached in OrType.

Widen all top-level singletons reachable by dealiasing and going to the operands of & and |. Overridden and cached in OrType.

Inherited from:
Type
final def widenSkolem(using Context): Type

If this is a skolem, its underlying type, otherwise the type itself

If this is a skolem, its underlying type, otherwise the type itself

Inherited from:
Type
final def widenTermRefExpr(using Context): Type

Widen from TermRef to its underlying non-termref base type, while also skipping Expr types.

Widen from TermRef to its underlying non-termref base type, while also skipping Expr types.

Inherited from:
Type
def widenUnion(using Context): Type

Widen this type and if the result contains embedded soft union types, replace them by their joins. "Embedded" means: inside type lambdas, intersections or recursive types, in prefixes of refined types, or in hard union types. If an embedded soft union is found, we first try to simplify or eliminate it by re-lubbing it while allowing type parameters to be constrained further. Any remaining union types are replaced by their joins.

Widen this type and if the result contains embedded soft union types, replace them by their joins. "Embedded" means: inside type lambdas, intersections or recursive types, in prefixes of refined types, or in hard union types. If an embedded soft union is found, we first try to simplify or eliminate it by re-lubbing it while allowing type parameters to be constrained further. Any remaining union types are replaced by their joins.

For instance, if A is an unconstrained type variable, then

  ArrayBuffer[Int] | ArrayBuffer[A]

is approximated by constraining A to be =:= to Int and returning ArrayBuffer[Int] instead of ArrayBuffer[? >: Int | A <: Int & A]

Exception (if -YexplicitNulls is set): if this type is a nullable union (i.e. of the form T | Null), then the top-level union isn't widened. This is needed so that type inference can infer nullable types.

Inherited from:
Type

Overridden in OrType

Overridden in OrType

Inherited from:
Type
def withDecls(decls: Scope): LazyType.this.type
Inherited from:
LazyType
def withModuleClass(moduleClassFn: Context ?=> Symbol): LazyType.this.type
Inherited from:
LazyType
def withSourceModule(sourceModuleFn: Context ?=> Symbol): LazyType.this.type
Inherited from:
LazyType
def |(that: Type)(using Context): Type
Inherited from:
Type