All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.mozilla.javascript.ast.SwitchCase Maven / Gradle / Ivy

Go to download

Rhino is an open-source implementation of JavaScript written entirely in Java. It is typically embedded into Java applications to provide scripting to end users.

There is a newer version: 1.7.15
Show newest version
/* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
 *
 * This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at http://mozilla.org/MPL/2.0/. */

package org.mozilla.javascript.ast;

import java.util.ArrayList;
import java.util.List;

import org.mozilla.javascript.Token;

/**
 * Switch-case AST node type.  The switch case is always part of a
 * switch statement.
 * Node type is {@link Token#CASE}.
 *
 * 
CaseBlock :
 *        { [CaseClauses] }
 *        { [CaseClauses] DefaultClause [CaseClauses] }
 * CaseClauses :
 *        CaseClause
 *        CaseClauses CaseClause
 * CaseClause :
 *        case Expression : [StatementList]
 * DefaultClause :
 *        default : [StatementList]
*/ public class SwitchCase extends AstNode { private AstNode expression; private List statements; { type = Token.CASE; } public SwitchCase() { } public SwitchCase(int pos) { super(pos); } public SwitchCase(int pos, int len) { super(pos, len); } /** * Returns the case expression, {@code null} for default case */ public AstNode getExpression() { return expression; } /** * Sets the case expression, {@code null} for default case. * Note that for empty fall-through cases, they still have * a case expression. In {@code case 0: case 1: break;} the * first case has an {@code expression} that is a * {@link NumberLiteral} with value {@code 0}. */ public void setExpression(AstNode expression) { this.expression = expression; if (expression != null) expression.setParent(this); } /** * Return true if this is a default case. * @return true if {@link #getExpression} would return {@code null} */ public boolean isDefault() { return expression == null; } /** * Returns statement list, which may be {@code null}. */ public List getStatements() { return statements; } /** * Sets statement list. May be {@code null}. Replaces any existing * statements. Each element in the list has its parent set to this node. */ public void setStatements(List statements) { if (this.statements != null) { this.statements.clear(); } for (AstNode s : statements) { addStatement(s); } } /** * Adds a statement to the end of the statement list. * Sets the parent of the new statement to this node, updates * its start offset to be relative to this node, and sets the * length of this node to include the new child. * * @param statement a child statement * @throws IllegalArgumentException} if statement is {@code null} */ public void addStatement(AstNode statement) { assertNotNull(statement); if (statements == null) { statements = new ArrayList(); } int end = statement.getPosition() + statement.getLength(); this.setLength(end - this.getPosition()); statements.add(statement); statement.setParent(this); } @Override public String toSource(int depth) { StringBuilder sb = new StringBuilder(); sb.append(makeIndent(depth)); if (expression == null) { sb.append("default:\n"); } else { sb.append("case "); sb.append(expression.toSource(0)); sb.append(":"); if(this.getInlineComment() != null) { sb.append(this.getInlineComment().toSource(depth + 1)); } sb.append("\n"); } if (statements != null) { for (AstNode s : statements) { sb.append(s.toSource(depth+1)); if(s.getType() == Token.COMMENT && ((Comment)s).getCommentType() == Token.CommentType.LINE) { sb.append("\n"); } } } return sb.toString(); } /** * Visits this node, then the case expression if present, then * each statement (if any are specified). */ @Override public void visit(NodeVisitor v) { if (v.visit(this)) { if (expression != null) { expression.visit(v); } if (statements != null) { for (AstNode s : statements) { s.visit(v); } } } } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy