dotty.tools.dotc.core

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Annotations.type

Indicates the singleton types that a type must or may consist of.

Value parameters

hi: The upper bound: all singleton types in the carrier type are guaranteed to be in this set If the underlying type of a singleton type is another singleton type, only the latter type ends up in the sets.
lo: The lower bound: singleton types in this set are guaranteed to be in the carrier type.

Attributes

Supertypes: trait Enum

trait Serializable

trait Product

trait Equals

class Object

trait Matchable

class Any
Show all

Realizability status

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: CheckRealizable.type

Compute realizability status.

A type T is realizable iff it is inhabited by non-null values. This ensures that its type members have good bounds (in the sense from DOT papers). A type projection T#L is legal if T is realizable, and can be understood as Scala 2's v.L forSome { val v: T }.

In general, a realizable type can have multiple inhabitants, hence it need not be stable (in the sense of Type.isStable).

Attributes

Companion: object
Supertypes: class Object

trait Matchable

class Any

Attributes

Supertypes: class SymbolLoader

class LazyType

trait (TermSymbol, ClassSymbol) => LazyType

trait Symbol => LazyType

class UncachedGroundType

class Type

trait Showable

trait Hashable

class Object

trait Matchable

class Any
Show all

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Comments.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Constants.type

Constraint over undetermined type parameters. Constraints are built over values of the following types:

TypeLambda A constraint constrains the type parameters of a set of TypeLambdas
TypeParamRef The parameters of the constrained type lambdas
TypeVar Every constrained parameter might be associated with a TypeVar that has the TypeParamRef as origin.

Attributes

Supertypes: trait Showable

class Object

trait Matchable

class Any
Known subtypes: class OrderingConstraint

Methods for adding constraints and solving them.

What goes into a Constraint as opposed to a ConstrainHandler?

Constraint code is purely functional: Operations get constraints and produce new ones. Constraint code does not have access to a type-comparer. Anything regarding lubs and glbs has to be done elsewhere.

By comparison: Constraint handlers are parts of type comparers and can use their functionality. Constraint handlers update the current constraint as a side effect.

Attributes

Supertypes: class Object

trait Matchable

class Any
Known subtypes: class TypeComparer

class ExplainingTypeComparer

class TrackingTypeComparer

Attributes

Supertypes: class Object

trait Matchable

class Any
Known subtypes: class Run

class TASTYRun
Self type: Run

Extension methods for contexts where we want to keep the ctx. syntax

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: ContextOps.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Contexts.type

This TypeError signals that completing denot encountered a cycle: it asked for denot.info (or similar), so it requires knowing denot already.

Attributes

Companion: object
Supertypes: class TypeError

class Exception

class Throwable

trait Serializable

class Object

trait Matchable

class Any
Show all

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: CyclicReference.type

This object provides useful extension methods for types defined elsewhere

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Decorators.type

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: Definitions.type

A class defining symbols and types of standard definitions

Attributes

Companion: object
Supertypes: class Object

trait Matchable

class Any

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: DenotTransformers.type

Denotations represent the meaning of symbols and named types. The following diagram shows how the principal types of denotations and their denoting entities relate to each other. Lines ending in a down-arrow v are member methods. The two methods shown in the diagram are "symbol" and "deref". Both methods are parameterized by the current context, and are effectively indexed by current period.

Lines ending in a horizontal line mean subtyping (right is a subtype of left).

Here's a short summary of the classes in this diagram.

NamedType A type consisting of a prefix type and a name, with fields prefix: Type name: Name It has two subtypes: TermRef and TypeRef Symbol A label for a definition or declaration in one compiler run ClassSymbol A symbol representing a class Denotation The meaning of a named type or symbol during a period MultiDenotation A denotation representing several overloaded members SingleDenotation A denotation representing a non-overloaded member or definition, with main fields symbol: Symbol info: Type UniqueRefDenotation A denotation referring to a single definition with some member type JointRefDenotation A denotation referring to a member that could resolve to several definitions SymDenotation A denotation representing a single definition with its original type, with main fields name: Name owner: Symbol flags: Flags privateWithin: Symbol annotations: List[Annotation] ClassDenotation A denotation representing a single class definition.

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Denotations.type

A type comparer that can record traces of subtype operations

Attributes

Supertypes: class TypeComparer

trait PatternTypeConstrainer

trait ConstraintHandling

class Object

trait Matchable

class Any
Show all

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Flags.type

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: GadtConstraint.type

Represents GADT constraints currently in scope

Attributes

Companion: object
Supertypes: trait Showable

class Object

trait Matchable

class Any

Attributes

Companion: trait
Supertypes: class Object

trait Matchable

class Any
Self type: GadtState.type

