1 files changed, 58 insertions, 0 deletions
diff --git a/gnu/testlet/javax/swing/tree/DefaultMutableTreeNode/getFirstChild.java b/gnu/testlet/javax/swing/tree/DefaultMutableTreeNode/getFirstChild.java
new file mode 100644
index 00000000..e84d9892
--- /dev/null
+++ b/gnu/testlet/javax/swing/tree/DefaultMutableTreeNode/getFirstChild.java
@@ -0,0 +1,58 @@
+/* getFirstChild.java -- some checks for the getFirstChild() 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 java.util.NoSuchElementException;
+
+import javax.swing.tree.DefaultMutableTreeNode;
+
+public class getFirstChild implements Testlet
+{
+  public void test(TestHarness harness)
+  {
+    DefaultMutableTreeNode n1 = new DefaultMutableTreeNode("A");
+    boolean pass = false;
+    try
+      {
+        n1.getFirstChild();
+      }
+    catch (NoSuchElementException e)
+      {
+        pass = true;  
+      }
+    harness.check(pass);
+    DefaultMutableTreeNode n2 = new DefaultMutableTreeNode("B");
+    n1.add(n2);
+    harness.check(n1.getFirstChild(), n2);
+    DefaultMutableTreeNode n3 = new DefaultMutableTreeNode("C");
+    n1.add(n3);
+    harness.check(n1.getFirstChild(), n2);
+    n1.remove(0);    
+    harness.check(n1.getFirstChild(), n3);   
+  }
+}