harmony-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From ndbe...@apache.org
Subject svn commit: r421481 - /incubator/harmony/enhanced/classlib/trunk/modules/luni/src/main/java/java/util/Arrays.java
Date Thu, 13 Jul 2006 02:32:29 GMT
Author: ndbeyer
Date: Wed Jul 12 19:32:28 2006
New Revision: 421481

URL: http://svn.apache.org/viewvc?rev=421481&view=rev
Log:
Minor spelling cleanup.

Modified:
    incubator/harmony/enhanced/classlib/trunk/modules/luni/src/main/java/java/util/Arrays.java

Modified: incubator/harmony/enhanced/classlib/trunk/modules/luni/src/main/java/java/util/Arrays.java
URL: http://svn.apache.org/viewvc/incubator/harmony/enhanced/classlib/trunk/modules/luni/src/main/java/java/util/Arrays.java?rev=421481&r1=421480&r2=421481&view=diff
==============================================================================
--- incubator/harmony/enhanced/classlib/trunk/modules/luni/src/main/java/java/util/Arrays.java
(original)
+++ incubator/harmony/enhanced/classlib/trunk/modules/luni/src/main/java/java/util/Arrays.java
Wed Jul 12 19:32:28 2006
@@ -2351,7 +2351,7 @@
 
      /**
       * Finds the place of specified range of specified sorted array, where the
-      * element should be inserted for getting sorted array. Uses expionential
+      * element should be inserted for getting sorted array. Uses exponential
       * search algorithm.
       *
       * @param arr - the array with already sorted range
@@ -2515,9 +2515,9 @@
       * @param arr -
       *            the array to be sorted
       * @param src -
-      *            auxilary array
+      *            auxiliary array
       * @param dst -
-      *            auxilary array
+      *            auxiliary array
       * @param fromIndex -
       *            the index of the first element (inclusive) to be sorted.
       * @param toIndex -
@@ -2528,7 +2528,7 @@
      private static void stableStringSort(String[] arr, String[] src,
              String[] dst, int fromIndex, int toIndex, int chId) {
          int length = toIndex - fromIndex;
-         //use insertion sort fro small arrays
+         //use insertion sort for small arrays
          if (length < SIMPLE_LENGTH) {
              if (src == arr) {
                  for (int i = fromIndex + 1; i < toIndex; i++) {
@@ -2558,7 +2558,7 @@
              }
              return;
          }
-         // aproximate median
+         // Approximate median
          int s;
          int mid = fromIndex + length / 2;
          int lo = fromIndex;
@@ -2570,7 +2570,7 @@
              hi = medChar(hi, hi - s, hi - s * 2, src, chId);
          }
          mid = medChar(lo, mid, hi, src, chId);
-         //  median finded
+         //  median found
          // create 4 pointers <a (in star of src) ,
          //                      =b(in start of dst), >c (in end of dst)
          // i - current element;



Mime
View raw message