Attributes

Companion: object
Supertypes: class Object

trait Matchable

class Any
Self type: ConstraintHandling

Attributes

Companion: trait
Supertypes: class Object

trait Matchable

class Any
Self type: Hashable.type

Attributes

Companion: object
Supertypes: class Object

trait Matchable

class Any
Known subtypes: class Type

trait BindingType

trait LambdaType

class HKLambda

class HKTypeLambda

class MethodOrPoly

class MethodType

class CachedMethodType

class PolyType

trait TermLambda

trait TypeLambda

class RecType

class CachedGroundType

class ErasedValueType

class CachedErasedValueType

class AndOrType

class AndType

class CachedAndType

class OrType

class CachedOrType

class ClassInfo

class CachedClassInfo

class TempClassInfo

class JavaArrayType

class CachedJavaArrayType

object NoPrefix.type

object NoType.type

class WildcardType

class CachedWildcardType

object WildcardType.type

class IgnoredProto

class CachedIgnoredProto

class ViewProto

class CachedViewProto

trait CachedType

class CachedProxyType

class AnnotatedType

class CachedAnnotatedType

class AppliedType

class CachedAppliedType

class BoundType

class ParamRef

class TermParamRef

class TypeParamRef

class RecThis

class ConstantType

class CachedConstantType

class ExprType

class CachedExprType

class MatchType

class CachedMatchType

class NamedType

class TermRef

class CachedTermRef

class TypeRef

class CachedTypeRef

class RefinedOrRecType

class RefinedType

class CachedRefinedType

class SkolemType

class QualSkolemType

class SuperType

class CachedSuperType

class ThisType

class CachedThisType

class TypeBounds

class AliasingBounds

class MatchAlias

class TypeAlias

class RealTypeBounds

class TypeVar

class SelectionProto

object AnySelectionProto.type

class CachedSelectionProto

object SingletonTypeProto.type

class UnapplySelectionProto

trait NarrowCached

trait ProtoType

trait ApplyingProto

class FunProto

class FunProtoTyped

trait FunOrPolyProto

class PolyProto

trait MatchAlways

object AnyFunctionProto.type

object AnyTypeConstructorProto.type

object AssignProto.type

trait TermType

trait MethodicType

trait ValueTypeOrProto

trait ValueType

class FlexType

class ErrorType

class PreviousErrorType

object UnspecifiedErrorType.type

class SearchFailureType

class AmbiguousImplicits

class DivergingImplicit

class FailedExtension

class MacroErrorsFailure

class MismatchedImplicit

class NestedFailure

class NoMatchingImplicits

object ImplicitSearchTooLarge.type

object NoMatchingImplicits.type

class TooUnspecific

class SynthesisFailure

object TryDynamicCallType.type

class LazyRef

trait SingletonType

trait CaptureRef

class TypeProxy

class UncachedProxyType

trait TypeType

class UncachedGroundType

class TempClassInfoType

class TempPolyType

class LazyType

class AnnotConstructorCompleter

class MemberCompleter

class Completer

class LocalUnpickler

class ClassUnpickler

object localMemberUnpickler.type

class ApplyProxyCompleter

class ModuleCompleter

trait NoCompleter

class NoLoader

object NoCompleter.type

class StubInfo

trait TypeParamsCompleter

class TypeDefCompleter

class SymbolLoader

class ClassfileLoader

class SourcefileLoader

class PackageLoader

class Completer

class ClassCompleter

class SuspendCompleter

class ImportType

class Range

class AppliedUniques

class NamedTypeUniques
Show all

This module defines methods to interpret types of Java symbols, which are implicitly nullable in Java, as Scala types, which are explicitly nullable.

The transformation is (conceptually) a function n that adheres to the following rules: (1) n(T) = T | Null if T is a reference type (2) n(T) = T if T is a value type (3) n(C[T]) = C[T] | Null if C is Java-defined (4) n(C[T]) = C[n(T)] | Null if C is Scala-defined (5) n(A|B) = n(A) | n(B) | Null (6) n(A&B) = n(A) & n(B) (7) n((A1, ..., Am)R) = (n(A1), ..., n(Am))n(R) for a method with arguments (A1, ..., Am) and return type R (8) n(T) = T otherwise

Treatment of generics (rules 3 and 4):

if C is Java-defined, then n(C[T]) = C[T] | Null. That is, we don't recurse on the type argument, and only add Null on the outside. This is because C itself will be nullified, and in particular so will be usages of C's type argument within C's body. e.g. calling get on a java.util.List[String] already returns String|Null and not String, so we don't need to write java.util.List[String | Null].
if C is Scala-defined, however, then we want n(C[T]) = C[n(T)] | Null. This is because C won't be nullified, so we need to indicate that its type argument is nullable.

