TreeInfo

Fold f over all tree nodes, in depth-first, prefix order

Fold f over all tree nodes, in depth-first, prefix order, but don't visit subtrees where f returns a different result for the root, i.e. f(x, root) ne x.

A class for copying trees. The copy methods avoid creating a new tree If all arguments stay the same.

Note: Some of the copy methods take a context. These are exactly those methods that are overridden in TypedTreeCopier so that they selectively retype themselves. Retyping needs a context.

All type and value parameter symbols of this DefDef

The (last) list of arguments of an application

Does this CaseDef catch everything of a certain Type?

Does this CaseDef catch Throwable?

The first constructor definition in stats

Checks whether predicate p is true for all result parts of this expression, where we zoom into Ifs, Matches, and Blocks.

Does this list contain a named argument tree?

Is tree a backquoted identifier or definition

Is this pattern node a catch-all (wildcard or variable) pattern?

Is this case guarded?

Is tree a path?

Is tpt a vararg type of the form T* or => T*?

Is tree a self constructor call this(...)? I.e. a call to a constructor of the same object?

Is tree a super constructor call?

Is this pattern node a synthetic catch-all case, added during PartialFuction synthesis before we know whether the user provided cases are exhaustive.

Is this parameter list a using clause?

Is tree a variable pattern?

Is the argument a wildcard argument of the form _ or x @ _?

Is this argument node of the form *, or is it a reference to such an argument ? The latter case can happen when an argument is lifted.

Does this argument list end with an argument of the form : _* ?

If path looks like a language import, Some(name) where name is experimental if that sub-module is imported, and the empty term name otherwise.

The method part of an application node, possibly enclosed in a block with only valdefs as statements. the reason for also considering blocks is that named arguments can transform a call into a block, e.g. (b = foo, a = bar) is transformed to { val x$1 = foo val x$2 = bar (x$2, x$1) }

The number of arguments in an application

The largest subset of {NoInits, PureInterface} that a trait or class with these parents can have as flags.

If this is an application, its function part, stripping all Apply nodes (but leaving TypeApply nodes in). Otherwise the tree itself.

If this is a block, its expression part

The underlying pattern ignoring any bindings

Delegate to FunProto or FunProtoTyped depending on whether the prefix is untpd or tpd.

Construct the application $receiver.$method[$targs]($args) using overloading resolution to find a matching overload of $method if necessary. This is useful when overloading resolution needs to be performed in a phase after typer. Note that this will not perform any kind of implicit search.

For untyped trees, this is just the identity. For typed trees, a context derived form ctx that records call as the innermost enclosing call for which the inlined version is currently processed.

If tparams is non-empty, add it to the left paramss, merging it with a leading type parameter list of paramss, if one exists.

The context to use when mapping or accumulating over a tree

Hook to indicate that a transform of some subtree should be skipped