@@ -185,17 +185,17 @@ object TreeChecker {
185
185
object TreeNodeChecker extends untpd.TreeTraverser :
186
186
import untpd ._
187
187
def traverse (tree : Tree )(using Context ) = tree match
188
- case t : TypeTree => assert(assertion = false , i " TypeTree not expected: $t" )
189
- case t @ TypeApply (fun, _targs) => traverse(fun)
190
- case t @ New (_tpt) =>
191
- case t @ Typed (expr, _tpt) => traverse(expr)
192
- case t @ Closure (env, meth, _tpt) => traverse(env); traverse(meth)
193
- case t @ SeqLiteral (elems, _elemtpt) => traverse(elems)
194
- case t @ ValDef (_, _tpt, _) => traverse(t.rhs)
195
- case t @ DefDef (_, paramss, _tpt, _) => for params <- paramss do traverse(params); traverse(t.rhs)
196
- case t @ TypeDef (_, _rhs) =>
197
- case t @ Template (constr, parents , self, _) => traverse(constr); traverse(parents ); traverse(self); traverse(t.body)
198
- case t => traverseChildren(t)
188
+ case t : TypeTree => assert(assertion = false , i " TypeTree not expected: $t" )
189
+ case t @ TypeApply (fun, _targs) => traverse(fun)
190
+ case t @ New (_tpt) =>
191
+ case t @ Typed (expr, _tpt) => traverse(expr)
192
+ case t @ Closure (env, meth, _tpt) => traverse(env); traverse(meth)
193
+ case t @ SeqLiteral (elems, _elemtpt) => traverse(elems)
194
+ case t @ ValDef (_, _tpt, _) => traverse(t.rhs)
195
+ case t @ DefDef (_, paramss, _tpt, _) => for params <- paramss do traverse(params); traverse(t.rhs)
196
+ case t @ TypeDef (_, _rhs) =>
197
+ case t @ Template (constr, _ , self, _) => traverse(constr); traverse(t.parentsOrDerived ); traverse(self); traverse(t.body)
198
+ case t => traverseChildren(t)
199
199
end traverse
200
200
201
201
private [TreeChecker ] def isValidJVMName (name : Name ): Boolean = name.toString.forall(isValidJVMChar)
0 commit comments