Notice that since the transformation is only applied to types attached to Java symbols, it doesn't need to handle the full spectrum of Scala types. Additionally, some kinds of symbols like constructors and enum instances get special treatment.

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: JavaNullInterop.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: MacroClassLoader.type

Attributes

Supertypes: class TypeError

class Exception

class Throwable

trait Serializable

class Object

trait Matchable

class Any
Show all

A utility module to produce match type reduction traces in error messages.

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: MatchTypeTrace.type

Attributes

Supertypes: class TypeError

class Exception

class Throwable

trait Serializable

class Object

trait Matchable

class Any
Show all

A collection of mode bits that are part of a context

Attributes

Companion: object
Supertypes: trait Serializable

trait Product

trait Equals

class AnyVal

trait Matchable

class Any
Show all

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: Mode.type

Defines possible kinds of NameInfo of a derived name

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: NameKinds.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: NameOps.type

The possible tags of a NameKind

Attributes

Supertypes: class NameTags

class Object

trait Matchable

class Any
Self type: NameTags.type

Operations that are shared between Namer and TreeUnpickler

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: NamerOps.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Names.type

A NoCompleter which is also a SymbolLoader.

Attributes

Supertypes: trait NoCompleter

class SymbolLoader

class LazyType

trait (TermSymbol, ClassSymbol) => LazyType

trait Symbol => LazyType

class UncachedGroundType

class Type

trait Showable

trait Hashable

class Object

trait Matchable

class Any
Show all

Defines operations on nullable types and tree.

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: NullOpsDecorator.type

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: OrderingConstraint.type

Constraint over undetermined type parameters that keeps separate maps to reflect parameter orderings.

Value parameters

boundsMap: a map from TypeLambda to arrays. Each array contains twice the number of entries as there a type parameters in the TypeLambda. The first half of the array contains the type bounds that constrain the lambda's type parameters. The second half might contain type variables that track the corresponding parameters, or is left empty (filled with nulls). An instantiated type parameter is represented by having its instance type in the corresponding array entry. The dual use of arrays for poly params and typevars is to save space and hopefully gain some speed.
hardVars: a set of type variables that are marked as hard and therefore will not undergo a widenUnion when instantiated to their lower bound.
lowerMap: a map from TypeLambdas to arrays. Each array entry corresponds to a parameter P of the type lambda; it contains all constrained parameters Q that are known to be smaller than P, i.e. Q <: P.
upperMap: a map from TypeLambdas to arrays. Each array entry corresponds to a parameter P of the type lambda; it contains all constrained parameters Q that are known to be greater than P, i.e. P <: Q.

Attributes

Companion: object
Supertypes: class Constraint

trait Showable

class Object

trait Matchable

class Any
Self type: OrderingConstraint

A common super trait of Symbol and LambdaParam. Used to capture the attributes of type parameters which can be implemented as either.

Attributes

Companion: object
Supertypes: class Object

trait Matchable

class Any
Known subtypes: class Symbol

class ClassSymbol

object NoSymbol.type

class LambdaParam

Attributes

Companion: trait
Supertypes: class Object

trait Matchable

class Any
Self type: ParamInfo.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Known subtypes: class TypeComparer

class ExplainingTypeComparer

class TrackingTypeComparer
Self type: TypeComparer

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Periods.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Phases.type

Attributes

Supertypes: class TypeError

class Exception

class Throwable

trait Serializable

class Object

trait Matchable

class Any
Show all

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Scopes.type

The signature of a denotation.

Same-named denotations with different signatures are considered to be overloads, see SingleDenotation#matches for more details.

A method signature (a value of type Signature, excluding NotAMethod and OverloadedSignature) is composed of a list of parameter signatures, plus a type signature for the final result type.

A parameter signature (a value of type ParamSig) is either an integer, representing the number of type parameters in a type parameter section, or the type signature of a term parameter.

A type signature is the fully qualified name of the type symbol of the type's erasure.

For instance a definition

def f[T, S](x: Int)(y: List[T]): S

would have signature

Signature(
  List(2, "scala.Int".toTypeName, "scala.collection.immutable.List".toTypeName),
  "java.lang.Object".toTypeName)

Note that paramsSig has one entry for a whole type parameter section but one entry for each term parameter (currently, methods in Dotty can only have one type parameter section but this encoding leaves the door open for supporting multiple sections).

The signatures of non-method types are always NotAMethod.

There are three kinds of "missing" parts of signatures:

tpnme.EMPTY Result type marker for NotAMethod and OverloadedSignature
tpnme.WILDCARD Arises from a Wildcard or error type
tpnme.Uninstantiated Arises from an uninstantiated type variable

