On 23/08/2013 16:24, roger riggs wrote:
Hi,
I reviewed the algorithm of the test case and it seems to me that it
produces the smallest number of total items to sort for a given stack
depth.
I ran it with other stack depths and confirmed that the implementation
did
not exceed the new limit.
On 22/08/2013 15:25, roger riggs wrote:
Please review the fix for:
JDK-8011944[1] : Sort fails with ArrayIndexOutOfBoundsException
The pending run stack size is estimated based on the input size.
The worst case sequence of inputs exceeds the current allocation and
an exception occurs.
Hi,
I reviewed the algorithm of the test case and it seems to me that it
produces the smallest number of total items to sort for a given stack depth.
I ran it with other stack depths and confirmed that the implementation did
not exceed the new limit.
I was unable to discover a specific
Please review the fix for:
JDK-8011944[1] : Sort fails with ArrayIndexOutOfBoundsException
The pending run stack size is estimated based on the input size.
The worst case sequence of inputs exceeds the current allocation and an
exception occurs.
Increasing the allocation of the pending run
