/** * In * <pre> * for (i = 0; i < arr.length; arr[i++] = 0); * </pre> * the semicolon is necessary (so no issue is raised) as there are no curly brackets. */ @Override public void visitForStatement(ForStatementTree tree) { except(tree.statement()); super.visitForStatement(tree); }
@Override public void visitForStatement(ForStatementTree tree) { checkIndentation(tree.forKeyword(), tree.statement()); super.visitForStatement(tree); }
@Override public void visitForStatement(ForStatementTree tree) { visitCommaOperatorExpression(tree.init()); scan(tree.condition()); scan(tree.statement()); }
@Override public void visitForStatement(ForStatementTree tree) { scan(tree.init()); scan(tree.condition()); currentLoopCounters = new HashSet<>(); inUpdate = true; scan(tree.update()); inUpdate = false; enterLoopBody(); scan(tree.statement()); leaveLoopBody(); }
@Override public void visitForStatement(ForStatementTree tree) { scan(tree.init()); scan(tree.condition()); scan(tree.update()); scan(tree.statement()); }
@Override public void visitForStatement(ForStatementTree tree) { visitPossibleException(tree.init()); super.scan(tree.condition()); visitPossibleException(tree.update()); super.scan(tree.statement()); }
@Override public void visitForStatement(ForStatementTree tree) { scan(tree.init()); scan(tree.condition()); scanUpdateClause(tree.update()); scan(tree.statement()); }
@Override public void visitForStatement(ForStatementTree tree) { visitPossibleException(tree.init()); super.scan(tree.condition()); visitPossibleException(tree.update()); super.scan(tree.statement()); }