Attributes

Companion: object
Supertypes: trait Serializable

trait Product

trait Equals

class Object

trait Matchable

class Any
Show all

Attributes

Companion: class
Supertypes: trait Product

trait Mirror

class Object

trait Matchable

class Any
Self type: Signature.type

The language in which the definition being erased was written.

Attributes

Companion: object
Supertypes: trait Enum

trait Serializable

trait Product

trait Equals

class Object

trait Matchable

class Any
Show all

Attributes

Companion: enum
Supertypes: trait Sum

trait Mirror

class Object

trait Matchable

class Any
Self type: SourceLanguage.type

Attributes

Supertypes: class SymbolLoader

class LazyType

trait (TermSymbol, ClassSymbol) => LazyType

trait Symbol => LazyType

class UncachedGroundType

class Type

trait Showable

trait Hashable

class Object

trait Matchable

class Any
Show all

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: StdNames.type

Substitution operations on types. See the corresponding subst and substThis methods on class Type for an explanation.

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Substituters.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: SymDenotations.type

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

Attributes

Supertypes: class LazyType

trait (TermSymbol, ClassSymbol) => LazyType

trait Symbol => LazyType

class UncachedGroundType

class Type

trait Showable

trait Hashable

class Object

trait Matchable

class Any
Show all
Known subtypes: class ClassfileLoader

class NoLoader

class SourcefileLoader

class PackageLoader
Self type: SymbolLoader

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: SymbolLoaders.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Symbols.type

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: TrackingTypeComparer.type

Attributes

Companion: object
Supertypes: class TypeComparer

trait PatternTypeConstrainer

trait ConstraintHandling

class Object

trait Matchable

class Any
Show all

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: TypeApplications.type

A decorator that provides methods for modeling type application

Attributes

Companion: object
Supertypes: class AnyVal

trait Matchable

class Any

Provides methods to compare types.

Attributes

Companion: object
Supertypes: trait PatternTypeConstrainer

trait ConstraintHandling

class Object

trait Matchable

class Any
Known subtypes: class ExplainingTypeComparer

class TrackingTypeComparer

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: TypeComparer.type

Erased types are:

ErasedValueType TypeRef(prefix is ignored, denot is ClassDenotation) TermRef(prefix is ignored, denot is SymDenotation) JavaArrayType AnnotatedType MethodType ThisType SuperType ClassInfo (NoPrefix, ...) NoType NoPrefix WildcardType ErrorType

only for isInstanceOf, asInstanceOf: PolyType, TypeParamRef, TypeBounds

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: TypeErasure.type

Value parameters

isConstructor: Argument forms part of the type of a constructor
isSymbol: If true, the type being erased is the info of a symbol.
semiEraseVCs: If true, value classes are semi-erased to ErasedValueType (they will be fully erased in ElimErasedValueType). If false, they are erased like normal classes.
sourceLanguage: Adapt our erasure rules to mimic what the given language would do.
wildcardOK: Wildcards are acceptable (true when using the erasure for computing a signature name).

Attributes

Companion: object
Supertypes: class Object

trait Matchable

class Any

Attributes

Companion: object
Supertypes: class Exception

class Throwable

trait Serializable

class Object

trait Matchable

class Any
Show all
Known subtypes: class CyclicReference

class MalformedType

class MissingType

class RecursionOverflow

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: TypeError.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: TypeEval.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: TypeOps.type

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: TyperState.type

Attributes

Companion: object
Supertypes: class Object

trait Matchable

class Any

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Types.type

When calling Constraint#addLess(p1, p2, ...), the caller might end up unifying one parameter with the other, this enum lets addLess know which direction the unification will take.

Attributes

Supertypes: trait Enum

trait Serializable

trait Product

trait Equals

class Object

trait Matchable

class Any
Show all

Attributes

Companion: object
Supertypes: class WeakHashSet[Type]

class MutableSet[Type]

class ReadOnlySet[Type]

class Object

trait Matchable

class Any
Show all

Defines operation unique for hash-consing types. Also defines specialized hash sets for hash consing uniques of a specific type. All sets offer a enterIfNew method which checks whether a type with the given parts exists already and creates a new one if not.

Attributes

Companion: class
Supertypes: class Object

trait Matchable

class Any
Self type: Uniques.type

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: Variances.type

Post-process exceptions that might result from StackOverflow to add tracing information while unwalking the stack.

Attributes

Supertypes: class Object

trait Matchable

class Any
Self type: handleRecursive.type

dotty.tools.dotc.core

Members list

Packages

Type members

Classlikes

Attributes

Value parameters

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Value parameters

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Attributes

Value parameters

Attributes

Attributes

Attributes

Attributes