Mercurial > hg > truffle

comparison agent/src/share/classes/sun/jvm/hotspot/ui/tree/SimpleTreeGroupNode.java @ 0:a61af66fc99e jdk7-b24

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Initial load
author duke
date Sat, 01 Dec 2007 00:00:00 +0000
parents
children c18cbe5936b8
comparison
equal deleted inserted replaced
-1:000000000000 0:a61af66fc99e
1 /*
2 * Copyright 2001-2002 Sun Microsystems, Inc. All Rights Reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
24
25 package sun.jvm.hotspot.ui.tree;
26
27 import java.util.*;
28
29 /** Node to which others can be added; suitable for use as root node
30 of graph */
31
32 public class SimpleTreeGroupNode implements SimpleTreeNode {
33 private List children;
34
35 public SimpleTreeGroupNode() {
36 children = new ArrayList();
37 }
38
39 public int getChildCount() { return children.size(); }
40 public SimpleTreeNode getChild(int index) {
41 return (SimpleTreeNode) children.get(index);
42 }
43 public void addChild(SimpleTreeNode child) {
44 children.add(child);
45 }
46 public SimpleTreeNode removeChild(int index) {
47 return (SimpleTreeNode) children.remove(index);
48 }
49 public void removeAllChildren() {
50 children.clear();
51 }
52 public boolean isLeaf() {
53 return false;
54 }
55 public int getIndexOfChild(SimpleTreeNode child) {
56 return children.indexOf(child);
57 }
58
59 public String getName() { return null; }
60 public String getValue() { return null; }
61 }