@Override public Void visitBinary(BinaryTree binTree, ExpressionTree expr) { if (binTree.getKind().equals(Kind.CONDITIONAL_OR)) { notApplicable = true; } return super.visitBinary(binTree, expr); }
@Override public Void visitBinary(BinaryTree node, Void unused) { if (node.getKind() == Kind.EQUAL_TO || node.getKind() == Kind.NOT_EQUAL_TO) { getDubiousComparison(classSymbol, node, node.getLeftOperand(), node.getRightOperand()) .ifPresent(suspiciousComparisons::add); } return super.visitBinary(node, null); }
@Override public Void visitBinary(BinaryTree tree, SuggestedFix.Builder p) { if (tree.getKind() == Kind.AND || tree.getKind() == Kind.OR) { p.replace( /* startPos= */ state.getEndPosition(tree.getLeftOperand()), /* endPos= */ ((JCTree) tree.getRightOperand()).getStartPosition(), tree.getKind() == Tree.Kind.AND ? " && " : " || "); } return super.visitBinary(tree, p); } }
@Override public Void visitBinary(BinaryTree binTree, ExpressionTree expr) { if (binTree.getKind().equals(Kind.CONDITIONAL_OR)) { notApplicable = true; } return super.visitBinary(binTree, expr); }
@Override public Void visitBinary(BinaryTree node, Void unused) { if (node.getKind() == Kind.EQUAL_TO || node.getKind() == Kind.NOT_EQUAL_TO) { getDubiousComparison(classSymbol, node, node.getLeftOperand(), node.getRightOperand()) .ifPresent(suspiciousComparisons::add); } return super.visitBinary(node, null); }
public Boolean visitBinary(BinaryTree node, TreePath p) { if (p == null) { super.visitBinary(node, p); return false; } BinaryTree bt = (BinaryTree) p.getLeaf(); boolean result = scan(node.getLeftOperand(), bt.getLeftOperand(), p); return result && scan(node.getRightOperand(), bt.getRightOperand(), p); }
@Override public Void visitBinary(BinaryTree tree, SuggestedFix.Builder p) { if (tree.getKind() == Kind.AND || tree.getKind() == Kind.OR) { p.replace( state.getEndPosition(tree.getLeftOperand()), ((JCTree) tree.getRightOperand()).getStartPosition(), tree.getKind() == Tree.Kind.AND ? " && " : " || "); } return super.visitBinary(tree, p); } }