42319
|
1 |
/*
|
|
2 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
3 |
*
|
|
4 |
* This code is free software; you can redistribute it and/or modify it
|
|
5 |
* under the terms of the GNU General Public License version 2 only, as
|
|
6 |
* published by the Free Software Foundation.
|
|
7 |
*
|
|
8 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
9 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
10 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
11 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
12 |
* accompanied this code).
|
|
13 |
*
|
|
14 |
* You should have received a copy of the GNU General Public License version
|
|
15 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
16 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
17 |
*
|
|
18 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
19 |
* or visit www.oracle.com if you need additional information or have any
|
|
20 |
* questions.
|
|
21 |
*/
|
|
22 |
|
|
23 |
/*
|
|
24 |
* This file is available under and governed by the GNU General Public
|
|
25 |
* License version 2 only, as published by the Free Software Foundation.
|
|
26 |
* However, the following notice accompanied the original version of this
|
|
27 |
* file:
|
|
28 |
*
|
|
29 |
* Written by Doug Lea and Martin Buchholz with assistance from
|
|
30 |
* members of JCP JSR-166 Expert Group and released to the public
|
|
31 |
* domain, as explained at
|
|
32 |
* http://creativecommons.org/publicdomain/zero/1.0/
|
|
33 |
*/
|
|
34 |
|
|
35 |
import java.util.ArrayDeque;
|
|
36 |
import java.util.Collections;
|
|
37 |
import java.util.Spliterator;
|
|
38 |
|
|
39 |
import junit.framework.Test;
|
|
40 |
|
|
41 |
public class ArrayDeque8Test extends JSR166TestCase {
|
|
42 |
public static void main(String[] args) {
|
|
43 |
main(suite(), args);
|
|
44 |
}
|
|
45 |
|
|
46 |
public static Test suite() {
|
|
47 |
return newTestSuite(ArrayDeque8Test.class);
|
|
48 |
}
|
|
49 |
|
|
50 |
/**
|
|
51 |
* Spliterator.getComparator always throws IllegalStateException
|
|
52 |
*/
|
|
53 |
public void testSpliterator_getComparator() {
|
|
54 |
assertThrows(IllegalStateException.class,
|
|
55 |
() -> new ArrayDeque().spliterator().getComparator());
|
|
56 |
}
|
|
57 |
|
|
58 |
/**
|
|
59 |
* Spliterator characteristics are as advertised
|
|
60 |
*/
|
|
61 |
public void testSpliterator_characteristics() {
|
|
62 |
ArrayDeque q = new ArrayDeque();
|
|
63 |
Spliterator s = q.spliterator();
|
|
64 |
int characteristics = s.characteristics();
|
|
65 |
int required = Spliterator.NONNULL
|
|
66 |
| Spliterator.ORDERED
|
|
67 |
| Spliterator.SIZED
|
|
68 |
| Spliterator.SUBSIZED;
|
|
69 |
assertEquals(required, characteristics & required);
|
|
70 |
assertTrue(s.hasCharacteristics(required));
|
|
71 |
assertEquals(0, characteristics
|
|
72 |
& (Spliterator.CONCURRENT
|
|
73 |
| Spliterator.DISTINCT
|
|
74 |
| Spliterator.IMMUTABLE
|
|
75 |
| Spliterator.SORTED));
|
|
76 |
}
|
|
77 |
|
|
78 |
/**
|
|
79 |
* Handle capacities near Integer.MAX_VALUE.
|
|
80 |
* ant -Dvmoptions='-Xms28g -Xmx28g' -Djsr166.expensiveTests=true -Djsr166.tckTestClass=ArrayDeque8Test -Djsr166.methodFilter=testHugeCapacity tck
|
|
81 |
*/
|
|
82 |
public void testHugeCapacity() {
|
|
83 |
if (! (testImplementationDetails
|
|
84 |
&& expensiveTests
|
|
85 |
&& Runtime.getRuntime().maxMemory() > 24L * (1 << 30)))
|
|
86 |
return;
|
|
87 |
|
|
88 |
final Integer e = 42;
|
|
89 |
final int maxArraySize = Integer.MAX_VALUE - 8;
|
|
90 |
|
|
91 |
assertThrows(OutOfMemoryError.class,
|
|
92 |
() -> new ArrayDeque(Integer.MAX_VALUE));
|
|
93 |
|
|
94 |
{
|
|
95 |
ArrayDeque q = new ArrayDeque(maxArraySize - 1);
|
|
96 |
assertEquals(0, q.size());
|
|
97 |
assertTrue(q.isEmpty());
|
|
98 |
q = null;
|
|
99 |
}
|
|
100 |
|
|
101 |
{
|
|
102 |
ArrayDeque q = new ArrayDeque();
|
|
103 |
assertTrue(q.addAll(Collections.nCopies(maxArraySize - 3, e)));
|
|
104 |
assertEquals(e, q.peekFirst());
|
|
105 |
assertEquals(e, q.peekLast());
|
|
106 |
assertEquals(maxArraySize - 3, q.size());
|
|
107 |
q.addFirst((Integer) 0);
|
|
108 |
q.addLast((Integer) 1);
|
|
109 |
assertEquals((Integer) 0, q.peekFirst());
|
|
110 |
assertEquals((Integer) 1, q.peekLast());
|
|
111 |
assertEquals(maxArraySize - 1, q.size());
|
|
112 |
|
|
113 |
ArrayDeque qq = q;
|
|
114 |
ArrayDeque smallish = new ArrayDeque(
|
|
115 |
Collections.nCopies(Integer.MAX_VALUE - q.size() + 1, e));
|
|
116 |
assertThrows(
|
|
117 |
IllegalStateException.class,
|
|
118 |
() -> qq.addAll(qq),
|
|
119 |
() -> qq.addAll(smallish),
|
|
120 |
() -> smallish.addAll(qq));
|
|
121 |
}
|
|
122 |
}
|
|
123 |
|
|
124 |
}
|