[cp-patches] FYI: Arrays.sort() fix for 31646

[Jeroen Frijters]

Hi,

Committed. Mark, please consider applying to 0.95 as well.

Regards,
Jeroen

2007-04-23  Jeroen Frijters  <[EMAIL PROTECTED]>

        PR classpath/31646:
        * java/util/Arrays.java (qsort): Corrected initial median calculation.

Index: Arrays.java
===================================================================
RCS file: /cvsroot/classpath/classpath/java/util/Arrays.java,v
retrieving revision 1.35
diff -u -r1.35 Arrays.java
--- Arrays.java 20 Jan 2007 02:08:32 -0000      1.35
+++ Arrays.java 21 Apr 2007 11:45:34 -0000
@@ -1309,7 +1309,7 @@
       }
 
     // Determine a good median element.
-    int mid = count / 2;
+    int mid = from + count / 2;
     int lo = from;
     int hi = from + count - 1;
 
@@ -1473,7 +1473,7 @@
       }
 
     // Determine a good median element.
-    int mid = count / 2;
+    int mid = from + count / 2;
     int lo = from;
     int hi = from + count - 1;
 
@@ -1637,7 +1637,7 @@
       }
 
     // Determine a good median element.
-    int mid = count / 2;
+    int mid = from + count / 2;
     int lo = from;
     int hi = from + count - 1;
 
@@ -1813,7 +1813,7 @@
       }
 
     // Determine a good median element.
-    int mid = count / 2;
+    int mid = from + count / 2;
     int lo = from;
     int hi = from + count - 1;
 
@@ -1989,7 +1989,7 @@
       }
 
     // Determine a good median element.
-    int mid = count / 2;
+    int mid = from + count / 2;
     int lo = from;
     int hi = from + count - 1;
 
@@ -2159,7 +2159,7 @@
       }
 
     // Determine a good median element.
-    int mid = count / 2;
+    int mid = from + count / 2;
     int lo = from;
     int hi = from + count - 1;
 
@@ -2329,7 +2329,7 @@
       }
 
     // Determine a good median element.
-    int mid = count / 2;
+    int mid = from + count / 2;
     int lo = from;
     int hi = from + count - 1;