org.apache.royale.compiler.utils.ASNodeUtils Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of compiler-jx Show documentation
The newest version!
/*
 *
 *  Licensed to the Apache Software Foundation (ASF) under one or more
 *  contributor license agreements.  See the NOTICE file distributed with
 *  this work for additional information regarding copyright ownership.
 *  The ASF licenses this file to You under the Apache License, Version 2.0
 *  (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.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 *
 */

package org.apache.royale.compiler.utils;

import java.util.ArrayList;

import org.apache.royale.compiler.tree.ASTNodeID;
import org.apache.royale.compiler.tree.as.*;

/**
 * @author Michael Schmalle
 */
public class ASNodeUtils
{
    //--------------------------------------------------------------------------
    // Temp: These need JIRA tickets
    //--------------------------------------------------------------------------

    // there seems to be a bug in the ISwitchNode.getCaseNodes(), need to file a bug
    public static final IConditionalNode[] getCaseNodes(ISwitchNode node)
    {
        IBlockNode block = (IBlockNode) node.getChild(1);
        int childCount = block.getChildCount();
        ArrayList retVal = new ArrayList(
                childCount);

        for (int i = 0; i < childCount; i++)
        {
            IASNode child = block.getChild(i);
            if (child instanceof IConditionalNode)
                retVal.add((IConditionalNode) child);
        }

        return retVal.toArray(new IConditionalNode[0]);
    }

    public static final ITerminalNode getDefaultNode(ISwitchNode node)
    {
        IBlockNode block = (IBlockNode) node.getChild(1);
        int childCount = block.getChildCount();
        for (int i = childCount - 1; i >= 0; i--)
        {
            IASNode child = block.getChild(i);
            if (child instanceof ITerminalNode)
                return (ITerminalNode) child;
        }

        return null;
    }

    public static boolean hasParenOpen(IOperatorNode node)
    {
        return node.hasParenthesis();
        //return node.getParent() instanceof IBinaryOperatorNode
        //        && !ASNodeUtils.isString(node.getRightOperandNode());
    }
    
    public static boolean hasParenClose(IOperatorNode node)
    {
        return node.hasParenthesis();
        //return node.getParent() instanceof IBinaryOperatorNode
        //        && !ASNodeUtils.isString(node.getRightOperandNode());
    }

    public static boolean isString(IExpressionNode node)
    {
        return node.getNodeID() == ASTNodeID.LiteralStringID;
    }

    /**
     * Method for checking if a node has been marked to be suppressed for export by Closure, via its definition.
     * The implementation is to check for [JSRoyaleSuppressExport] Metadata in the definition.
     * This metadata is typically added by compiler-jx internally based on the @royalesuppressexport doc-comment directive.
     * @param node the IDocumentableDefinitionNode instance to inspect as being suppressed for export
     */
    public static boolean hasExportSuppressed(IDocumentableDefinitionNode node) {
        return node != null && node.getDefinition() != null && DefinitionUtils.hasExportSuppressed(node.getDefinition());
    }
}