scala.reflect.internal.Types.InstantiateDependentMap

Instance Constructors

new InstantiateDependentMap(params: List[Symbol], actuals: List[Type])

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
object ParamWithActual extends AnyRef
def andThen[A](g: (Type) ⇒ A): (Type) ⇒ A

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

Definition Classes
InstantiateDependentMap → TypeMap → Function1
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws()
def compose[A](g: (A) ⇒ Type): (A) ⇒ Type

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

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

Definition Classes
AnyRef → Any
def existSymFor(actualIdx: Int): Symbol
def existentialsNeeded: List[Symbol]
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def keepAnnotation(annot: AnnotationInfo): Boolean

Definition Classes
KeepOnlyTypeConstraints → AnnotationFilter
def mapOver(arg: 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
InstantiateDependentMap → TypeMap
def mapOver(annot: AnnotationInfo): AnnotationInfo

Definition Classes
AnnotationFilter → TypeMap
def mapOver(tree: Tree): Tree

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]

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

Definition Classes
AnyRef
def noChangeToSymbols(origSyms: List[Symbol]): Boolean

Called by mapOver to determine whether the original symbols can be returned, or whether they must be cloned.
Called by mapOver to determine whether the original symbols can be returned, or whether they must be cloned. Overridden in VariantTypeMap.

Attributes
protected
Definition Classes
TypeMap
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
def variance: Int

Mix in VariantTypeMap if you want variances to be significant.
Mix in VariantTypeMap if you want variances to be significant.

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()

InstantiateDependentMap

class InstantiateDependentMap extends TypeMap with KeepOnlyTypeConstraints

Instance Constructors

new InstantiateDependentMap(params: List[Symbol], actuals: List[Type])

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

object ParamWithActual extends AnyRef

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

def apply(tp: Type): Type

final def asInstanceOf[T0]: T0

def clone(): AnyRef

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

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def existSymFor(actualIdx: Int): Symbol

def existentialsNeeded: List[Symbol]

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def keepAnnotation(annot: AnnotationInfo): Boolean

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

def mapOver(annot: AnnotationInfo): AnnotationInfo

def mapOver(tree: Tree): Tree

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

def noChangeToSymbols(origSyms: List[Symbol]): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

def toString(): String

def variance: Int

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from KeepOnlyTypeConstraints

Inherited from AnnotationFilter

Inherited from TypeMap

Inherited from (Type) ⇒ Type

Inherited from AnyRef

Inherited from Any