com.vaadin.sass.internal.tree.Node Maven / Gradle / Ivy

Go to download
/*
 * Copyright 2000-2014 Vaadin Ltd.
 * 
 * Licensed 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 com.vaadin.sass.internal.tree;

import java.io.Serializable;
import java.util.ArrayList;
import java.util.Collection;

public abstract class Node implements Serializable {
    private static final long serialVersionUID = 5914711715839294816L;

    protected ArrayList children;

    protected Node parentNode;

    public Node() {
        children = new ArrayList();
    }

    public void appendAll(Collection nodes) {
        if (nodes != null && !nodes.isEmpty()) {
            children.addAll(nodes);

            for (final Node n : nodes) {
                if (n.getParentNode() != null) {
                    n.getParentNode().removeChild(n);
                }
                n.setParentNode(this);
            }

        }
    }

    public void appendChildrenAfter(Collection childrenNodes, Node after) {
        if (childrenNodes != null && !childrenNodes.isEmpty()) {
            int index = children.indexOf(after);
            if (index != -1) {
                children.addAll(index, childrenNodes);
                for (final Node child : childrenNodes) {
                    if (child.getParentNode() != null) {
                        child.getParentNode().removeChild(child);
                    }
                    child.setParentNode(this);
                }
            } else {
                throw new NullPointerException("after-node was not found");
            }
        }
    }

    public void appendChild(Node node) {
        if (node != null) {
            children.add(node);
            if (node.getParentNode() != null) {
                node.getParentNode().removeChild(node);
            }
            node.setParentNode(this);
        }
    }

    public void appendChild(Node node, Node after) {
        if (node != null) {
            int index = children.indexOf(after);
            if (index != -1) {
                children.add(index + 1, node);
                if (node.getParentNode() != null) {
                    node.getParentNode().removeChild(node);
                }
                node.setParentNode(this);
            } else {
                throw new NullPointerException("after-node was not found");
            }
        }
    }

    public void removeChild(Node node) {
        if (node != null) {
            boolean removed = children.remove(node);
            if (removed) {
                node.setParentNode(null);
            }
        }
    }

    public ArrayList getChildren() {
        return children;
    }

    public void setChildren(ArrayList children) {
        this.children = children;
    }

    public boolean hasChildren() {
        return !children.isEmpty();
    }

    @Override
    public String toString() {
        return "";
    }

    /**
     * Method for manipulating the data contained within the {@link Node}.
     * 
     * Traversing a node is allowed to modify the node, replace it with one or
     * more nodes at the same or later position in its parent and modify the
     * children of the node, but not modify or remove preceding nodes in its
     * parent.
     */
    public abstract void traverse();

    public Node getParentNode() {
        return parentNode;
    }

    private void setParentNode(Node parentNode) {
        this.parentNode = parentNode;
    }

}