object specialScalaErasure extends ScalaErasureMap
This is used as the Scala erasure during the erasure phase itself It differs from normal erasure in that value classes are erased to ErasedValueTypes which are then later unwrapped to the underlying parameter type in phase posterasure.
- Alphabetic
- By Inheritance
- specialScalaErasure
- ScalaErasureMap
- ErasureMap
- TypeMap
- Function1
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Type Members
-
class
TypeMapTransformer extends SymbolTable.Transformer
This transformer leaves the tree alone except to remap its types.
This transformer leaves the tree alone except to remap its types.
- Definition Classes
- TypeMap
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
andThen[A](g: (SymbolTable.Type) ⇒ A): (SymbolTable.Type) ⇒ A
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
def
apply(tp: SymbolTable.Type): SymbolTable.Type
- Definition Classes
- ErasureMap → TypeMap → Function1
-
def
applyInArray(tp: SymbolTable.Type): SymbolTable.Type
- Definition Classes
- ErasureMap
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
compose[A](g: (A) ⇒ SymbolTable.Type): (A) ⇒ SymbolTable.Type
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
eraseDerivedValueClassRef(tref: SymbolTable.TypeRef): SymbolTable.Type
- Definition Classes
- specialScalaErasure → ErasureMap
-
def
eraseNormalClassRef(tref: SymbolTable.TypeRef): SymbolTable.Type
- Definition Classes
- ErasureMap
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
flipped[T](body: ⇒ T): T
- Definition Classes
- TypeMap
- Annotations
- @inline()
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
mapOver(tree: SymbolTable.Tree, giveup: () ⇒ Nothing): SymbolTable.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: SymbolTable.Tree): SymbolTable.Tree
- Definition Classes
- TypeMap
-
def
mapOver(annot: SymbolTable.AnnotationInfo): SymbolTable.AnnotationInfo
- Definition Classes
- TypeMap
-
def
mapOver(origSyms: List[SymbolTable.Symbol]): List[SymbolTable.Symbol]
Map this function over given list of symbols
Map this function over given list of symbols
- Definition Classes
- TypeMap
-
def
mapOver(scope: SymbolTable.Scope): SymbolTable.Scope
Map this function over given scope
Map this function over given scope
- Definition Classes
- TypeMap
-
def
mapOver(tp: SymbolTable.Type): SymbolTable.Type
Map this function over given type
Map this function over given type
- Definition Classes
- TypeMap
-
def
mapOverAnnotArgs(args: List[SymbolTable.Tree]): List[SymbolTable.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[SymbolTable.AnnotationInfo]): List[SymbolTable.AnnotationInfo]
- Definition Classes
- TypeMap
-
final
def
mapOverArgs(args: List[SymbolTable.Type], tparams: List[SymbolTable.Symbol]): List[SymbolTable.Type]
- Attributes
- protected
- Definition Classes
- TypeMap
-
def
mergeParents(parents: List[SymbolTable.Type]): SymbolTable.Type
In scala, calculate a useful parent.
In scala, calculate a useful parent. An intersection such as
Object with Trait
erases to Trait.- Definition Classes
- ScalaErasureMap → ErasureMap
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- Function1 → AnyRef → Any
-
def
variance: Variance
- Definition Classes
- TypeMap
-
def
variance_=(x: Variance): Unit
- 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
- @native() @throws( ... )
-
final
def
withVariance[T](v: Variance)(body: ⇒ T): T
- Definition Classes
- TypeMap
- Annotations
- @inline()