0N/A/*
2362N/A * Copyright (c) 2002, 2005, Oracle and/or its affiliates. All rights reserved.
0N/A *
0N/A * Redistribution and use in source and binary forms, with or without
0N/A * modification, are permitted provided that the following conditions
0N/A * are met:
0N/A *
0N/A * - Redistributions of source code must retain the above copyright
0N/A * notice, this list of conditions and the following disclaimer.
0N/A *
0N/A * - Redistributions in binary form must reproduce the above copyright
0N/A * notice, this list of conditions and the following disclaimer in the
0N/A * documentation and/or other materials provided with the distribution.
0N/A *
2362N/A * - Neither the name of Oracle nor the names of its
0N/A * contributors may be used to endorse or promote products derived
0N/A * from this software without specific prior written permission.
0N/A *
0N/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
0N/A * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
0N/A * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
0N/A * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
0N/A * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
0N/A * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
0N/A * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
0N/A * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
0N/A * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
0N/A * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
0N/A * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
0N/A */
0N/A
4378N/A/*
4378N/A * This source code is provided to illustrate the usage of a given feature
4378N/A * or technique and has been deliberately simplified. Additional steps
4378N/A * required for a production-quality application, such as security checks,
4378N/A * input validation and proper error handling, might not be present in
4378N/A * this sample code.
4378N/A */
4378N/A
4378N/A
0N/Apackage j2dbench;
0N/A
0N/Aimport java.io.PrintWriter;
0N/Aimport javax.swing.JLabel;
0N/Aimport javax.swing.JComponent;
0N/A
0N/Apublic abstract class Node {
0N/A private String nodeName;
0N/A private String description;
0N/A private Group parent;
0N/A private Node next;
0N/A
0N/A protected Node() {
0N/A }
0N/A
0N/A public Node(Group parent, String nodeName, String description) {
0N/A this.parent = parent;
0N/A this.nodeName = nodeName;
0N/A this.description = description;
0N/A parent.addChild(this);
0N/A }
0N/A
0N/A public Group getParent() {
0N/A return parent;
0N/A }
0N/A
0N/A public String getNodeName() {
0N/A return nodeName;
0N/A }
0N/A
0N/A public String getTreeName() {
0N/A String name = nodeName;
0N/A if (parent != null) {
0N/A String pname = parent.getTreeName();
0N/A if (pname != null) {
0N/A name = pname + "." + name;
0N/A }
0N/A }
0N/A return name;
0N/A }
0N/A
0N/A public String getDescription() {
0N/A return description;
0N/A }
0N/A
0N/A public JComponent getJComponent() {
0N/A return (nodeName != null) ? new JLabel(description) : null;
0N/A }
0N/A
0N/A public Node getNext() {
0N/A return next;
0N/A }
0N/A
0N/A public void setNext(Node node) {
0N/A this.next = node;
0N/A }
0N/A
0N/A public void traverse(Visitor v) {
0N/A v.visit(this);
0N/A }
0N/A
0N/A public abstract void restoreDefault();
0N/A
0N/A public abstract void write(PrintWriter pw);
0N/A
0N/A public abstract String setOption(String key, String value);
0N/A
0N/A public static interface Visitor {
0N/A public void visit(Node node);
0N/A }
0N/A
0N/A public static interface Iterator {
0N/A public boolean hasNext();
0N/A public Node next();
0N/A }
0N/A}