[HARMONY-6139] [classlib][luni][java6] java.util.Arrays.binarySearch(short[] array, int startIndex, int endIndex, short value) should return (-(insertion point) - 1) rather than -1 if value is not found in the given range

• Type: Bug
• Status: Resolved
• Priority: Major
• Resolution: Fixed
• Affects Version/s: 5.0M8
• Fix Version/s: 5.0M9
• Component/s: Classlib
• Estimated Complexity: Moderate
• Assignee: Kevin Zhou
• Reporter: Kevin Zhou
• Created: 07/Apr/09 03:20
• Updated: 14/Apr/10 08:07
• Resolved: 14/Apr/10 08:06

Description

Given a test case [1] below, RI passes while HY6 fails.
The testcase is used to test the binarySearch(short[] array, int startIndex, int endIndex, short value) of java.util.Arrays class.
According to java spec, if the given value is not found in the given range of array, this method should return (-(insertion point) - 1) rather than -1.
Here, "insertion point" is defined as the point at which the key would be inserted into the array or endIndex if all elements in the range are less than the specified key. And HY6 doesn't implement this.

[1] Test Case:
public void test_Arrays_binaraySearch_short() {
assertEquals(-2, Arrays.binarySearch(new short[]

{ (short) -1 }

, 1, 1, (short)0));
}