scala3-compiler-bootstrapped/dotty.tools.dotc.typer/Applications/ApplicableToTrees

ApplicableToTrees

class ApplicableToTrees(methRef: TermRef, args: List[Tree], resultType: Type, argMatch: ArgMatch)(using `x$5`: Context) extends TestApplication[Tree[Type]]

Subclass of Application for applicability tests with type arguments and value argument trees.

class Object
trait Matchable
class Any

Type members

Inherited types

type Result = Unit
Inherited from
TestApplication
type TypedArg = Arg
Inherited from
TestApplication

Value members

Concrete methods

def argType(arg: Tree, formal: Type): Type
def isVarArg(arg: Tree): Boolean
def treeToArg(arg: Tree): Tree
def typeOfArg(arg: Tree): Type

Inherited methods

final def addArg(arg: TypedArg, formal: Type): Unit
Inherited from
TestApplication
def appPos: SrcPos
Inherited from
TestApplication
protected def argOK(arg: TypedArg, formal: Type): Boolean
Inherited from
TestApplication
def fail(msg: Message): Unit
Inherited from
TestApplication
def fail(msg: Message, arg: Tree[Type]): Unit
Inherited from
TestApplication
protected def init(): Unit
Inherited from
Application
def isJavaAnnotConstr(sym: Symbol): Boolean

Is sym a constructor of a Java-defined annotation?

Is sym a constructor of a Java-defined annotation?

Inherited from
Application
protected def liftFun(): Unit

If constructing trees, pull out all parts of the function which are not idempotent into separate prefix definitions

If constructing trees, pull out all parts of the function which are not idempotent into separate prefix definitions

Inherited from
Application
def makeVarArg(n: Int, elemFormal: Type): Unit
Inherited from
TestApplication
def matchArgs(args: List[Tree[Type]], formals: List[Type], n: Int): Unit

Match re-ordered arguments against formal parameters

Match re-ordered arguments against formal parameters

Value Params
n

The position of the first parameter in formals in methType.

Inherited from
Application
protected def methodType: MethodType
Inherited from
Application
protected def needLiftFun: Boolean

Whether liftFun is needed? It is the case if default arguments are used.

Whether liftFun is needed? It is the case if default arguments are used.

Inherited from
Application
def ok: Boolean
Inherited from
Application
def ok_=(x: Boolean): Unit
Inherited from
Application
def reorder[T >: Untyped](args: List[Tree[T]]): List[Tree[T]]

Re-order arguments to correctly align named arguments

Re-order arguments to correctly align named arguments

Inherited from
Application
def success: Boolean

The application was successful

The application was successful

Inherited from
Application
def typedArg(arg: Tree[Type], formal: Type): Tree[Type]
Inherited from
TestApplication

Inherited fields

lazy val liftedFunType: Type
Inherited from
Application
lazy val methType: Type

The function's type after widening and instantiating polytypes with TypeParamRefs in constraint set

The function's type after widening and instantiating polytypes with TypeParamRefs in constraint set

Inherited from
Application
lazy val orderedArgs: List[Tree[Type]]

The arguments re-ordered so that each named argument matches the same-named formal parameter.

The arguments re-ordered so that each named argument matches the same-named formal parameter.

Inherited from
Application