| 1 |
/* |
| 2 |
* Written by Doug Lea and Martin Buchholz with assistance from |
| 3 |
* members of JCP JSR-166 Expert Group and released to the public |
| 4 |
* domain, as explained at |
| 5 |
* http://creativecommons.org/publicdomain/zero/1.0/ |
| 6 |
*/ |
| 7 |
|
| 8 |
import java.util.ArrayDeque; |
| 9 |
import java.util.Collections; |
| 10 |
import java.util.Spliterator; |
| 11 |
|
| 12 |
import junit.framework.Test; |
| 13 |
|
| 14 |
public class ArrayDeque8Test extends JSR166TestCase { |
| 15 |
public static void main(String[] args) { |
| 16 |
main(suite(), args); |
| 17 |
} |
| 18 |
|
| 19 |
public static Test suite() { |
| 20 |
return newTestSuite(ArrayDeque8Test.class); |
| 21 |
} |
| 22 |
|
| 23 |
/** |
| 24 |
* Spliterator.getComparator always throws IllegalStateException |
| 25 |
*/ |
| 26 |
public void testSpliterator_getComparator() { |
| 27 |
assertThrows(IllegalStateException.class, |
| 28 |
() -> new ArrayDeque().spliterator().getComparator()); |
| 29 |
} |
| 30 |
|
| 31 |
/** |
| 32 |
* Spliterator characteristics are as advertised |
| 33 |
*/ |
| 34 |
public void testSpliterator_characteristics() { |
| 35 |
ArrayDeque q = new ArrayDeque(); |
| 36 |
Spliterator s = q.spliterator(); |
| 37 |
int characteristics = s.characteristics(); |
| 38 |
int required = Spliterator.NONNULL |
| 39 |
| Spliterator.ORDERED |
| 40 |
| Spliterator.SIZED |
| 41 |
| Spliterator.SUBSIZED; |
| 42 |
assertEquals(required, characteristics & required); |
| 43 |
assertTrue(s.hasCharacteristics(required)); |
| 44 |
assertEquals(0, characteristics |
| 45 |
& (Spliterator.CONCURRENT |
| 46 |
| Spliterator.DISTINCT |
| 47 |
| Spliterator.IMMUTABLE |
| 48 |
| Spliterator.SORTED)); |
| 49 |
} |
| 50 |
|
| 51 |
/** |
| 52 |
* Handle capacities near Integer.MAX_VALUE. |
| 53 |
* ant -Dvmoptions='-Xms28g -Xmx28g' -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDeque8Test -Djsr166.methodFilter=testHugeCapacity tck |
| 54 |
*/ |
| 55 |
public void testHugeCapacity() { |
| 56 |
if (! (testImplementationDetails |
| 57 |
&& expensiveTests |
| 58 |
&& Runtime.getRuntime().maxMemory() > 24L * (1 << 30))) |
| 59 |
return; |
| 60 |
|
| 61 |
final Integer e = 42; |
| 62 |
final int maxArraySize = Integer.MAX_VALUE - 8; |
| 63 |
|
| 64 |
assertThrows(OutOfMemoryError.class, |
| 65 |
() -> new ArrayDeque(Integer.MAX_VALUE)); |
| 66 |
|
| 67 |
{ |
| 68 |
ArrayDeque q = new ArrayDeque(maxArraySize - 1); |
| 69 |
assertEquals(0, q.size()); |
| 70 |
assertTrue(q.isEmpty()); |
| 71 |
q = null; |
| 72 |
} |
| 73 |
|
| 74 |
{ |
| 75 |
ArrayDeque q = new ArrayDeque(); |
| 76 |
assertTrue(q.addAll(Collections.nCopies(maxArraySize - 3, e))); |
| 77 |
assertEquals(e, q.peekFirst()); |
| 78 |
assertEquals(e, q.peekLast()); |
| 79 |
assertEquals(maxArraySize - 3, q.size()); |
| 80 |
q.addFirst((Integer) 0); |
| 81 |
q.addLast((Integer) 1); |
| 82 |
assertEquals((Integer) 0, q.peekFirst()); |
| 83 |
assertEquals((Integer) 1, q.peekLast()); |
| 84 |
assertEquals(maxArraySize - 1, q.size()); |
| 85 |
|
| 86 |
ArrayDeque smallish = new ArrayDeque( |
| 87 |
Collections.nCopies(Integer.MAX_VALUE - q.size() + 1, e)); |
| 88 |
assertThrows( |
| 89 |
IllegalStateException.class, |
| 90 |
() -> q.addAll(q), |
| 91 |
() -> q.addAll(smallish), |
| 92 |
() -> smallish.addAll(q)); |
| 93 |
} |
| 94 |
} |
| 95 |
|
| 96 |
} |
