aboutsummaryrefslogtreecommitdiff
path: root/libjava/javax
diff options
context:
space:
mode:
Diffstat (limited to 'libjava/javax')
-rw-r--r--libjava/javax/swing/border/LineBorder.java2
-rw-r--r--libjava/javax/swing/plaf/TreeUI.java2
-rw-r--r--libjava/javax/swing/plaf/basic/BasicTreeUI.java2
3 files changed, 3 insertions, 3 deletions
diff --git a/libjava/javax/swing/border/LineBorder.java b/libjava/javax/swing/border/LineBorder.java
index bf42309..2b8c8ba 100644
--- a/libjava/javax/swing/border/LineBorder.java
+++ b/libjava/javax/swing/border/LineBorder.java
@@ -129,7 +129,7 @@ public class LineBorder
* it has rounded corners.
*
* <p><img src="doc-files/LineBorder-1.png" width="500" height="200"
- * alt="[An illustration of two LineBorders] />
+ * alt="[An illustration of two LineBorders]" />
*
* <p>Note that the enlarged view in the right-hand picture shows
* that the implementation draws one more pixel than specified,
diff --git a/libjava/javax/swing/plaf/TreeUI.java b/libjava/javax/swing/plaf/TreeUI.java
index 7c44134..55327e2 100644
--- a/libjava/javax/swing/plaf/TreeUI.java
+++ b/libjava/javax/swing/plaf/TreeUI.java
@@ -126,7 +126,7 @@ public abstract class TreeUI
* Finds the path that is closest to the specified position.
*
* <p><img src="doc-files/TreeUI-1.png" width="300" height="250"
- * alt="[A screen shot of a JTree] />
+ * alt="[A screen shot of a JTree]" />
*
* <p>As shown by the above illustration, the bounds of the
* closest path do not necessarily need to contain the passed
diff --git a/libjava/javax/swing/plaf/basic/BasicTreeUI.java b/libjava/javax/swing/plaf/basic/BasicTreeUI.java
index 0c20cb7..dac2f01 100644
--- a/libjava/javax/swing/plaf/basic/BasicTreeUI.java
+++ b/libjava/javax/swing/plaf/basic/BasicTreeUI.java
@@ -133,7 +133,7 @@ public class BasicTreeUI
* Finds the path that is closest to the specified position.
*
* <p><img src="../doc-files/TreeUI-1.png" width="300" height="250"
- * alt="[A screen shot of a JTree] />
+ * alt="[A screen shot of a JTree]" />
*
* <p>As shown by the above illustration, the bounds of the
* closest path do not necessarily need to contain the passed