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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
|
// Tags: JDK1.2
// Copyright (C) 2004, 2006, Michael Koch <konqueror@gmx.de>
// 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.
package gnu.testlet.javax.swing.tree.DefaultMutableTreeNode;
import gnu.testlet.TestHarness;
import gnu.testlet.Testlet;
import javax.swing.tree.DefaultMutableTreeNode;
public class add implements Testlet
{
public void test(TestHarness h)
{
h.checkPoint("(MutableTreeNode)");
DefaultMutableTreeNode a, b, c;
a = new DefaultMutableTreeNode();
b = new DefaultMutableTreeNode();
c = new DefaultMutableTreeNode(null, false);
// try adding null
boolean ok = false;
try
{
a.add(null);
}
catch (IllegalArgumentException e)
{
ok = true;
}
h.check(ok);
// try adding to a node that doesn't allow children
ok = false;
try
{
c.add(a);
}
catch (IllegalStateException e)
{
ok = true;
}
h.check(ok);
a.add(b);
a.add(c);
h.check(a.isNodeChild(b));
h.check(b.getParent(), a);
h.check(a.isNodeChild(c));
h.check(c.getParent(), a);
h.check(!b.isNodeChild(c));
b.add(c);
h.check(a.isNodeChild(b));
h.check(!a.isNodeChild(c));
h.check(b.isNodeChild(c));
// can we add a node to itself? no because a node is considered its own
// ancestor
boolean pass = false;
try
{
a.add(a);
}
catch (IllegalArgumentException e)
{
pass = true;
}
h.check(pass);
// same goes for adding a as a child of c
pass = false;
try
{
b.add(a);
}
catch (IllegalArgumentException e)
{
pass = true;
}
h.check(pass);
}
}
|
