14 |
|
import java.util.concurrent.ConcurrentLinkedQueue; |
15 |
|
|
16 |
|
import junit.framework.Test; |
17 |
– |
import junit.framework.TestSuite; |
17 |
|
|
18 |
|
public class ConcurrentLinkedQueueTest extends JSR166TestCase { |
19 |
|
|
20 |
|
public static void main(String[] args) { |
21 |
< |
junit.textui.TestRunner.run(suite()); |
21 |
> |
main(suite(), args); |
22 |
|
} |
23 |
|
|
24 |
|
public static Test suite() { |
25 |
< |
return new TestSuite(ConcurrentLinkedQueueTest.class); |
25 |
> |
class Implementation implements CollectionImplementation { |
26 |
> |
public Class<?> klazz() { return ConcurrentLinkedQueue.class; } |
27 |
> |
public Collection emptyCollection() { return new ConcurrentLinkedQueue(); } |
28 |
> |
public Object makeElement(int i) { return i; } |
29 |
> |
public boolean isConcurrent() { return true; } |
30 |
> |
public boolean permitsNulls() { return false; } |
31 |
> |
} |
32 |
> |
return newTestSuite(ConcurrentLinkedQueueTest.class, |
33 |
> |
CollectionTest.testSuite(new Implementation())); |
34 |
|
} |
35 |
|
|
36 |
|
/** |
37 |
|
* Returns a new queue of given size containing consecutive |
38 |
< |
* Integers 0 ... n. |
38 |
> |
* Integers 0 ... n - 1. |
39 |
|
*/ |
40 |
< |
private ConcurrentLinkedQueue<Integer> populatedQueue(int n) { |
41 |
< |
ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<Integer>(); |
40 |
> |
private static ConcurrentLinkedQueue<Integer> populatedQueue(int n) { |
41 |
> |
ConcurrentLinkedQueue<Integer> q = new ConcurrentLinkedQueue<>(); |
42 |
|
assertTrue(q.isEmpty()); |
43 |
|
for (int i = 0; i < n; ++i) |
44 |
|
assertTrue(q.offer(new Integer(i))); |
45 |
|
assertFalse(q.isEmpty()); |
46 |
|
assertEquals(n, q.size()); |
47 |
+ |
assertEquals((Integer) 0, q.peek()); |
48 |
|
return q; |
49 |
|
} |
50 |
|
|
60 |
|
*/ |
61 |
|
public void testConstructor3() { |
62 |
|
try { |
63 |
< |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue((Collection)null); |
63 |
> |
new ConcurrentLinkedQueue((Collection)null); |
64 |
|
shouldThrow(); |
65 |
|
} catch (NullPointerException success) {} |
66 |
|
} |
70 |
|
*/ |
71 |
|
public void testConstructor4() { |
72 |
|
try { |
73 |
< |
Integer[] ints = new Integer[SIZE]; |
66 |
< |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints)); |
73 |
> |
new ConcurrentLinkedQueue(Arrays.asList(new Integer[SIZE])); |
74 |
|
shouldThrow(); |
75 |
|
} catch (NullPointerException success) {} |
76 |
|
} |
79 |
|
* Initializing from Collection with some null elements throws NPE |
80 |
|
*/ |
81 |
|
public void testConstructor5() { |
82 |
+ |
Integer[] ints = new Integer[SIZE]; |
83 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
84 |
+ |
ints[i] = new Integer(i); |
85 |
|
try { |
86 |
< |
Integer[] ints = new Integer[SIZE]; |
77 |
< |
for (int i = 0; i < SIZE-1; ++i) |
78 |
< |
ints[i] = new Integer(i); |
79 |
< |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(Arrays.asList(ints)); |
86 |
> |
new ConcurrentLinkedQueue(Arrays.asList(ints)); |
87 |
|
shouldThrow(); |
88 |
|
} catch (NullPointerException success) {} |
89 |
|
} |
120 |
|
public void testSize() { |
121 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
122 |
|
for (int i = 0; i < SIZE; ++i) { |
123 |
< |
assertEquals(SIZE-i, q.size()); |
123 |
> |
assertEquals(SIZE - i, q.size()); |
124 |
|
q.remove(); |
125 |
|
} |
126 |
|
for (int i = 0; i < SIZE; ++i) { |
133 |
|
* offer(null) throws NPE |
134 |
|
*/ |
135 |
|
public void testOfferNull() { |
136 |
+ |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
137 |
|
try { |
130 |
– |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
138 |
|
q.offer(null); |
139 |
|
shouldThrow(); |
140 |
|
} catch (NullPointerException success) {} |
144 |
|
* add(null) throws NPE |
145 |
|
*/ |
146 |
|
public void testAddNull() { |
147 |
+ |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
148 |
|
try { |
141 |
– |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
149 |
|
q.add(null); |
150 |
|
shouldThrow(); |
151 |
|
} catch (NullPointerException success) {} |
172 |
|
} |
173 |
|
|
174 |
|
/** |
175 |
< |
* addAll(null) throws NPE |
175 |
> |
* addAll(null) throws NullPointerException |
176 |
|
*/ |
177 |
|
public void testAddAll1() { |
178 |
+ |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
179 |
|
try { |
172 |
– |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
180 |
|
q.addAll(null); |
181 |
|
shouldThrow(); |
182 |
|
} catch (NullPointerException success) {} |
183 |
|
} |
184 |
|
|
185 |
|
/** |
186 |
< |
* addAll(this) throws IAE |
186 |
> |
* addAll(this) throws IllegalArgumentException |
187 |
|
*/ |
188 |
|
public void testAddAllSelf() { |
189 |
+ |
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
190 |
|
try { |
183 |
– |
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
191 |
|
q.addAll(q); |
192 |
|
shouldThrow(); |
193 |
|
} catch (IllegalArgumentException success) {} |
194 |
|
} |
195 |
|
|
196 |
|
/** |
197 |
< |
* addAll of a collection with null elements throws NPE |
197 |
> |
* addAll of a collection with null elements throws NullPointerException |
198 |
|
*/ |
199 |
|
public void testAddAll2() { |
200 |
+ |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
201 |
|
try { |
202 |
< |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
195 |
< |
Integer[] ints = new Integer[SIZE]; |
196 |
< |
q.addAll(Arrays.asList(ints)); |
202 |
> |
q.addAll(Arrays.asList(new Integer[SIZE])); |
203 |
|
shouldThrow(); |
204 |
|
} catch (NullPointerException success) {} |
205 |
|
} |
209 |
|
* possibly adding some elements |
210 |
|
*/ |
211 |
|
public void testAddAll3() { |
212 |
+ |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
213 |
+ |
Integer[] ints = new Integer[SIZE]; |
214 |
+ |
for (int i = 0; i < SIZE - 1; ++i) |
215 |
+ |
ints[i] = new Integer(i); |
216 |
|
try { |
207 |
– |
ConcurrentLinkedQueue q = new ConcurrentLinkedQueue(); |
208 |
– |
Integer[] ints = new Integer[SIZE]; |
209 |
– |
for (int i = 0; i < SIZE-1; ++i) |
210 |
– |
ints[i] = new Integer(i); |
217 |
|
q.addAll(Arrays.asList(ints)); |
218 |
|
shouldThrow(); |
219 |
|
} catch (NullPointerException success) {} |
297 |
|
assertTrue(q.contains(i)); |
298 |
|
assertTrue(q.remove(i)); |
299 |
|
assertFalse(q.contains(i)); |
300 |
< |
assertTrue(q.contains(i-1)); |
300 |
> |
assertTrue(q.contains(i - 1)); |
301 |
|
} |
302 |
|
for (int i = 0; i < SIZE; i += 2) { |
303 |
|
assertTrue(q.contains(i)); |
304 |
|
assertTrue(q.remove(i)); |
305 |
|
assertFalse(q.contains(i)); |
306 |
< |
assertFalse(q.remove(i+1)); |
307 |
< |
assertFalse(q.contains(i+1)); |
306 |
> |
assertFalse(q.remove(i + 1)); |
307 |
> |
assertFalse(q.contains(i + 1)); |
308 |
|
} |
309 |
|
assertTrue(q.isEmpty()); |
310 |
|
} |
363 |
|
assertTrue(changed); |
364 |
|
|
365 |
|
assertTrue(q.containsAll(p)); |
366 |
< |
assertEquals(SIZE-i, q.size()); |
366 |
> |
assertEquals(SIZE - i, q.size()); |
367 |
|
p.remove(); |
368 |
|
} |
369 |
|
} |
376 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
377 |
|
ConcurrentLinkedQueue p = populatedQueue(i); |
378 |
|
assertTrue(q.removeAll(p)); |
379 |
< |
assertEquals(SIZE-i, q.size()); |
379 |
> |
assertEquals(SIZE - i, q.size()); |
380 |
|
for (int j = 0; j < i; ++j) { |
381 |
|
Integer x = (Integer)(p.remove()); |
382 |
|
assertFalse(q.contains(x)); |
389 |
|
*/ |
390 |
|
public void testToArray() { |
391 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
392 |
< |
Object[] o = q.toArray(); |
393 |
< |
for (int i = 0; i < o.length; i++) |
394 |
< |
assertSame(o[i], q.poll()); |
392 |
> |
Object[] a = q.toArray(); |
393 |
> |
assertSame(Object[].class, a.getClass()); |
394 |
> |
for (Object o : a) |
395 |
> |
assertSame(o, q.poll()); |
396 |
> |
assertTrue(q.isEmpty()); |
397 |
|
} |
398 |
|
|
399 |
|
/** |
404 |
|
Integer[] ints = new Integer[SIZE]; |
405 |
|
Integer[] array = q.toArray(ints); |
406 |
|
assertSame(ints, array); |
407 |
< |
for (int i = 0; i < ints.length; i++) |
408 |
< |
assertSame(ints[i], q.poll()); |
407 |
> |
for (Integer o : ints) |
408 |
> |
assertSame(o, q.poll()); |
409 |
> |
assertTrue(q.isEmpty()); |
410 |
|
} |
411 |
|
|
412 |
|
/** |
415 |
|
public void testToArray_NullArg() { |
416 |
|
ConcurrentLinkedQueue q = populatedQueue(SIZE); |
417 |
|
try { |
418 |
< |
q.toArray(null); |
418 |
> |
q.toArray((Object[])null); |
419 |
|
shouldThrow(); |
420 |
|
} catch (NullPointerException success) {} |
421 |
|
} |
514 |
|
} |
515 |
|
|
516 |
|
/** |
517 |
< |
* A deserialized serialized queue has same elements in same order |
517 |
> |
* A deserialized/reserialized queue has same elements in same order |
518 |
|
*/ |
519 |
|
public void testSerialization() throws Exception { |
520 |
|
Queue x = populatedQueue(SIZE); |