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
|
// Tags: JDK1.2
// Copyright (C) 2005 David Gilbert <david.gilbert@object-refinery.com>
// 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, 59 Temple Place - Suite 330,
// Boston, MA 02111-1307, USA. */
package gnu.testlet.javax.swing.tree.TreePath;
import gnu.testlet.TestHarness;
import gnu.testlet.Testlet;
import javax.swing.tree.TreePath;
/**
* Some tests for the isDescendant() method in the {@link TreePath} class.
*/
public class isDescendant implements Testlet
{
/**
* Runs the test using the specified harness.
*
* @param harness the test harness (<code>null</code> not permitted).
*/
public void test(TestHarness harness)
{
TreePath p1 = new TreePath(new Object[] {new Integer(1), new Integer(2),
new Integer(3)});
TreePath p2 = new TreePath(new Integer(1));
TreePath p3 = new TreePath(new Integer(2));
TreePath p4 = new TreePath(new Integer(3));
TreePath p5 = new TreePath(new Object[] {new Integer(1), new Integer(2)});
TreePath p6 = new TreePath(new Object[] {new Integer(2), new Integer(3)});
TreePath p7 = new TreePath(new Object[] {new Integer(1), new Integer(2),
new Integer(3)});
TreePath p8 = new TreePath(new Object[] {new Integer(1), new Integer(2),
new Integer(3), new Integer(4)});
TreePath p9 = new TreePath(new Object[] {new Integer(2), new Integer(3),
new Integer(4)});
harness.check(p1.isDescendant(p2), false);
harness.check(p1.isDescendant(p3), false);
harness.check(p1.isDescendant(p4), false);
harness.check(p1.isDescendant(p5), false);
harness.check(p1.isDescendant(p6), false);
harness.check(p1.isDescendant(p7), true);
harness.check(p1.isDescendant(p8), true);
harness.check(p1.isDescendant(p9), false);
harness.check(p1.isDescendant(null), false);
}
}
|
