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 |
import junit.framework.TestSuite; |
14 |
|
15 |
public class ArrayDeque8Test extends JSR166TestCase { |
16 |
public static void main(String[] args) { |
17 |
main(suite(), args); |
18 |
} |
19 |
|
20 |
public static Test suite() { |
21 |
return newTestSuite(ArrayDeque8Test.class); |
22 |
} |
23 |
|
24 |
/** |
25 |
* Spliterator.getComparator always throws IllegalStateException |
26 |
*/ |
27 |
public void testSpliterator_getComparator() { |
28 |
assertThrows(IllegalStateException.class, |
29 |
() -> new ArrayDeque().spliterator().getComparator()); |
30 |
} |
31 |
|
32 |
/** |
33 |
* Spliterator characteristics are as advertised |
34 |
*/ |
35 |
public void testSpliterator_characteristics() { |
36 |
ArrayDeque q = new ArrayDeque(); |
37 |
Spliterator s = q.spliterator(); |
38 |
int characteristics = s.characteristics(); |
39 |
int required = Spliterator.NONNULL |
40 |
| Spliterator.ORDERED |
41 |
| Spliterator.SIZED |
42 |
| Spliterator.SUBSIZED; |
43 |
assertEquals(required, characteristics & required); |
44 |
assertTrue(s.hasCharacteristics(required)); |
45 |
assertEquals(0, characteristics |
46 |
& (Spliterator.CONCURRENT |
47 |
| Spliterator.DISTINCT |
48 |
| Spliterator.IMMUTABLE |
49 |
| Spliterator.SORTED)); |
50 |
} |
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 |
55 |
*/ |
56 |
public void testHuge() { |
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; |
65 |
|
66 |
assertThrows(OutOfMemoryError.class, |
67 |
() -> new ArrayDeque<>(Integer.MAX_VALUE)); |
68 |
|
69 |
{ |
70 |
q = new ArrayDeque<>(maxSize); |
71 |
assertEquals(0, q.size()); |
72 |
assertTrue(q.isEmpty()); |
73 |
q = null; |
74 |
} |
75 |
|
76 |
{ |
77 |
q = new ArrayDeque(); |
78 |
assertTrue(q.addAll(Collections.nCopies(maxSize - 2, e))); |
79 |
assertEquals(e, q.peekFirst()); |
80 |
assertEquals(e, q.peekLast()); |
81 |
assertEquals(maxSize - 2, q.size()); |
82 |
q.addFirst((Integer) 0); |
83 |
q.addLast((Integer) 1); |
84 |
assertEquals((Integer) 0, q.peekFirst()); |
85 |
assertEquals((Integer) 1, q.peekLast()); |
86 |
assertEquals(maxSize, q.size()); |
87 |
|
88 |
ArrayDeque qq = q; |
89 |
ArrayDeque smallish = new ArrayDeque( |
90 |
Collections.nCopies(Integer.MAX_VALUE - maxSize + 1, e)); |
91 |
assertThrows( |
92 |
IllegalStateException.class, |
93 |
() -> qq.addAll(qq), |
94 |
() -> qq.addAll(smallish), |
95 |
() -> smallish.addAll(qq)); |
96 |
} |
97 |
} |
98 |
|
99 |
} |