Source file "com/sun/tools/javac/tree/TreeScanner.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 436 of 436 | 0% | 12 of 12 | 0% | 59 | 59 | 144 | 144 | 53 | 53 |
| visitMethodDef(Tree.MethodDef) | | 0% | n/a | 1 | 1 | 7 | 7 | 1 | 1 | |
| visitClassDef(Tree.ClassDef) | | 0% | n/a | 1 | 1 | 6 | 6 | 1 | 1 | |
| scan(List) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| visitForLoop(Tree.ForLoop) | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| visitNewClass(Tree.NewClass) | | 0% | n/a | 1 | 1 | 5 | 5 | 1 | 1 | |
| visitVarDef(Tree.VarDef) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| visitForeachLoop(Tree.ForeachLoop) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| visitTry(Tree.Try) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| visitConditional(Tree.Conditional) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| visitIf(Tree.If) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| visitNewArray(Tree.NewArray) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| visitTopLevel(Tree.TopLevel) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitDoLoop(Tree.DoLoop) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitWhileLoop(Tree.WhileLoop) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitSwitch(Tree.Switch) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitCase(Tree.Case) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitSynchronized(Tree.Synchronized) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitCatch(Tree.Catch) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitAssert(Tree.Assert) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitApply(Tree.Apply) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitAssign(Tree.Assign) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitAssignop(Tree.Assignop) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitBinary(Tree.Binary) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitTypeCast(Tree.TypeCast) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitTypeTest(Tree.TypeTest) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitIndexed(Tree.Indexed) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitTypeApply(Tree.TypeApply) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitAnnotation(Tree.Annotation) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitLetExpr(Tree.LetExpr) | | 0% | n/a | 1 | 1 | 3 | 3 | 1 | 1 | |
| visitTypeArgument(Tree.TypeArgument) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| visitTree(Tree) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| scan(Tree) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| visitImport(Tree.Import) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitBlock(Tree.Block) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitLabelled(Tree.Labelled) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitExec(Tree.Exec) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitReturn(Tree.Return) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitThrow(Tree.Throw) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitParens(Tree.Parens) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitUnary(Tree.Unary) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitSelect(Tree.Select) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitTypeArray(Tree.TypeArray) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitTypeParameter(Tree.TypeParameter) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| visitModifiers(Tree.Modifiers) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| TreeScanner() | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| visitSkip(Tree.Skip) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| visitBreak(Tree.Break) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| visitContinue(Tree.Continue) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| visitIdent(Tree.Ident) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| visitLiteral(Tree.Literal) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| visitTypeIdent(Tree.TypeIdent) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| visitErroneous(Tree.Erroneous) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |