--- old/src/java.desktop/share/classes/java/awt/Rectangle.java	2014-08-21 20:50:40.057545600 +0400
+++ new/src/java.desktop/share/classes/java/awt/Rectangle.java	2014-08-21 20:50:39.854534000 +0400
@@ -49,10 +49,10 @@
  * will include the location of the {@code Rectangle} on that axis in the
  * result as if the {@link #add(Point)} method were being called.
  * <p>
- * <a name="NonExistant">
+ * <a name="NonExistent">
  * A {@code Rectangle} whose width or height is negative has neither
  * location nor dimension along those axes with negative dimensions.
- * Such a {@code Rectangle} is treated as non-existant along those axes.
+ * Such a {@code Rectangle} is treated as non-existent along those axes.
  * Such a {@code Rectangle} is also empty with respect to containment
  * calculations and methods which test if it contains or intersects a
  * point or rectangle will always return false.
@@ -106,7 +106,7 @@
  * moved to store it into its pair of 32-bit fields then the dimensions
  * will be adjusted relative to the "best representation" of the location.
  * If the true result had a negative dimension and was therefore
- * non-existant along one or both axes, the stored dimensions will be
+ * non-existent along one or both axes, the stored dimensions will be
  * negative numbers in those axes.
  * If the true result had a location that could be represented within
  * the range of 32-bit integers, but zero dimension along one or both
@@ -381,7 +381,7 @@
             // We cannot even reach the left side of the specified
             // rectangle even with both x & width set to MAX_VALUE.
             // The intersection with the "maximal integer rectangle"
-            // is non-existant so we should use a width < 0.
+            // is non-existent so we should use a width < 0.
             // REMIND: Should we try to determine a more "meaningful"
             // adjusted value for neww than just "-1"?
             newx = Integer.MAX_VALUE;
@@ -845,7 +845,7 @@
      * represents the union of the two rectangles.
      * <p>
      * If either {@code Rectangle} has any dimension less than zero
-     * the rules for <a href=#NonExistant>non-existant</a> rectangles
+     * the rules for <a href=#NonExistent>non-existent</a> rectangles
      * apply.
      * If only one has a dimension less than zero, then the result
      * will be a copy of the other {@code Rectangle}.
@@ -867,8 +867,8 @@
         if ((tx2 | ty2) < 0) {
             // This rectangle has negative dimensions...
             // If r has non-negative dimensions then it is the answer.
-            // If r is non-existant (has a negative dimension), then both
-            // are non-existant and we can return any non-existant rectangle
+            // If r is non-existent (has a negative dimension), then both
+            // are non-existent and we can return any non-existent rectangle
             // as an answer.  Thus, returning r meets that criterion.
             // Either way, r is our answer.
             return new Rectangle(r);
@@ -905,7 +905,7 @@
      * to the bounds of this {@code Rectangle}.
      * <p>
      * If this {@code Rectangle} has any dimension less than zero,
-     * the rules for <a href=#NonExistant>non-existant</a>
+     * the rules for <a href=#NonExistent>non-existent</a>
      * rectangles apply.
      * In that case, the new bounds of this {@code Rectangle} will
      * have a location equal to the specified coordinates and
@@ -956,7 +956,7 @@
      * {@code Rectangle}.
      * <p>
      * If this {@code Rectangle} has any dimension less than zero,
-     * the rules for <a href=#NonExistant>non-existant</a>
+     * the rules for <a href=#NonExistent>non-existent</a>
      * rectangles apply.
      * In that case, the new bounds of this {@code Rectangle} will
      * have a location equal to the coordinates of the specified
@@ -1075,7 +1075,7 @@
         y1 += v;
 
         if (x1 < x0) {
-            // Non-existant in X direction
+            // Non-existent in X direction
             // Final width must remain negative so subtract x0 before
             // it is clipped so that we avoid the risk that the clipping
             // of x0 will reverse the ordering of x0 and x1.
@@ -1098,7 +1098,7 @@
         }
 
         if (y1 < y0) {
-            // Non-existant in Y direction
+            // Non-existent in Y direction
             y1 -= y0;
             if (y1 < Integer.MIN_VALUE) y1 = Integer.MIN_VALUE;
             if (y0 < Integer.MIN_VALUE) y0 = Integer.MIN_VALUE;