| 51 |
|
|
| 52 |
|
/** |
| 53 |
|
* Handle capacities near Integer.MAX_VALUE. |
| 54 |
< |
* ant -Dvmoptions='-Xms28g -Xmx28g' -Djsr166.testImplementationDetails=true -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDequeTest -Djsr166.methodFilter=testHuge tck |
| 54 |
> |
* ant -Dvmoptions='-Xms28g -Xmx28g' -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDeque8Test -Djsr166.methodFilter=testHugeCapacity tck |
| 55 |
|
*/ |
| 56 |
< |
public void testHuge() { |
| 56 |
> |
public void testHugeCapacity() { |
| 57 |
|
if (! (testImplementationDetails |
| 58 |
|
&& expensiveTests |
| 59 |
|
&& Runtime.getRuntime().maxMemory() > 24L * (1 << 30))) |
| 60 |
|
return; |
| 61 |
|
|
| 62 |
< |
ArrayDeque q; |
| 63 |
< |
Integer e = 42; |
| 64 |
< |
final int maxSize = Integer.MAX_VALUE - 8; |
| 62 |
> |
final Integer e = 42; |
| 63 |
> |
final int maxArraySize = Integer.MAX_VALUE - 8; |
| 64 |
|
|
| 65 |
|
assertThrows(OutOfMemoryError.class, |
| 66 |
< |
() -> new ArrayDeque<>(Integer.MAX_VALUE)); |
| 66 |
> |
() -> new ArrayDeque(Integer.MAX_VALUE)); |
| 67 |
|
|
| 68 |
|
{ |
| 69 |
< |
q = new ArrayDeque<>(maxSize); |
| 69 |
> |
ArrayDeque q = new ArrayDeque(maxArraySize - 1); |
| 70 |
|
assertEquals(0, q.size()); |
| 71 |
|
assertTrue(q.isEmpty()); |
| 72 |
|
q = null; |
| 73 |
|
} |
| 74 |
|
|
| 75 |
|
{ |
| 76 |
< |
q = new ArrayDeque(); |
| 77 |
< |
assertTrue(q.addAll(Collections.nCopies(maxSize - 2, e))); |
| 76 |
> |
ArrayDeque q = new ArrayDeque(); |
| 77 |
> |
assertTrue(q.addAll(Collections.nCopies(maxArraySize - 3, e))); |
| 78 |
|
assertEquals(e, q.peekFirst()); |
| 79 |
|
assertEquals(e, q.peekLast()); |
| 80 |
< |
assertEquals(maxSize - 2, q.size()); |
| 80 |
> |
assertEquals(maxArraySize - 3, q.size()); |
| 81 |
|
q.addFirst((Integer) 0); |
| 82 |
|
q.addLast((Integer) 1); |
| 83 |
|
assertEquals((Integer) 0, q.peekFirst()); |
| 84 |
|
assertEquals((Integer) 1, q.peekLast()); |
| 85 |
< |
assertEquals(maxSize, q.size()); |
| 85 |
> |
assertEquals(maxArraySize - 1, q.size()); |
| 86 |
|
|
| 87 |
|
ArrayDeque qq = q; |
| 88 |
|
ArrayDeque smallish = new ArrayDeque( |
| 89 |
< |
Collections.nCopies(Integer.MAX_VALUE - maxSize + 1, e)); |
| 89 |
> |
Collections.nCopies(Integer.MAX_VALUE - q.size() + 1, e)); |
| 90 |
|
assertThrows( |
| 91 |
|
IllegalStateException.class, |
| 92 |
|
() -> qq.addAll(qq), |
