001: /*
002: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER.
003: *
004: * Copyright 1997-2007 Sun Microsystems, Inc. All rights reserved.
005: *
006: * The contents of this file are subject to the terms of either the GNU General
007: * Public License Version 2 only ("GPL") or the Common Development and Distribution
008: * License("CDDL") (collectively, the "License"). You may not use this file except in
009: * compliance with the License. You can obtain a copy of the License at
010: * http://www.netbeans.org/cddl-gplv2.html or nbbuild/licenses/CDDL-GPL-2-CP. See the
011: * License for the specific language governing permissions and limitations under the
012: * License. When distributing the software, include this License Header Notice in
013: * each file and include the License file at nbbuild/licenses/CDDL-GPL-2-CP. Sun
014: * designates this particular file as subject to the "Classpath" exception as
015: * provided by Sun in the GPL Version 2 section of the License file that
016: * accompanied this code. If applicable, add the following below the License Header,
017: * with the fields enclosed by brackets [] replaced by your own identifying
018: * information: "Portions Copyrighted [year] [name of copyright owner]"
019: *
020: * Contributor(s):
021: *
022: * The Original Software is NetBeans. The Initial Developer of the Original Software
023: * is Sun Microsystems, Inc. Portions Copyright 1997-2007 Sun Microsystems, Inc. All
024: * Rights Reserved.
025: *
026: * If you wish your version of this file to be governed by only the CDDL or only the
027: * GPL Version 2, indicate your decision by adding "[Contributor] elects to include
028: * this software in this distribution under the [CDDL or GPL Version 2] license." If
029: * you do not indicate a single choice of license, a recipient has the option to
030: * distribute your version of this file under either the CDDL, the GPL Version 2 or
031: * to extend the choice of license to its licensees as provided above. However, if
032: * you add GPL Version 2 code and therefore, elected the GPL Version 2 license, then
033: * the option applies only if the new code is made subject to such option by the
034: * copyright holder.
035: */
036:
037: package org.netbeans.installer.sandbox.tree.nodes;
038:
039: import org.netbeans.installer.sandbox.tree.Node;
040: import org.netbeans.installer.sandbox.tree.NodeType;
041:
042: /**
043: * @author Danila_Dugurov
044: *
045: */
046: public class CompositeNode extends NodeBase {
047:
048: Node firstChild;
049:
050: public NodeType type() {
051: return NodeType.COMPOSITE;
052: }
053:
054: public Node getFirstChild() {
055: return firstChild;
056: }
057:
058: public Node getLastChild() {
059: if (firstChild == null)
060: return null;
061: Node next = firstChild;
062: while (next.getNextSibling() != null) {
063: next = next.getNextSibling();
064: }
065: return next;
066: }
067:
068: public void insertBefore(Node newChild, Node nextChild) {
069: checkAgnation(nextChild);
070: checkCircles(newChild);
071: if (newChild.getParent() != null)
072: newChild.getParent().removeChild(newChild);
073: final NodeBase base = (NodeBase) newChild;
074: final WritableNode next = (WritableNode) nextChild;
075: final WritableNode previous = (WritableNode) next
076: .getPrevSibling();
077: if (next == firstChild)
078: firstChild = base;
079: if (next != null)
080: next.setPrevSibling(base);
081: if (previous != null)
082: previous.setNextSibling(base);
083: base.setNextSibling(next);
084: base.setPrevSibling(previous);
085: base.setParent(this );
086: }
087:
088: public void addChild(Node newChild) {
089: checkCircles(newChild);
090: if (newChild.getParent() != null)
091: newChild.getParent().removeChild(newChild);
092: final NodeBase base = (NodeBase) newChild;
093: final WritableNode last = (WritableNode) getLastChild();
094: if (last == null)
095: firstChild = base;
096: else
097: last.setNextSibling(base);
098: base.setPrevSibling(last);
099: base.setParent(this );
100: }
101:
102: public Node replaceChild(Node newChild, Node oldChild) {
103: checkAgnation(oldChild);
104: checkCircles(newChild);
105: insertBefore(newChild, oldChild);
106: return removeChild(oldChild);
107: }
108:
109: public Node removeChild(Node child) {
110: checkAgnation(child);
111: NodeBase base = (NodeBase) child;
112: final WritableNode next = base.next;
113: final WritableNode previous = base.previous;
114: if (next != null)
115: next.setPrevSibling(previous);
116: if (previous != null)
117: previous.setNextSibling(next);
118: if (firstChild == base)
119: firstChild = next;
120: return clearRelationship(base);
121: }
122:
123: public void setFirstChild(WritableNode firstChild) {
124: this .firstChild = firstChild;
125: }
126:
127: private Node clearRelationship(WritableNode child) {
128: child.setNextSibling(null);
129: child.setPrevSibling(null);
130: child.setParent(null);
131: return child;
132: }
133: }
|