1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
|
/* getSiblingCount.java -- some checks for the getSiblingCount() method in the
DefaultMutableTreeNode class.
Copyright (C) 2006 David Gilbert <david.gilbert@object-refinery.com>
This file is part of Mauve.
Mauve is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
Mauve is distributed in the hope that it will be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
General Public License for more details.
You should have received a copy of the GNU General Public License
along with Mauve; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.
*/
// Tags: JDK1.2
package gnu.testlet.javax.swing.tree.DefaultMutableTreeNode;
import gnu.testlet.TestHarness;
import gnu.testlet.Testlet;
import javax.swing.tree.DefaultMutableTreeNode;
public class getSiblingCount implements Testlet
{
public void test(TestHarness harness)
{
DefaultMutableTreeNode n1 = new DefaultMutableTreeNode("A");
harness.check(n1.getSiblingCount(), 1);
DefaultMutableTreeNode n2 = new DefaultMutableTreeNode("B");
n1.add(n2);
harness.check(n2.getSiblingCount(), 1);
DefaultMutableTreeNode n3 = new DefaultMutableTreeNode("C");
n1.add(n3);
harness.check(n2.getSiblingCount(), 2);
harness.check(n3.getSiblingCount(), 2);
DefaultMutableTreeNode n4 = new DefaultMutableTreeNode("D");
n1.add(n4);
harness.check(n2.getSiblingCount(), 3);
harness.check(n3.getSiblingCount(), 3);
harness.check(n4.getSiblingCount(), 3);
}
}
|
