Commit 26578e60 by Marco Trudel Committed by Tom Tromey

Arrays.java (binarySearch): Change comparison order.

2007-01-23  Marco Trudel  <mtrudel@gmx.ch>

	* java/util/Arrays.java (binarySearch): Change comparison order.

From-SVN: r121091
parent 815951d8
2007-01-23 Marco Trudel <mtrudel@gmx.ch>
* java/util/Arrays.java (binarySearch): Change comparison order.
2007-01-17 Tom Tromey <tromey@redhat.com>
* tools/gnu/classpath/tools/javah/PathOptionGroup.java
/* Arrays.java -- Utility class with methods to operate on arrays
Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006,
Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
Free Software Foundation, Inc.
This file is part of GNU Classpath.
......@@ -370,10 +370,13 @@ public class Arrays
while (low <= hi)
{
mid = (low + hi) >>> 1;
final int d = Collections.compare(key, a[mid], c);
// NOTE: Please keep the order of a[mid] and key. Although
// not required by the specs, the RI has it in this order as
// well, and real programs (erroneously) depend on it.
final int d = Collections.compare(a[mid], key, c);
if (d == 0)
return mid;
else if (d < 0)
else if (d > 0)
hi = mid - 1;
else
// This gets the insertion point right on the last loop
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment