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

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

Go to download

A version of the Rhino Javascript engine pulled diretly from the Mozialla repos.

The newest version!
/* -*- Mode: java; tab-width: 8; indent-tabs-mode: nil; c-basic-offset: 4 -*-
 *
 * ***** BEGIN LICENSE BLOCK *****
 * Version: MPL 1.1/GPL 2.0
 *
 * The contents of this file are subject to the Mozilla Public License Version
 * 1.1 (the "License"); you may not use this file except in compliance with
 * the License. You may obtain a copy of the License at
 * http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the
 * License.
 *
 * The Original Code is Rhino code, released
 * May 6, 1999.
 *
 * The Initial Developer of the Original Code is
 * Netscape Communications Corporation.
 * Portions created by the Initial Developer are Copyright (C) 1997-1999
 * the Initial Developer. All Rights Reserved.
 *
 * Contributor(s):
 *   Steve Yegge
 *
 * Alternatively, the contents of this file may be used under the terms of
 * the GNU General Public License Version 2 or later (the "GPL"), in which
 * case the provisions of the GPL are applicable instead of those above. If
 * you wish to allow use of your version of this file only under the terms of
 * the GPL and not to allow others to use your version of this file under the
 * MPL, indicate your decision by deleting the provisions above and replacing
 * them with the notice and other provisions required by the GPL. If you do
 * not delete the provisions above, a recipient may use your version of this
 * file under either the MPL or the GPL.
 *
 * ***** END LICENSE BLOCK ***** */

package org.mozilla.javascript.ast;

import org.mozilla.javascript.Token;

/**
 * For-in or for-each-in statement.  Node type is {@link Token#FOR}.

* *

for [each] ( LeftHandSideExpression in Expression ) Statement
*
for [each] ( var VariableDeclarationNoIn in Expression ) Statement
*/ public class ForInLoop extends Loop { protected AstNode iterator; protected AstNode iteratedObject; protected int inPosition = -1; protected int eachPosition = -1; protected boolean isForEach; { type = Token.FOR; } public ForInLoop() { } public ForInLoop(int pos) { super(pos); } public ForInLoop(int pos, int len) { super(pos, len); } /** * Returns loop iterator expression */ public AstNode getIterator() { return iterator; } /** * Sets loop iterator expression: the part before the "in" keyword. * Also sets its parent to this node. * @throws IllegalArgumentException if {@code iterator} is {@code null} */ public void setIterator(AstNode iterator) { assertNotNull(iterator); this.iterator = iterator; iterator.setParent(this); } /** * Returns object being iterated over */ public AstNode getIteratedObject() { return iteratedObject; } /** * Sets object being iterated over, and sets its parent to this node. * @throws IllegalArgumentException if {@code object} is {@code null} */ public void setIteratedObject(AstNode object) { assertNotNull(object); this.iteratedObject = object; object.setParent(this); } /** * Returns whether the loop is a for-each loop */ public boolean isForEach() { return isForEach; } /** * Sets whether the loop is a for-each loop */ public void setIsForEach(boolean isForEach) { this.isForEach = isForEach; } /** * Returns position of "in" keyword */ public int getInPosition() { return inPosition; } /** * Sets position of "in" keyword * @param inPosition position of "in" keyword, * or -1 if not present (e.g. in presence of a syntax error) */ public void setInPosition(int inPosition) { this.inPosition = inPosition; } /** * Returns position of "each" keyword */ public int getEachPosition() { return eachPosition; } /** * Sets position of "each" keyword * @param eachPosition position of "each" keyword, * or -1 if not present. */ public void setEachPosition(int eachPosition) { this.eachPosition = eachPosition; } @Override public String toSource(int depth) { StringBuilder sb = new StringBuilder(); sb.append(makeIndent(depth)); sb.append("for "); if (isForEach()) { sb.append("each "); } sb.append("("); sb.append(iterator.toSource(0)); sb.append(" in "); sb.append(iteratedObject.toSource(0)); sb.append(") "); if (body instanceof Block) { sb.append(body.toSource(depth).trim()).append("\n"); } else { sb.append("\n").append(body.toSource(depth+1)); } return sb.toString(); } /** * Visits this node, the iterator, the iterated object, and the body. */ @Override public void visit(NodeVisitor v) { if (v.visit(this)) { iterator.visit(v); iteratedObject.visit(v); body.visit(v); } } }




© 2015 - 2024 Weber Informatics LLC | Privacy Policy