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

src.org.mozilla.javascript.ast.ArrayComprehension Maven / Gradle / Ivy

Go to download

A distribution of rhino which releases snapshots from a submodule folder containing forked sources.

The 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 org.mozilla.javascript.Token;

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

/**
 * AST node for a JavaScript 1.7 Array comprehension.
 * Node type is {@link Token#ARRAYCOMP}.

*/ public class ArrayComprehension extends Scope { private AstNode result; private List loops = new ArrayList(); private AstNode filter; private int ifPosition = -1; private int lp = -1; private int rp = -1; { type = Token.ARRAYCOMP; } public ArrayComprehension() { } public ArrayComprehension(int pos) { super(pos); } public ArrayComprehension(int pos, int len) { super(pos, len); } /** * Returns result expression node (just after opening bracket) */ public AstNode getResult() { return result; } /** * Sets result expression, and sets its parent to this node. * @throws IllegalArgumentException if result is {@code null} */ public void setResult(AstNode result) { assertNotNull(result); this.result = result; result.setParent(this); } /** * Returns loop list */ public List getLoops() { return loops; } /** * Sets loop list * @throws IllegalArgumentException if loops is {@code null} */ public void setLoops(List loops) { assertNotNull(loops); this.loops.clear(); for (ArrayComprehensionLoop acl : loops) { addLoop(acl); } } /** * Adds a child loop node, and sets its parent to this node. * @throws IllegalArgumentException if acl is {@code null} */ public void addLoop(ArrayComprehensionLoop acl) { assertNotNull(acl); loops.add(acl); acl.setParent(this); } /** * Returns filter expression, or {@code null} if not present */ public AstNode getFilter() { return filter; } /** * Sets filter expression, and sets its parent to this node. * Can be {@code null}. */ public void setFilter(AstNode filter) { this.filter = filter; if (filter != null) filter.setParent(this); } /** * Returns position of 'if' keyword, -1 if not present */ public int getIfPosition() { return ifPosition; } /** * Sets position of 'if' keyword */ public void setIfPosition(int ifPosition) { this.ifPosition = ifPosition; } /** * Returns filter left paren position, or -1 if no filter */ public int getFilterLp() { return lp; } /** * Sets filter left paren position, or -1 if no filter */ public void setFilterLp(int lp) { this.lp = lp; } /** * Returns filter right paren position, or -1 if no filter */ public int getFilterRp() { return rp; } /** * Sets filter right paren position, or -1 if no filter */ public void setFilterRp(int rp) { this.rp = rp; } @Override public String toSource(int depth) { StringBuilder sb = new StringBuilder(250); sb.append("["); sb.append(result.toSource(0)); for (ArrayComprehensionLoop loop : loops) { sb.append(loop.toSource(0)); } if (filter != null) { sb.append(" if ("); sb.append(filter.toSource(0)); sb.append(")"); } sb.append("]"); return sb.toString(); } /** * Visits this node, the result expression, the loops, and the optional * filter. */ @Override public void visit(NodeVisitor v) { if (!v.visit(this)) { return; } result.visit(v); for (ArrayComprehensionLoop loop : loops) { loop.visit(v); } if (filter != null) { filter.visit(v); } } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy