scala.tools.nsc.transform.Erasure.erasure

The erasure |T| of a type T. This is:

For a constant type, itself.
For a type-bounds structure, the erasure of its upper bound.
For every other singleton type, the erasure of its supertype.
For a typeref scala.Array+[T] where T is an abstract type, AnyRef.
For a typeref scala.Array+[T] where T is not an abstract type, scala.Array+[|T|].
For a typeref scala.Any or scala.AnyVal, java.lang.Object.
For a typeref scala.Unit, scala.runtime.BoxedUnit.
For a typeref P.C[Ts] where C refers to a class, |P|.C. (Where P is first rebound to the class that directly defines C.)
For a typeref P.C[Ts] where C refers to an alias type, the erasure of C's alias.
For a typeref P.C[Ts] where C refers to an abstract type, the erasure of C's upper bound.
For a non-empty type intersection (possibly with refinement), the erasure of its first parent.
For an empty type intersection, java.lang.Object.
For a method type (Fs)scala.Unit, (|Fs|)scala#Unit.
For any other method type (Fs)Y, (|Fs|)|T|.
For a polymorphic type, the erasure of its result type.
For the class info type of java.lang.Object, the same type without any parents.
For a class info type of a value class, the same type without any parents.
For any other class info type with parents Ps, the same type with parents |Ps|, but with duplicate references of Object removed.
for all other types, the type itself (with any sub-components erased)

Definition Classes: Erasure → AddInterfaces
Source: Erasure.scala

Linear Supertypes

TypeMap, (Type) ⇒ Type, AnyRef, Any

Type Members

class TypeMapTransformer extends Transformer

This transformer leaves the tree alone except to remap its types.

Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
def allEq[T <: AnyRef](l1: List[T], l2: List[T]): Boolean

Check whether two lists have elements that are eq-equal
Check whether two lists have elements that are eq-equal

Definition Classes
TypeMap
def andThen[A](g: (Type) ⇒ A): (Type) ⇒ A

Definition Classes
Function1
def apply(tp: Type): Type

Definition Classes
erasure → Function1
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def coevolveSym(pre: Type, pre1: Type, sym: Symbol): Symbol

Attributes
protected
Definition Classes
TypeMap
def compose[A](g: (A) ⇒ Type): (A) ⇒ Type

Definition Classes
Function1
val dropNonConstraintAnnotations: Boolean

Should this map drop annotations that are not type-constraint annotations?
Should this map drop annotations that are not type-constraint annotations?

Definition Classes
TypeMap
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
final def getClass(): java.lang.Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def intersectionDominator(parents: List[Type]): Type
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def mapOver(tree: Tree, giveup: () ⇒ Nothing): Tree

Map a tree that is part of an annotation argument.
Map a tree that is part of an annotation argument. If the tree cannot be mapped, then invoke giveup(). The default is to transform the tree with TypeMapTransformer.

Definition Classes
TypeMap
def mapOver(tree: Tree): Option[Tree]

Definition Classes
TypeMap
def mapOver(annot: AnnotationInfo): Option[AnnotationInfo]

Definition Classes
TypeMap
def mapOver(origSyms: List[Symbol]): List[Symbol]

Map this function over given list of symbols
Map this function over given list of symbols

Definition Classes
TypeMap
def mapOver(scope: Scope): Scope

Map this function over given scope
Map this function over given scope

Definition Classes
TypeMap
def mapOver(tp: Type): Type

Map this function over given type
Map this function over given type

Definition Classes
TypeMap
def mapOverAnnotArgs(args: List[Tree]): List[Tree]

Map over a set of annotation arguments.
Map over a set of annotation arguments. If any of the arguments cannot be mapped, then return Nil.

Definition Classes
TypeMap
def mapOverAnnotations(annots: List[AnnotationInfo]): List[AnnotationInfo]

Definition Classes
TypeMap
def mapOverArgs(args: List[Type], tparams: List[Symbol]): List[Type]

Definition Classes
TypeMap
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
Function1 → AnyRef → Any
var variance: Int

The variance relative to start.
The variance relative to start. If you want variances to be significant, set variance = 1 at the top of the typemap.

Definition Classes
TypeMap
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws()

erasure

object erasure extends TypeMap

Type Members

class TypeMapTransformer extends Transformer

Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def allEq[T <: AnyRef](l1: List[T], l2: List[T]): Boolean

def andThen[A](g: (Type) ⇒ A): (Type) ⇒ A

def apply(tp: Type): Type

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def coevolveSym(pre: Type, pre1: Type, sym: Symbol): Symbol

def compose[A](g: (A) ⇒ Type): (A) ⇒ Type

val dropNonConstraintAnnotations: Boolean

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

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

def hashCode(): Int

def intersectionDominator(parents: List[Type]): Type

final def isInstanceOf[T0]: Boolean

def mapOver(tree: Tree, giveup: () ⇒ Nothing): Tree

def mapOver(tree: Tree): Option[Tree]

def mapOver(annot: AnnotationInfo): Option[AnnotationInfo]

def mapOver(origSyms: List[Symbol]): List[Symbol]

def mapOver(scope: Scope): Scope

def mapOver(tp: Type): Type

def mapOverAnnotArgs(args: List[Tree]): List[Tree]

def mapOverAnnotations(annots: List[AnnotationInfo]): List[AnnotationInfo]

def mapOverArgs(args: List[Type], tparams: List[Symbol]): List[Type]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

var variance: Int

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from TypeMap

Inherited from (Type) ⇒ Type

Inherited from AnyRef

Inherited from Any