@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { super.visitAssignmentExpression(node, data); addCastForAssignment(node.getLeft(), node.getRight()); return null; }
protected boolean arrayAccessAtTheLeftSideOfAssignment(final AstNode node) { final AssignmentExpression assignment = firstOrDefault(node.getAncestors(AssignmentExpression.class)); if (assignment == null) { return false; } final Expression left = assignment.getLeft(); return left.isAncestorOf(node) && left instanceof IndexerExpression; }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { super.visitAssignmentExpression(node, data); addCastForAssignment(node.getLeft(), node.getRight()); return null; }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { super.visitAssignmentExpression(node, data); addCastForAssignment(node.getLeft(), node.getRight()); return null; }
protected boolean arrayAccessAtTheLeftSideOfAssignment(final AstNode node) { final AssignmentExpression assignment = firstOrDefault(node.getAncestors(AssignmentExpression.class)); if (assignment == null) { return false; } final Expression left = assignment.getLeft(); return left.isAncestorOf(node) && left instanceof IndexerExpression; }
protected boolean arrayAccessAtTheLeftSideOfAssignment(final AstNode node) { final AssignmentExpression assignment = firstOrDefault(node.getAncestors(AssignmentExpression.class)); if (assignment == null) { return false; } final Expression left = assignment.getLeft(); return left.isAncestorOf(node) && left instanceof IndexerExpression; }
@Override public ResolveResult visitAssignmentExpression(final AssignmentExpression node, final Void data) { final ResolveResult leftResult = node.getLeft().acceptVisitor(this, data); if (leftResult != null && leftResult.getType() != null) { return new ResolveResult(leftResult.getType()); } return null; }
@Override public ResolveResult visitAssignmentExpression(final AssignmentExpression node, final Void data) { final ResolveResult leftResult = node.getLeft().acceptVisitor(this, data); if (leftResult != null && leftResult.getType() != null) { return new ResolveResult(leftResult.getType()); } return null; }
@Override public DefiniteAssignmentStatus visitAssignmentExpression(final AssignmentExpression node, final DefiniteAssignmentStatus data) { if (node.getOperator() == AssignmentOperatorType.ASSIGN) { return handleAssignment(node.getLeft(), node.getRight(), data); } else { return visitChildren(node, data); } }
@Override public DefiniteAssignmentStatus visitAssignmentExpression(final AssignmentExpression node, final DefiniteAssignmentStatus data) { if (node.getOperator() == AssignmentOperatorType.ASSIGN) { return handleAssignment(node.getLeft(), node.getRight(), data); } else { return visitChildren(node, data); } }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { processPossibleTypeCast(node.getRight(), getType(node.getLeft())); return super.visitAssignmentExpression(node, data); }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { processPossibleTypeCast(node.getRight(), getType(node.getLeft())); return super.visitAssignmentExpression(node, data); }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { processPossibleTypeCast(node.getRight(), getType(node.getLeft())); return super.visitAssignmentExpression(node, data); }
@Override public DefiniteAssignmentStatus visitAssignmentExpression(final AssignmentExpression node, final DefiniteAssignmentStatus data) { if (node.getOperator() == AssignmentOperatorType.ASSIGN) { return handleAssignment(node.getLeft(), node.getRight(), data); } else { return visitChildren(node, data); } }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { parenthesizeIfRequired(node.getLeft(), ASSIGNMENT + 1); if (_insertParenthesesForReadability) { parenthesizeIfRequired(node.getRight(), RELATIONAL_AND_TYPE_TESTING + 1); } else { parenthesizeIfRequired(node.getRight(), ASSIGNMENT); } return super.visitAssignmentExpression(node, data); } }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { parenthesizeIfRequired(node.getLeft(), ASSIGNMENT + 1); if (_insertParenthesesForReadability) { parenthesizeIfRequired(node.getRight(), RELATIONAL_AND_TYPE_TESTING + 1); } else { parenthesizeIfRequired(node.getRight(), ASSIGNMENT); } return super.visitAssignmentExpression(node, data); } }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void data) { parenthesizeIfRequired(node.getLeft(), ASSIGNMENT + 1); if (_insertParenthesesForReadability) { parenthesizeIfRequired(node.getRight(), RELATIONAL_AND_TYPE_TESTING + 1); } else { parenthesizeIfRequired(node.getRight(), ASSIGNMENT); } return super.visitAssignmentExpression(node, data); } }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void ignored) { startNode(node); node.getLeft().acceptVisitor(this, ignored); space(policy.SpaceAroundAssignment); writeToken(AssignmentExpression.getOperatorRole(node.getOperator())); space(policy.SpaceAroundAssignment); node.getRight().acceptVisitor(this, ignored); endNode(node); return null; }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void ignored) { startNode(node); node.getLeft().acceptVisitor(this, ignored); space(policy.SpaceAroundAssignment); writeToken(AssignmentExpression.getOperatorRole(node.getOperator())); space(policy.SpaceAroundAssignment); node.getRight().acceptVisitor(this, ignored); endNode(node); return null; }
@Override public Void visitAssignmentExpression(final AssignmentExpression node, final Void ignored) { startNode(node); node.getLeft().acceptVisitor(this, ignored); space(policy.SpaceAroundAssignment); writeToken(AssignmentExpression.getOperatorRole(node.getOperator())); space(policy.SpaceAroundAssignment); node.getRight().acceptVisitor(this, ignored); endNode(node); return null; }