Examples with ASTBuilder org.autorefactor.refactoring.ASTBuilder used on opensource projects

Example 26 with ASTBuilder

use of org.autorefactor.refactoring.ASTBuilder in project AutoRefactor by JnRouvignac.

the class AllInOneMethodRatherThanLoopRefactoring method replaceWithCollectionsAddAll.

private boolean replaceWithCollectionsAddAll(Statement node, Expression iterable, MethodInvocation mi) {
    ASTBuilder b = ctx.getASTBuilder();
    ctx.getRefactorings().replace(node, b.toStmt(b.invoke(b.name("java", "util", "Collections"), "addAll", b.copy(mi.getExpression()), b.copy(iterable))));
    return DO_NOT_VISIT_SUBTREE;
}

Example 27 with ASTBuilder

use of org.autorefactor.refactoring.ASTBuilder in project AutoRefactor by JnRouvignac.

the class ORConditionRatherThanRedundantClausesRefactoring method replaceDuplicateExpr.

private void replaceDuplicateExpr(final InfixExpression node, final Operator operator, final Expression leftExpr, final Expression rightExpr, final boolean isLeftExprPositive, final boolean isRightExprPositive, final boolean forward) {
    final ASTBuilder b = ctx.getASTBuilder();
    Expression copyOfLeftExpr = b.copy(leftExpr);
    if (!isLeftExprPositive) {
        copyOfLeftExpr = b.not(copyOfLeftExpr);
    }
    Expression copyOfRightExpr = b.copy(rightExpr);
    if (!isRightExprPositive) {
        copyOfRightExpr = b.not(copyOfRightExpr);
    }
    if (forward) {
        ctx.getRefactorings().replace(node, b.infixExpr(copyOfLeftExpr, operator, copyOfRightExpr));
    } else {
        ctx.getRefactorings().replace(node, b.infixExpr(copyOfRightExpr, operator, copyOfLeftExpr));
    }
}

Example 28 with ASTBuilder

use of org.autorefactor.refactoring.ASTBuilder in project AutoRefactor by JnRouvignac.

the class AddBracketsToControlStatementRefactoring method setBlock.

private boolean setBlock(Statement statement) {
    if (statement == null) {
        return VISIT_SUBTREE;
    }
    final ASTBuilder b = this.ctx.getASTBuilder();
    final Block block = b.block(b.copy(statement));
    block.accept(this);
    this.ctx.getRefactorings().replace(statement, block);
    return DO_NOT_VISIT_SUBTREE;
}

Example 29 with ASTBuilder

use of org.autorefactor.refactoring.ASTBuilder in project AutoRefactor by JnRouvignac.

the class AbstractUnitTestRefactoring method invokeFail.

private MethodInvocation invokeFail(final ASTNode node, final MethodInvocation originalMethod, final Expression failureMessage) {
    final ASTBuilder b = this.ctx.getASTBuilder();
    final List<Expression> args = arguments(originalMethod);
    if ((args.size() == 1) || (args.size() == 2)) {
        return invokeMethod(b, originalMethod, "fail", null, null, failureMessage);
    } else {
        throw new NotImplementedException(node);
    }
}

Example 30 with ASTBuilder

use of org.autorefactor.refactoring.ASTBuilder in project AutoRefactor by JnRouvignac.

the class CommonCodeInIfElseStatementRefactoring method visit.

// TODO handle switch statements
// TODO also handle ternary operator, ConditionalExpression
@Override
public boolean visit(IfStatement node) {
    if (node.getElseStatement() == null) {
        return VISIT_SUBTREE;
    }
    if (!(node.getParent() instanceof Block)) {
        // when not inside curly braces
        return VISIT_SUBTREE;
    }
    final ASTBuilder b = this.ctx.getASTBuilder();
    final Refactorings r = this.ctx.getRefactorings();
    final List<List<Statement>> allCasesStmts = new ArrayList<List<Statement>>();
    final List<List<ASTNode>> removedCaseStmts = new LinkedList<List<ASTNode>>();
    // collect all the if / else if / else if / ... / else cases
    if (collectAllCases(allCasesStmts, node)) {
        // initialize removedCaseStmts list
        for (int i = 0; i < allCasesStmts.size(); i++) {
            removedCaseStmts.add(new LinkedList<ASTNode>());
        }
        // if all cases exist
        final ASTMatcher matcher = new ASTMatcherSameVariablesAndMethods();
        final int minSize = minSize(allCasesStmts);
        final List<Statement> caseStmts = allCasesStmts.get(0);
        boolean result = VISIT_SUBTREE;
        // identify matching statements starting from the beginning of each case
        for (int stmtIndex = 0; stmtIndex < minSize; stmtIndex++) {
            if (!match(matcher, allCasesStmts, true, stmtIndex, 0, allCasesStmts.size())) {
                break;
            }
            r.insertBefore(b.copy(caseStmts.get(stmtIndex)), node);
            removeStmts(allCasesStmts, true, stmtIndex, removedCaseStmts);
            result = DO_NOT_VISIT_SUBTREE;
        }
        // identify matching statements starting from the end of each case
        for (int stmtIndex = 1; 0 <= minSize - stmtIndex; stmtIndex++) {
            if (!match(matcher, allCasesStmts, false, stmtIndex, 0, allCasesStmts.size()) || anyContains(removedCaseStmts, allCasesStmts, stmtIndex)) {
                break;
            }
            r.insertAfter(b.copy(caseStmts.get(caseStmts.size() - stmtIndex)), node);
            removeStmts(allCasesStmts, false, stmtIndex, removedCaseStmts);
            result = DO_NOT_VISIT_SUBTREE;
        }
        // remove the nodes common to all cases
        final List<Boolean> areCasesEmpty = new ArrayList<Boolean>(allCasesStmts.size());
        for (int i = 0; i < allCasesStmts.size(); i++) {
            areCasesEmpty.add(Boolean.FALSE);
        }
        removeStmtsFromCases(allCasesStmts, removedCaseStmts, areCasesEmpty);
        if (allEmpty(areCasesEmpty)) {
            // TODO JNR keep comments
            r.remove(node);
            return DO_NOT_VISIT_SUBTREE;
        }
        // remove empty cases
        if (areCasesEmpty.get(0)) {
            if (areCasesEmpty.size() == 2 && !areCasesEmpty.get(1)) {
                // then clause is empty and there is only one else clause
                // => revert if statement
                r.replace(node, b.if0(b.not(b.parenthesizeIfNeeded(b.move(node.getExpression()))), b.move(node.getElseStatement())));
            } else {
                r.replace(node.getThenStatement(), b.block());
            }
            result = DO_NOT_VISIT_SUBTREE;
        }
        for (int i = 1; i < areCasesEmpty.size(); i++) {
            if (areCasesEmpty.get(i)) {
                final Statement firstStmt = allCasesStmts.get(i).get(0);
                r.remove(findNodeToRemove(firstStmt, firstStmt.getParent()));
                result = DO_NOT_VISIT_SUBTREE;
            }
        }
        return result;
    }
    return VISIT_SUBTREE;
}