jdk/src/share/classes/javax/swing/event/TreeModelEvent.java
changeset 21278 ef8a3a2a72f2
parent 20458 f2423fb3fd19
child 22574 7f8ce0c8c20a
--- a/jdk/src/share/classes/javax/swing/event/TreeModelEvent.java	Tue Oct 29 16:35:20 2013 +0400
+++ b/jdk/src/share/classes/javax/swing/event/TreeModelEvent.java	Tue Oct 29 17:01:06 2013 +0400
@@ -89,7 +89,7 @@
      * before the deletes have occurred. Since the indexes must be specified in
      * order, the most natural processing methodology is to use a delete-counter.
      * Start by initializing the counter to zero and start work through the
-     * list from lowest to higest. Every time you do a delete, add the current
+     * list from lowest to highest. Every time you do a delete, add the current
      * value of the delete-counter to the index-position where the delete occurred,
      * and append the result to a Vector of delete-locations, using
      * <code>addElement()</code>. Then increment the delete-counter. The index