void comma(final AstNode nextNode) { comma(nextNode, false); }
void comma(final AstNode nextNode) { comma(nextNode, false); }
void comma(final AstNode nextNode) { comma(nextNode, false); }
private void writeCommaSeparatedList(final Iterable<? extends AstNode> list) { boolean isFirst = true; for (final AstNode node : list) { if (isFirst) { isFirst = false; } else { comma(node); } node.acceptVisitor(this, null); } }
private void writeCommaSeparatedList(final Iterable<? extends AstNode> list) { boolean isFirst = true; for (final AstNode node : list) { if (isFirst) { isFirst = false; } else { comma(node); } node.acceptVisitor(this, null); } }
private void writeCommaSeparatedList(final Iterable<? extends AstNode> list) { boolean isFirst = true; for (final AstNode node : list) { if (isFirst) { isFirst = false; } else { comma(node); } node.acceptVisitor(this, null); } }
void optionalComma() { // Look if there's a comma after the current node, and insert it if it exists. AstNode position = positionStack.peek(); while (position != null && position.getNodeType() == NodeType.WHITESPACE) { position = position.getNextSibling(); } if (position != null && position.getRole() == Roles.COMMA) { comma(null, true); } }
void optionalComma() { // Look if there's a comma after the current node, and insert it if it exists. AstNode position = positionStack.peek(); while (position != null && position.getNodeType() == NodeType.WHITESPACE) { position = position.getNextSibling(); } if (position != null && position.getRole() == Roles.COMMA) { comma(null, true); } }
void optionalComma() { // Look if there's a comma after the current node, and insert it if it exists. AstNode position = positionStack.peek(); while (position != null && position.getNodeType() == NodeType.WHITESPACE) { position = position.getNextSibling(); } if (position != null && position.getRole() == Roles.COMMA) { comma(null, true); } }
comma(node, wrapElements);
comma(node, wrapElements);
comma(node, wrapElements);
comma(node.getNextSibling());
comma(node.getNextSibling());
comma(node.getNextSibling());