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

org.jetbrains.kotlin.js.util.AstUtil Maven / Gradle / Ivy

There is a newer version: 2.1.0-Beta1
Show newest version
// Copyright (c) 2011, the Dart project authors.  Please see the AUTHORS file
// for details. All rights reserved. Use of this source code is governed by a
// BSD-style license that can be found in the LICENSE file.

package org.jetbrains.kotlin.js.util;

import com.intellij.util.SmartList;
import org.jetbrains.annotations.NotNull;
import org.jetbrains.annotations.Nullable;
import org.jetbrains.kotlin.js.backend.ast.JsBinaryOperation;
import org.jetbrains.kotlin.js.backend.ast.JsBinaryOperator;
import org.jetbrains.kotlin.js.backend.ast.JsExpression;
import org.jetbrains.kotlin.js.backend.ast.JsNode;

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

public final class AstUtil {
    private AstUtil() {
    }

    /**
     * Returns a sequence of expressions (using the binary sequence operator).
     *
     * @param exprs - expressions to add to sequence
     * @return a sequence of expressions.
     */
    public static JsBinaryOperation newSequence(JsExpression... exprs) {
        if (exprs.length < 2) {
            throw new RuntimeException("newSequence expects at least two arguments");
        }
        JsExpression result = exprs[exprs.length - 1];
        for (int i = exprs.length - 2; i >= 0; i--) {
            result = new JsBinaryOperation(JsBinaryOperator.COMMA, exprs[i], result);
        }
        return (JsBinaryOperation) result;
    }

    @Nullable
    public static  T deepCopy(@Nullable T node) {
        if (node == null) return null;

        //noinspection unchecked
        return (T) node.deepCopy();
    }

    @NotNull
    public static  List deepCopy(@Nullable List nodes) {
        if (nodes == null) return new SmartList();

        List nodesCopy = new ArrayList(nodes.size());
        for (T node : nodes) {
            nodesCopy.add(deepCopy(node));
        }

        return nodesCopy;
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy